/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix009_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:19:23,773 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:19:23,776 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:19:23,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:19:23,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:19:23,792 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:19:23,793 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:19:23,795 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:19:23,797 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:19:23,797 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:19:23,798 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:19:23,799 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:19:23,800 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:19:23,801 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:19:23,802 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:19:23,803 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:19:23,803 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:19:23,804 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:19:23,806 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:19:23,808 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:19:23,810 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:19:23,811 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:19:23,812 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:19:23,813 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:19:23,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:19:23,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:19:23,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:19:23,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:19:23,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:19:23,818 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:19:23,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:19:23,819 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:19:23,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:19:23,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:19:23,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:19:23,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:19:23,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:19:23,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:19:23,823 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:19:23,824 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:19:23,824 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:19:23,825 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf [2019-12-27 05:19:23,839 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:19:23,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:19:23,841 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:19:23,841 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:19:23,841 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:19:23,841 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:19:23,841 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:19:23,842 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:19:23,842 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:19:23,842 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:19:23,842 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:19:23,842 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:19:23,843 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:19:23,843 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:19:23,843 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:19:23,843 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:19:23,843 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:19:23,844 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:19:23,844 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:19:23,844 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:19:23,844 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:19:23,844 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:19:23,845 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:19:23,845 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:19:23,845 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:19:23,845 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:19:23,845 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:19:23,846 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:19:23,846 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:19:23,846 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:19:24,119 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:19:24,131 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:19:24,135 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:19:24,136 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:19:24,136 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:19:24,137 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix009_pso.oepc.i [2019-12-27 05:19:24,210 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3c07171e/33934ae7d4574b82ad0a7a993ca7541b/FLAGa0b997417 [2019-12-27 05:19:24,785 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:19:24,786 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix009_pso.oepc.i [2019-12-27 05:19:24,802 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3c07171e/33934ae7d4574b82ad0a7a993ca7541b/FLAGa0b997417 [2019-12-27 05:19:25,110 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b3c07171e/33934ae7d4574b82ad0a7a993ca7541b [2019-12-27 05:19:25,120 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:19:25,122 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:19:25,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:19:25,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:19:25,127 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:19:25,128 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:19:25" (1/1) ... [2019-12-27 05:19:25,131 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14e8aa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:19:25, skipping insertion in model container [2019-12-27 05:19:25,131 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:19:25" (1/1) ... [2019-12-27 05:19:25,139 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:19:25,195 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:19:25,718 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:19:25,731 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:19:25,802 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:19:25,885 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:19:25,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:19:25 WrapperNode [2019-12-27 05:19:25,886 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:19:25,887 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:19:25,887 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:19:25,887 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:19:25,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:19:25" (1/1) ... [2019-12-27 05:19:25,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:19:25" (1/1) ... [2019-12-27 05:19:25,949 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:19:25,949 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:19:25,949 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:19:25,950 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:19:25,960 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:19:25" (1/1) ... [2019-12-27 05:19:25,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:19:25" (1/1) ... [2019-12-27 05:19:25,965 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:19:25" (1/1) ... [2019-12-27 05:19:25,965 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:19:25" (1/1) ... [2019-12-27 05:19:25,995 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:19:25" (1/1) ... [2019-12-27 05:19:26,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:19:25" (1/1) ... [2019-12-27 05:19:26,003 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:19:25" (1/1) ... [2019-12-27 05:19:26,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:19:26,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:19:26,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:19:26,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:19:26,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:19:25" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:19:26,075 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:19:26,076 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:19:26,076 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:19:26,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:19:26,076 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:19:26,076 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:19:26,076 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:19:26,077 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:19:26,077 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:19:26,077 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:19:26,077 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:19:26,079 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 05:19:26,845 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:19:26,846 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:19:26,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:19:26 BoogieIcfgContainer [2019-12-27 05:19:26,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:19:26,848 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:19:26,848 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:19:26,851 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:19:26,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:19:25" (1/3) ... [2019-12-27 05:19:26,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1423d76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:19:26, skipping insertion in model container [2019-12-27 05:19:26,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:19:25" (2/3) ... [2019-12-27 05:19:26,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1423d76e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:19:26, skipping insertion in model container [2019-12-27 05:19:26,854 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:19:26" (3/3) ... [2019-12-27 05:19:26,855 INFO L109 eAbstractionObserver]: Analyzing ICFG mix009_pso.oepc.i [2019-12-27 05:19:26,865 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:19:26,865 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:19:26,873 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:19:26,874 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:19:26,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,911 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,912 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,912 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,913 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,913 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,919 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,920 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,923 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,923 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,930 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,931 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,932 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,933 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,934 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,935 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,938 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,942 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,943 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,944 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,945 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,948 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,949 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,950 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,951 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,955 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,956 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,957 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,957 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,957 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,958 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,958 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,961 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,962 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,963 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,964 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,979 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,980 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,980 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,981 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,982 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,983 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,983 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:19:26,998 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 05:19:27,019 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:19:27,019 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:19:27,019 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:19:27,020 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:19:27,020 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:19:27,020 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:19:27,020 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:19:27,020 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:19:27,037 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 150 places, 184 transitions [2019-12-27 05:19:27,039 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-12-27 05:19:27,128 INFO L132 PetriNetUnfolder]: 41/182 cut-off events. [2019-12-27 05:19:27,129 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:19:27,143 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/139 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 05:19:27,163 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 150 places, 184 transitions [2019-12-27 05:19:27,211 INFO L132 PetriNetUnfolder]: 41/182 cut-off events. [2019-12-27 05:19:27,211 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:19:27,217 INFO L76 FinitePrefix]: Finished finitePrefix Result has 189 conditions, 182 events. 41/182 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 340 event pairs. 0/139 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 05:19:27,231 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 05:19:27,233 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:19:30,166 WARN L192 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 05:19:30,270 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 05:19:30,654 WARN L192 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-27 05:19:30,782 WARN L192 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-27 05:19:30,803 INFO L206 etLargeBlockEncoding]: Checked pairs total: 55163 [2019-12-27 05:19:30,803 INFO L214 etLargeBlockEncoding]: Total number of compositions: 104 [2019-12-27 05:19:30,806 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 77 places, 88 transitions [2019-12-27 05:19:31,294 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8640 states. [2019-12-27 05:19:31,295 INFO L276 IsEmpty]: Start isEmpty. Operand 8640 states. [2019-12-27 05:19:31,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:19:31,301 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:19:31,302 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:19:31,302 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:19:31,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:19:31,307 INFO L82 PathProgramCache]: Analyzing trace with hash 797231, now seen corresponding path program 1 times [2019-12-27 05:19:31,316 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:19:31,317 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776253083] [2019-12-27 05:19:31,317 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:19:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:19:31,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:19:31,526 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776253083] [2019-12-27 05:19:31,527 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:19:31,527 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:19:31,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [852667778] [2019-12-27 05:19:31,533 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:19:31,533 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:19:31,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:19:31,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:19:31,552 INFO L87 Difference]: Start difference. First operand 8640 states. Second operand 3 states. [2019-12-27 05:19:31,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:19:31,811 INFO L93 Difference]: Finished difference Result 8466 states and 27782 transitions. [2019-12-27 05:19:31,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:19:31,813 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:19:31,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:19:31,907 INFO L225 Difference]: With dead ends: 8466 [2019-12-27 05:19:31,907 INFO L226 Difference]: Without dead ends: 7974 [2019-12-27 05:19:31,912 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:19:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7974 states. [2019-12-27 05:19:32,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7974 to 7974. [2019-12-27 05:19:32,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7974 states. [2019-12-27 05:19:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7974 states to 7974 states and 26121 transitions. [2019-12-27 05:19:32,443 INFO L78 Accepts]: Start accepts. Automaton has 7974 states and 26121 transitions. Word has length 3 [2019-12-27 05:19:32,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:19:32,443 INFO L462 AbstractCegarLoop]: Abstraction has 7974 states and 26121 transitions. [2019-12-27 05:19:32,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:19:32,444 INFO L276 IsEmpty]: Start isEmpty. Operand 7974 states and 26121 transitions. [2019-12-27 05:19:32,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:19:32,450 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:19:32,450 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:19:32,451 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:19:32,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:19:32,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1900393747, now seen corresponding path program 1 times [2019-12-27 05:19:32,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:19:32,452 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252501658] [2019-12-27 05:19:32,452 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:19:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:19:32,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:19:32,544 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252501658] [2019-12-27 05:19:32,544 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:19:32,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:19:32,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714055010] [2019-12-27 05:19:32,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:19:32,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:19:32,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:19:32,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:19:32,547 INFO L87 Difference]: Start difference. First operand 7974 states and 26121 transitions. Second operand 3 states. [2019-12-27 05:19:32,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:19:32,577 INFO L93 Difference]: Finished difference Result 1283 states and 2944 transitions. [2019-12-27 05:19:32,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:19:32,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 05:19:32,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:19:32,585 INFO L225 Difference]: With dead ends: 1283 [2019-12-27 05:19:32,585 INFO L226 Difference]: Without dead ends: 1283 [2019-12-27 05:19:32,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:19:32,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1283 states. [2019-12-27 05:19:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1283 to 1283. [2019-12-27 05:19:32,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-12-27 05:19:32,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 2944 transitions. [2019-12-27 05:19:32,619 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 2944 transitions. Word has length 11 [2019-12-27 05:19:32,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:19:32,619 INFO L462 AbstractCegarLoop]: Abstraction has 1283 states and 2944 transitions. [2019-12-27 05:19:32,619 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:19:32,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 2944 transitions. [2019-12-27 05:19:32,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 05:19:32,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:19:32,621 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:19:32,621 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:19:32,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:19:32,622 INFO L82 PathProgramCache]: Analyzing trace with hash 1145267858, now seen corresponding path program 1 times [2019-12-27 05:19:32,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:19:32,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019445114] [2019-12-27 05:19:32,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:19:32,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:19:32,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:19:32,782 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019445114] [2019-12-27 05:19:32,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:19:32,783 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:19:32,783 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8659037] [2019-12-27 05:19:32,783 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:19:32,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:19:32,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:19:32,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:19:32,784 INFO L87 Difference]: Start difference. First operand 1283 states and 2944 transitions. Second operand 5 states. [2019-12-27 05:19:33,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:19:33,109 INFO L93 Difference]: Finished difference Result 1902 states and 4249 transitions. [2019-12-27 05:19:33,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:19:33,110 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 05:19:33,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:19:33,121 INFO L225 Difference]: With dead ends: 1902 [2019-12-27 05:19:33,121 INFO L226 Difference]: Without dead ends: 1902 [2019-12-27 05:19:33,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:19:33,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1902 states. [2019-12-27 05:19:33,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1902 to 1604. [2019-12-27 05:19:33,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1604 states. [2019-12-27 05:19:33,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1604 states to 1604 states and 3640 transitions. [2019-12-27 05:19:33,175 INFO L78 Accepts]: Start accepts. Automaton has 1604 states and 3640 transitions. Word has length 14 [2019-12-27 05:19:33,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:19:33,175 INFO L462 AbstractCegarLoop]: Abstraction has 1604 states and 3640 transitions. [2019-12-27 05:19:33,175 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:19:33,176 INFO L276 IsEmpty]: Start isEmpty. Operand 1604 states and 3640 transitions. [2019-12-27 05:19:33,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:19:33,181 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:19:33,181 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:19:33,181 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:19:33,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:19:33,181 INFO L82 PathProgramCache]: Analyzing trace with hash 318167262, now seen corresponding path program 1 times [2019-12-27 05:19:33,182 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:19:33,182 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975769386] [2019-12-27 05:19:33,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:19:33,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:19:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:19:33,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975769386] [2019-12-27 05:19:33,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:19:33,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:19:33,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041020712] [2019-12-27 05:19:33,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:19:33,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:19:33,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:19:33,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:19:33,324 INFO L87 Difference]: Start difference. First operand 1604 states and 3640 transitions. Second operand 6 states. [2019-12-27 05:19:33,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:19:33,780 INFO L93 Difference]: Finished difference Result 2385 states and 5172 transitions. [2019-12-27 05:19:33,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 05:19:33,780 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 05:19:33,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:19:33,792 INFO L225 Difference]: With dead ends: 2385 [2019-12-27 05:19:33,793 INFO L226 Difference]: Without dead ends: 2385 [2019-12-27 05:19:33,796 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 05:19:33,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2385 states. [2019-12-27 05:19:33,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2385 to 1725. [2019-12-27 05:19:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1725 states. [2019-12-27 05:19:33,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1725 states to 1725 states and 3880 transitions. [2019-12-27 05:19:33,844 INFO L78 Accepts]: Start accepts. Automaton has 1725 states and 3880 transitions. Word has length 25 [2019-12-27 05:19:33,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:19:33,845 INFO L462 AbstractCegarLoop]: Abstraction has 1725 states and 3880 transitions. [2019-12-27 05:19:33,845 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:19:33,845 INFO L276 IsEmpty]: Start isEmpty. Operand 1725 states and 3880 transitions. [2019-12-27 05:19:33,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 05:19:33,847 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:19:33,848 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:19:33,848 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:19:33,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:19:33,848 INFO L82 PathProgramCache]: Analyzing trace with hash 105464887, now seen corresponding path program 1 times [2019-12-27 05:19:33,848 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:19:33,849 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883519860] [2019-12-27 05:19:33,849 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:19:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:19:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:19:33,963 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883519860] [2019-12-27 05:19:33,963 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:19:33,963 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:19:33,964 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669652491] [2019-12-27 05:19:33,964 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:19:33,964 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:19:33,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:19:33,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:19:33,965 INFO L87 Difference]: Start difference. First operand 1725 states and 3880 transitions. Second operand 3 states. [2019-12-27 05:19:33,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:19:33,976 INFO L93 Difference]: Finished difference Result 1724 states and 3878 transitions. [2019-12-27 05:19:33,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:19:33,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 05:19:33,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:19:33,985 INFO L225 Difference]: With dead ends: 1724 [2019-12-27 05:19:33,985 INFO L226 Difference]: Without dead ends: 1724 [2019-12-27 05:19:33,985 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:19:33,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1724 states. [2019-12-27 05:19:34,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1724 to 1724. [2019-12-27 05:19:34,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2019-12-27 05:19:34,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 3878 transitions. [2019-12-27 05:19:34,022 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 3878 transitions. Word has length 26 [2019-12-27 05:19:34,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:19:34,023 INFO L462 AbstractCegarLoop]: Abstraction has 1724 states and 3878 transitions. [2019-12-27 05:19:34,023 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:19:34,023 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 3878 transitions. [2019-12-27 05:19:34,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:19:34,026 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:19:34,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] [2019-12-27 05:19:34,026 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:19:34,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:19:34,026 INFO L82 PathProgramCache]: Analyzing trace with hash 1972444125, now seen corresponding path program 1 times [2019-12-27 05:19:34,027 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:19:34,027 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257991099] [2019-12-27 05:19:34,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:19:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:19:34,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:19:34,109 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257991099] [2019-12-27 05:19:34,109 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:19:34,110 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:19:34,110 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851495862] [2019-12-27 05:19:34,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:19:34,110 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:19:34,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:19:34,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:19:34,111 INFO L87 Difference]: Start difference. First operand 1724 states and 3878 transitions. Second operand 5 states. [2019-12-27 05:19:34,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:19:34,741 INFO L93 Difference]: Finished difference Result 2512 states and 5536 transitions. [2019-12-27 05:19:34,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 05:19:34,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-27 05:19:34,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:19:34,754 INFO L225 Difference]: With dead ends: 2512 [2019-12-27 05:19:34,755 INFO L226 Difference]: Without dead ends: 2512 [2019-12-27 05:19:34,755 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:19:34,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2512 states. [2019-12-27 05:19:34,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2512 to 2217. [2019-12-27 05:19:34,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2217 states. [2019-12-27 05:19:34,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2217 states to 2217 states and 4954 transitions. [2019-12-27 05:19:34,805 INFO L78 Accepts]: Start accepts. Automaton has 2217 states and 4954 transitions. Word has length 27 [2019-12-27 05:19:34,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:19:34,805 INFO L462 AbstractCegarLoop]: Abstraction has 2217 states and 4954 transitions. [2019-12-27 05:19:34,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:19:34,806 INFO L276 IsEmpty]: Start isEmpty. Operand 2217 states and 4954 transitions. [2019-12-27 05:19:34,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 05:19:34,809 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:19:34,809 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:19:34,809 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:19:34,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:19:34,810 INFO L82 PathProgramCache]: Analyzing trace with hash 1233611304, now seen corresponding path program 1 times [2019-12-27 05:19:34,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:19:34,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934761742] [2019-12-27 05:19:34,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:19:34,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:19:34,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:19:34,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934761742] [2019-12-27 05:19:34,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:19:34,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:19:34,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139478534] [2019-12-27 05:19:34,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:19:34,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:19:34,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:19:34,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:19:34,863 INFO L87 Difference]: Start difference. First operand 2217 states and 4954 transitions. Second operand 4 states. [2019-12-27 05:19:34,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:19:34,882 INFO L93 Difference]: Finished difference Result 1233 states and 2633 transitions. [2019-12-27 05:19:34,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:19:34,882 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 28 [2019-12-27 05:19:34,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:19:34,887 INFO L225 Difference]: With dead ends: 1233 [2019-12-27 05:19:34,888 INFO L226 Difference]: Without dead ends: 1233 [2019-12-27 05:19:34,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:19:34,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1233 states. [2019-12-27 05:19:34,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1233 to 1144. [2019-12-27 05:19:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1144 states. [2019-12-27 05:19:34,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 2469 transitions. [2019-12-27 05:19:34,918 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 2469 transitions. Word has length 28 [2019-12-27 05:19:34,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:19:34,918 INFO L462 AbstractCegarLoop]: Abstraction has 1144 states and 2469 transitions. [2019-12-27 05:19:34,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:19:34,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 2469 transitions. [2019-12-27 05:19:34,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 05:19:34,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:19:34,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:19:34,924 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:19:34,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:19:34,925 INFO L82 PathProgramCache]: Analyzing trace with hash -103643440, now seen corresponding path program 1 times [2019-12-27 05:19:34,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:19:34,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632893115] [2019-12-27 05:19:34,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:19:34,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:19:34,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:19:34,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632893115] [2019-12-27 05:19:34,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:19:34,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:19:34,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272407293] [2019-12-27 05:19:34,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:19:34,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:19:34,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:19:34,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:19:34,983 INFO L87 Difference]: Start difference. First operand 1144 states and 2469 transitions. Second operand 3 states. [2019-12-27 05:19:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:19:35,031 INFO L93 Difference]: Finished difference Result 1748 states and 3666 transitions. [2019-12-27 05:19:35,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:19:35,032 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 05:19:35,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:19:35,036 INFO L225 Difference]: With dead ends: 1748 [2019-12-27 05:19:35,037 INFO L226 Difference]: Without dead ends: 1748 [2019-12-27 05:19:35,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:19:35,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-12-27 05:19:35,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1269. [2019-12-27 05:19:35,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1269 states. [2019-12-27 05:19:35,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1269 states to 1269 states and 2718 transitions. [2019-12-27 05:19:35,065 INFO L78 Accepts]: Start accepts. Automaton has 1269 states and 2718 transitions. Word has length 51 [2019-12-27 05:19:35,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:19:35,067 INFO L462 AbstractCegarLoop]: Abstraction has 1269 states and 2718 transitions. [2019-12-27 05:19:35,067 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:19:35,067 INFO L276 IsEmpty]: Start isEmpty. Operand 1269 states and 2718 transitions. [2019-12-27 05:19:35,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 05:19:35,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:19:35,070 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:19:35,070 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:19:35,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:19:35,071 INFO L82 PathProgramCache]: Analyzing trace with hash -1679671031, now seen corresponding path program 1 times [2019-12-27 05:19:35,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:19:35,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504146929] [2019-12-27 05:19:35,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:19:35,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:19:35,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:19:35,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504146929] [2019-12-27 05:19:35,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:19:35,144 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:19:35,144 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222989236] [2019-12-27 05:19:35,145 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:19:35,145 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:19:35,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:19:35,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:19:35,145 INFO L87 Difference]: Start difference. First operand 1269 states and 2718 transitions. Second operand 3 states. [2019-12-27 05:19:35,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:19:35,203 INFO L93 Difference]: Finished difference Result 1638 states and 3474 transitions. [2019-12-27 05:19:35,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:19:35,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 05:19:35,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:19:35,208 INFO L225 Difference]: With dead ends: 1638 [2019-12-27 05:19:35,208 INFO L226 Difference]: Without dead ends: 1638 [2019-12-27 05:19:35,208 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:19:35,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2019-12-27 05:19:35,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1309. [2019-12-27 05:19:35,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-12-27 05:19:35,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 2822 transitions. [2019-12-27 05:19:35,236 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 2822 transitions. Word has length 51 [2019-12-27 05:19:35,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:19:35,237 INFO L462 AbstractCegarLoop]: Abstraction has 1309 states and 2822 transitions. [2019-12-27 05:19:35,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:19:35,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 2822 transitions. [2019-12-27 05:19:35,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 05:19:35,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:19:35,240 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:19:35,241 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:19:35,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:19:35,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1121458904, now seen corresponding path program 1 times [2019-12-27 05:19:35,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:19:35,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730928099] [2019-12-27 05:19:35,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:19:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:19:35,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:19:35,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730928099] [2019-12-27 05:19:35,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:19:35,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-12-27 05:19:35,526 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915866487] [2019-12-27 05:19:35,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 05:19:35,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:19:35,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 05:19:35,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:19:35,527 INFO L87 Difference]: Start difference. First operand 1309 states and 2822 transitions. Second operand 11 states. [2019-12-27 05:19:37,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:19:37,015 INFO L93 Difference]: Finished difference Result 2303 states and 4760 transitions. [2019-12-27 05:19:37,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-27 05:19:37,016 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-12-27 05:19:37,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:19:37,022 INFO L225 Difference]: With dead ends: 2303 [2019-12-27 05:19:37,022 INFO L226 Difference]: Without dead ends: 2303 [2019-12-27 05:19:37,023 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=162, Invalid=488, Unknown=0, NotChecked=0, Total=650 [2019-12-27 05:19:37,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2303 states. [2019-12-27 05:19:37,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2303 to 1260. [2019-12-27 05:19:37,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1260 states. [2019-12-27 05:19:37,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1260 states to 1260 states and 2688 transitions. [2019-12-27 05:19:37,055 INFO L78 Accepts]: Start accepts. Automaton has 1260 states and 2688 transitions. Word has length 52 [2019-12-27 05:19:37,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:19:37,056 INFO L462 AbstractCegarLoop]: Abstraction has 1260 states and 2688 transitions. [2019-12-27 05:19:37,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 05:19:37,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1260 states and 2688 transitions. [2019-12-27 05:19:37,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 05:19:37,059 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:19:37,060 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:19:37,060 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:19:37,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:19:37,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1607564162, now seen corresponding path program 2 times [2019-12-27 05:19:37,060 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:19:37,061 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492588916] [2019-12-27 05:19:37,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:19:37,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:19:37,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 05:19:37,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492588916] [2019-12-27 05:19:37,165 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:19:37,165 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:19:37,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668871365] [2019-12-27 05:19:37,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:19:37,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:19:37,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:19:37,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:19:37,167 INFO L87 Difference]: Start difference. First operand 1260 states and 2688 transitions. Second operand 3 states. [2019-12-27 05:19:37,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:19:37,180 INFO L93 Difference]: Finished difference Result 1259 states and 2686 transitions. [2019-12-27 05:19:37,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:19:37,181 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 05:19:37,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:19:37,184 INFO L225 Difference]: With dead ends: 1259 [2019-12-27 05:19:37,184 INFO L226 Difference]: Without dead ends: 1259 [2019-12-27 05:19:37,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:19:37,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1259 states. [2019-12-27 05:19:37,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1259 to 927. [2019-12-27 05:19:37,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 927 states. [2019-12-27 05:19:37,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 927 states to 927 states and 2008 transitions. [2019-12-27 05:19:37,205 INFO L78 Accepts]: Start accepts. Automaton has 927 states and 2008 transitions. Word has length 52 [2019-12-27 05:19:37,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:19:37,206 INFO L462 AbstractCegarLoop]: Abstraction has 927 states and 2008 transitions. [2019-12-27 05:19:37,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:19:37,206 INFO L276 IsEmpty]: Start isEmpty. Operand 927 states and 2008 transitions. [2019-12-27 05:19:37,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 05:19:37,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:19:37,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:19:37,209 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:19:37,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:19:37,209 INFO L82 PathProgramCache]: Analyzing trace with hash 622873229, now seen corresponding path program 1 times [2019-12-27 05:19:37,209 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:19:37,209 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921449044] [2019-12-27 05:19:37,210 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:19:37,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:19:37,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:19:37,329 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:19:37,329 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:19:37,334 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] ULTIMATE.startENTRY-->L809: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= v_~z$r_buff0_thd0~0_22 0) (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= v_~x~0_11 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t245~0.base_26| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t245~0.base_26|) |v_ULTIMATE.start_main_~#t245~0.offset_18| 0)) |v_#memory_int_15|) (= 0 v_~weak$$choice0~0_8) (= 0 v_~z$r_buff1_thd2~0_53) (= 0 v_~__unbuffered_p0_EAX~0_15) (= 0 v_~__unbuffered_p1_EAX~0_11) (= v_~z$w_buff0_used~0_101 0) (= v_~z~0_26 0) (= 0 v_~z$r_buff1_thd0~0_21) (= v_~z$read_delayed~0_8 0) (= 0 v_~z$w_buff1~0_21) (= v_~z$r_buff0_thd1~0_30 0) (= v_~z$read_delayed_var~0.base_8 0) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t245~0.base_26| 4)) (= 0 v_~__unbuffered_cnt~0_14) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t245~0.base_26|) (= 0 v_~z$r_buff1_thd1~0_21) (= 0 v_~z$flush_delayed~0_14) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd2~0_77 0) (= |v_#NULL.offset_4| 0) (= v_~y~0_10 0) (= 0 v_~z$w_buff0~0_25) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t245~0.base_26| 1)) (= v_~__unbuffered_p1_EBX~0_12 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t245~0.base_26|)) (= 0 v_~z$w_buff1_used~0_66) (= v_~z$read_delayed_var~0.offset_8 0) (= 0 |v_ULTIMATE.start_main_~#t245~0.offset_18|) (< 0 |v_#StackHeapBarrier_13|) (= v_~__unbuffered_p0_EBX~0_15 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_53, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_~#t245~0.offset=|v_ULTIMATE.start_main_~#t245~0.offset_18|, ~z$w_buff1~0=v_~z$w_buff1~0_21, #NULL.offset=|v_#NULL.offset_4|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_8, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_15|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_22, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ULTIMATE.start_main_~#t245~0.base=|v_ULTIMATE.start_main_~#t245~0.base_26|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_21, #length=|v_#length_19|, ~y~0=v_~y~0_10, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_77, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_12, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_15, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_101, ~z$w_buff0~0=v_~z$w_buff0~0_25, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_66, ~z$flush_delayed~0=v_~z$flush_delayed~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_4|, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_49|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_21, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_8, ULTIMATE.start_main_~#t246~0.base=|v_ULTIMATE.start_main_~#t246~0.base_23|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_26, ULTIMATE.start_main_~#t246~0.offset=|v_ULTIMATE.start_main_~#t246~0.offset_17|, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_30, ~x~0=v_~x~0_11} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ~z$read_delayed~0, ULTIMATE.start_main_~#t245~0.offset, ~z$w_buff1~0, #NULL.offset, ~main$tmp_guard1~0, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t245~0.base, ~__unbuffered_p1_EAX~0, ~z$r_buff1_thd0~0, #length, ~y~0, ~z$r_buff0_thd2~0, ~z$mem_tmp~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~main$tmp_guard0~0, #NULL.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#res, #valid, ~z$r_buff1_thd1~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ULTIMATE.start_main_~#t246~0.base, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ULTIMATE.start_main_~#t246~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 05:19:37,336 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L4-->L750: Formula: (and (= ~z$r_buff0_thd2~0_In142322929 ~z$r_buff1_thd2~0_Out142322929) (= ~z$r_buff1_thd0~0_Out142322929 ~z$r_buff0_thd0~0_In142322929) (= ~x~0_Out142322929 1) (= ~z$r_buff1_thd1~0_Out142322929 ~z$r_buff0_thd1~0_In142322929) (not (= P0Thread1of1ForFork0___VERIFIER_assert_~expression_In142322929 0)) (= ~__unbuffered_p0_EAX~0_Out142322929 ~x~0_Out142322929) (= 1 ~z$r_buff0_thd1~0_Out142322929) (= ~y~0_In142322929 ~__unbuffered_p0_EBX~0_Out142322929)) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In142322929, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In142322929, ~y~0=~y~0_In142322929, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In142322929, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In142322929} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out142322929, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In142322929, ~__unbuffered_p0_EBX~0=~__unbuffered_p0_EBX~0_Out142322929, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out142322929, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out142322929, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out142322929, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In142322929, ~y~0=~y~0_In142322929, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out142322929, ~x~0=~x~0_Out142322929, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In142322929} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~__unbuffered_p0_EBX~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 05:19:37,337 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L809-1-->L811: Formula: (and (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t246~0.base_12| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t246~0.base_12|) |v_ULTIMATE.start_main_~#t246~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t246~0.base_12|)) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t246~0.base_12| 1)) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t246~0.base_12| 4) |v_#length_11|) (= 0 (select |v_#valid_26| |v_ULTIMATE.start_main_~#t246~0.base_12|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t246~0.base_12|) (= 0 |v_ULTIMATE.start_main_~#t246~0.offset_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_8|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, ULTIMATE.start_main_~#t246~0.base=|v_ULTIMATE.start_main_~#t246~0.base_12|, #length=|v_#length_11|, ULTIMATE.start_main_~#t246~0.offset=|v_ULTIMATE.start_main_~#t246~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t246~0.base, #length, ULTIMATE.start_main_~#t246~0.offset] because there is no mapped edge [2019-12-27 05:19:37,345 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L777-->L777-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In2100738376 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite21_Out2100738376| ~z$w_buff0_used~0_In2100738376) (= |P1Thread1of1ForFork1_#t~ite20_In2100738376| |P1Thread1of1ForFork1_#t~ite20_Out2100738376|)) (and (= |P1Thread1of1ForFork1_#t~ite21_Out2100738376| |P1Thread1of1ForFork1_#t~ite20_Out2100738376|) (= ~z$w_buff0_used~0_In2100738376 |P1Thread1of1ForFork1_#t~ite20_Out2100738376|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In2100738376 256)))) (or (and .cse1 (= (mod ~z$r_buff1_thd2~0_In2100738376 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In2100738376 256)) (and .cse1 (= (mod ~z$w_buff1_used~0_In2100738376 256) 0)))) .cse0))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2100738376, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In2100738376|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2100738376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2100738376, ~weak$$choice2~0=~weak$$choice2~0_In2100738376, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2100738376} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2100738376, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out2100738376|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In2100738376, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2100738376, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out2100738376|, ~weak$$choice2~0=~weak$$choice2~0_In2100738376, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2100738376} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 05:19:37,347 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [684] [684] L779-->L780: Formula: (and (= v_~z$r_buff0_thd2~0_58 v_~z$r_buff0_thd2~0_57) (not (= 0 (mod v_~weak$$choice2~0_20 256)))) InVars {~weak$$choice2~0=v_~weak$$choice2~0_20, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_58} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_20, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_57, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~z$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 05:19:37,348 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L780-->L780-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1723071743 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite30_Out-1723071743| ~z$r_buff1_thd2~0_In-1723071743) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-1723071743| |P1Thread1of1ForFork1_#t~ite29_Out-1723071743|)) (and (= |P1Thread1of1ForFork1_#t~ite30_Out-1723071743| |P1Thread1of1ForFork1_#t~ite29_Out-1723071743|) (let ((.cse1 (= (mod ~z$r_buff0_thd2~0_In-1723071743 256) 0))) (or (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In-1723071743 256))) (and .cse1 (= (mod ~z$r_buff1_thd2~0_In-1723071743 256) 0)) (= (mod ~z$w_buff0_used~0_In-1723071743 256) 0))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1723071743| ~z$r_buff1_thd2~0_In-1723071743) .cse0))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1723071743|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1723071743, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1723071743, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1723071743, ~weak$$choice2~0=~weak$$choice2~0_In-1723071743, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1723071743} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1723071743|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1723071743|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1723071743, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1723071743, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1723071743, ~weak$$choice2~0=~weak$$choice2~0_In-1723071743, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1723071743} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-27 05:19:37,349 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-->L786: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_19 v_~z$mem_tmp~0_4)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_4, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_19} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 05:19:37,350 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L786-2-->L786-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-327872238 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In-327872238 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite33_Out-327872238| |P1Thread1of1ForFork1_#t~ite32_Out-327872238|))) (or (and (not .cse0) (= ~z$w_buff1~0_In-327872238 |P1Thread1of1ForFork1_#t~ite32_Out-327872238|) (not .cse1) .cse2) (and (= ~z~0_In-327872238 |P1Thread1of1ForFork1_#t~ite32_Out-327872238|) (or .cse1 .cse0) .cse2))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-327872238, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-327872238, ~z$w_buff1~0=~z$w_buff1~0_In-327872238, ~z~0=~z~0_In-327872238} OutVars{~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-327872238, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-327872238, ~z$w_buff1~0=~z$w_buff1~0_In-327872238, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-327872238|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-327872238|, ~z~0=~z~0_In-327872238} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 05:19:37,351 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L787-->L787-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-1751328619 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1751328619 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out-1751328619| 0) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1751328619 |P1Thread1of1ForFork1_#t~ite34_Out-1751328619|) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1751328619, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1751328619} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1751328619, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1751328619|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1751328619} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 05:19:37,352 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [730] [730] L788-->L788-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd2~0_In-1176770051 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-1176770051 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1176770051 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1176770051 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1176770051|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-1176770051 |P1Thread1of1ForFork1_#t~ite35_Out-1176770051|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1176770051, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1176770051, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1176770051, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1176770051} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1176770051, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1176770051, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1176770051, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1176770051|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1176770051} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 05:19:37,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [726] [726] L789-->L789-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In2004967973 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In2004967973 256)))) (or (and (= ~z$r_buff0_thd2~0_In2004967973 |P1Thread1of1ForFork1_#t~ite36_Out2004967973|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out2004967973|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In2004967973, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2004967973} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In2004967973, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In2004967973, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out2004967973|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 05:19:37,353 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L751-->L751-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1351819740 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In1351819740 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out1351819740| 0) (not .cse0) (not .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out1351819740| ~z$w_buff0_used~0_In1351819740) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1351819740, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1351819740} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out1351819740|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1351819740, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1351819740} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 05:19:37,354 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L752-->L752-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In923593882 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In923593882 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In923593882 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd1~0_In923593882 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out923593882| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out923593882| ~z$w_buff1_used~0_In923593882) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In923593882, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In923593882, ~z$w_buff1_used~0=~z$w_buff1_used~0_In923593882, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In923593882} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out923593882|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In923593882, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In923593882, ~z$w_buff1_used~0=~z$w_buff1_used~0_In923593882, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In923593882} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 05:19:37,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L790-->L790-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In1341702869 256))) (.cse2 (= (mod ~z$r_buff0_thd2~0_In1341702869 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1341702869 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1341702869 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite37_Out1341702869| ~z$r_buff1_thd2~0_In1341702869) (or .cse2 .cse3)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite37_Out1341702869| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1341702869, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1341702869, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1341702869, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1341702869} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1341702869, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1341702869, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1341702869, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1341702869, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out1341702869|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 05:19:37,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L790-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~z$r_buff1_thd2~0_43 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 05:19:37,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L753-->L754: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1474735723 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1474735723 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out1474735723) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd1~0_In1474735723 ~z$r_buff0_thd1~0_Out1474735723)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1474735723, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1474735723} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1474735723, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out1474735723|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1474735723} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:19:37,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L754-->L754-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-936577475 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-936577475 256))) (.cse3 (= (mod ~z$r_buff1_thd1~0_In-936577475 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-936577475 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-936577475| 0)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$r_buff1_thd1~0_In-936577475 |P0Thread1of1ForFork0_#t~ite8_Out-936577475|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-936577475, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-936577475, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-936577475, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-936577475} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-936577475, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-936577475|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-936577475, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-936577475, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-936577475} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 05:19:37,356 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L754-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~z$r_buff1_thd1~0_15) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:19:37,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L811-1-->L817: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_3|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 05:19:37,357 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L817-2-->L817-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In-736430083 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In-736430083 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite40_Out-736430083| ~z$w_buff1~0_In-736430083) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite40_Out-736430083| ~z~0_In-736430083)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-736430083, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-736430083, ~z$w_buff1~0=~z$w_buff1~0_In-736430083, ~z~0=~z~0_In-736430083} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-736430083|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-736430083, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-736430083, ~z$w_buff1~0=~z$w_buff1~0_In-736430083, ~z~0=~z~0_In-736430083} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 05:19:37,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L817-4-->L818: Formula: (= v_~z~0_18 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~z~0] because there is no mapped edge [2019-12-27 05:19:37,358 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd0~0_In687325166 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In687325166 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out687325166|)) (and (= ~z$w_buff0_used~0_In687325166 |ULTIMATE.start_main_#t~ite42_Out687325166|) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In687325166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In687325166} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In687325166, ~z$w_buff0_used~0=~z$w_buff0_used~0_In687325166, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out687325166|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 05:19:37,359 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L819-->L819-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd0~0_In-873649408 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-873649408 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-873649408 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-873649408 256) 0))) (or (and (= ~z$w_buff1_used~0_In-873649408 |ULTIMATE.start_main_#t~ite43_Out-873649408|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite43_Out-873649408| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-873649408, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-873649408, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-873649408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-873649408} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-873649408, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-873649408, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-873649408, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-873649408, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-873649408|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 05:19:37,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L820-->L820-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-709988257 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-709988257 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-709988257|)) (and (= ~z$r_buff0_thd0~0_In-709988257 |ULTIMATE.start_main_#t~ite44_Out-709988257|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-709988257, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-709988257} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-709988257, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-709988257, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-709988257|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 05:19:37,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L821-->L821-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-648549935 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-648549935 256))) (.cse2 (= (mod ~z$r_buff1_thd0~0_In-648549935 256) 0)) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In-648549935 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In-648549935 |ULTIMATE.start_main_#t~ite45_Out-648549935|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-648549935|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-648549935, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-648549935, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-648549935, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-648549935} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-648549935, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-648549935, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-648549935, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-648549935, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-648549935|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 05:19:37,361 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L821-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_12 256)) (= 0 v_~__unbuffered_p1_EBX~0_8) (= 1 v_~__unbuffered_p1_EAX~0_7) (= v_~__unbuffered_p0_EBX~0_11 0) (= 1 v_~__unbuffered_p0_EAX~0_11) (= v_~main$tmp_guard1~0_12 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_11| v_~z$r_buff1_thd0~0_17)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_11, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_11, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_11, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_12, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:19:37,440 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:19:37 BasicIcfg [2019-12-27 05:19:37,440 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:19:37,442 INFO L168 Benchmark]: Toolchain (without parser) took 12320.54 ms. Allocated memory was 136.8 MB in the beginning and 425.2 MB in the end (delta: 288.4 MB). Free memory was 99.6 MB in the beginning and 83.7 MB in the end (delta: 15.9 MB). Peak memory consumption was 304.3 MB. Max. memory is 7.1 GB. [2019-12-27 05:19:37,444 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 05:19:37,448 INFO L168 Benchmark]: CACSL2BoogieTranslator took 763.53 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.4 MB in the beginning and 154.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-12-27 05:19:37,449 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.00 ms. Allocated memory is still 200.8 MB. Free memory was 154.8 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:19:37,450 INFO L168 Benchmark]: Boogie Preprocessor took 61.07 ms. Allocated memory is still 200.8 MB. Free memory was 152.0 MB in the beginning and 150.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:19:37,450 INFO L168 Benchmark]: RCFGBuilder took 836.48 ms. Allocated memory is still 200.8 MB. Free memory was 150.0 MB in the beginning and 105.1 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. [2019-12-27 05:19:37,451 INFO L168 Benchmark]: TraceAbstraction took 10591.79 ms. Allocated memory was 200.8 MB in the beginning and 425.2 MB in the end (delta: 224.4 MB). Free memory was 104.4 MB in the beginning and 83.7 MB in the end (delta: 20.7 MB). Peak memory consumption was 245.1 MB. Max. memory is 7.1 GB. [2019-12-27 05:19:37,459 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 136.8 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 763.53 ms. Allocated memory was 136.8 MB in the beginning and 200.8 MB in the end (delta: 64.0 MB). Free memory was 99.4 MB in the beginning and 154.8 MB in the end (delta: -55.3 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.00 ms. Allocated memory is still 200.8 MB. Free memory was 154.8 MB in the beginning and 152.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.07 ms. Allocated memory is still 200.8 MB. Free memory was 152.0 MB in the beginning and 150.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 836.48 ms. Allocated memory is still 200.8 MB. Free memory was 150.0 MB in the beginning and 105.1 MB in the end (delta: 44.9 MB). Peak memory consumption was 44.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10591.79 ms. Allocated memory was 200.8 MB in the beginning and 425.2 MB in the end (delta: 224.4 MB). Free memory was 104.4 MB in the beginning and 83.7 MB in the end (delta: 20.7 MB). Peak memory consumption was 245.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.7s, 150 ProgramPointsBefore, 77 ProgramPointsAfterwards, 184 TransitionsBefore, 88 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 26 ChoiceCompositions, 4562 VarBasedMoverChecksPositive, 167 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 55163 CheckedPairsTotal, 104 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L809] FCALL, FORK 0 pthread_create(&t245, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L730] 1 z$w_buff1 = z$w_buff0 [L731] 1 z$w_buff0 = 1 [L732] 1 z$w_buff1_used = z$w_buff0_used [L733] 1 z$w_buff0_used = (_Bool)1 [L750] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L811] FCALL, FORK 0 pthread_create(&t246, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 2 y = 1 [L767] 2 __unbuffered_p1_EAX = y [L770] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L771] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L772] 2 z$flush_delayed = weak$$choice2 [L773] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L775] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L776] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L776] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L777] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L778] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L780] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L787] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L788] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L750] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L751] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L752] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L789] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L817] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=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=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L818] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L819] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L820] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 144 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.3s, OverallIterations: 12, TraceHistogramMax: 1, AutomataDifference: 3.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1263 SDtfs, 1306 SDslu, 2189 SDs, 0 SdLazy, 2053 SolverSat, 105 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 15 SyntacticMatches, 7 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8640occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 11 MinimizatonAttempts, 3525 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 393 NumberOfCodeBlocks, 393 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 329 ConstructedInterpolants, 0 QuantifiedInterpolants, 50146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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...