/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:09:45,502 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:09:45,505 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:09:45,524 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:09:45,525 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:09:45,526 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:09:45,528 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:09:45,538 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:09:45,542 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:09:45,545 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:09:45,547 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:09:45,549 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:09:45,549 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:09:45,551 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:09:45,554 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:09:45,555 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:09:45,557 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:09:45,559 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:09:45,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:09:45,565 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:09:45,570 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:09:45,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:09:45,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:09:45,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:09:45,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:09:45,578 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:09:45,578 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:09:45,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:09:45,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:09:45,583 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:09:45,583 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:09:45,584 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:09:45,584 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:09:45,585 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:09:45,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:09:45,587 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:09:45,587 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:09:45,588 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:09:45,588 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:09:45,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:09:45,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:09:45,591 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:09:45,619 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:09:45,627 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:09:45,628 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:09:45,628 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:09:45,629 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:09:45,629 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:09:45,629 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:09:45,629 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:09:45,629 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:09:45,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:09:45,635 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:09:45,635 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:09:45,635 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:09:45,635 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:09:45,635 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:09:45,636 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:09:45,636 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:09:45,636 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:09:45,636 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:09:45,636 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:09:45,637 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:09:45,637 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:09:45,637 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:09:45,637 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:09:45,637 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:09:45,637 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:09:45,638 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:09:45,638 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:09:45,638 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:09:45,638 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:09:45,930 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:09:45,944 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:09:45,947 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:09:45,949 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:09:45,949 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:09:45,950 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_rmo.oepc.i [2019-12-26 23:09:46,027 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44a437709/1419b138b9f14af6820a77435cf87b6b/FLAG259168ff0 [2019-12-26 23:09:46,577 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:09:46,578 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_rmo.oepc.i [2019-12-26 23:09:46,593 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44a437709/1419b138b9f14af6820a77435cf87b6b/FLAG259168ff0 [2019-12-26 23:09:46,867 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44a437709/1419b138b9f14af6820a77435cf87b6b [2019-12-26 23:09:46,877 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:09:46,879 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:09:46,880 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:09:46,881 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:09:46,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:09:46,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:09:46" (1/1) ... [2019-12-26 23:09:46,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ede1650 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:46, skipping insertion in model container [2019-12-26 23:09:46,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:09:46" (1/1) ... [2019-12-26 23:09:46,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:09:46,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:09:47,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:09:47,564 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:09:47,662 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:09:47,744 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:09:47,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:47 WrapperNode [2019-12-26 23:09:47,745 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:09:47,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:09:47,746 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:09:47,746 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:09:47,756 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:47" (1/1) ... [2019-12-26 23:09:47,783 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:47" (1/1) ... [2019-12-26 23:09:47,819 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:09:47,820 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:09:47,820 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:09:47,820 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:09:47,831 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:47" (1/1) ... [2019-12-26 23:09:47,831 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:47" (1/1) ... [2019-12-26 23:09:47,837 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:47" (1/1) ... [2019-12-26 23:09:47,837 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:47" (1/1) ... [2019-12-26 23:09:47,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:47" (1/1) ... [2019-12-26 23:09:47,856 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:47" (1/1) ... [2019-12-26 23:09:47,861 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:47" (1/1) ... [2019-12-26 23:09:47,867 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:09:47,868 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:09:47,868 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:09:47,868 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:09:47,869 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:47" (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-26 23:09:47,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:09:47,950 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:09:47,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:09:47,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:09:47,951 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:09:47,952 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:09:47,952 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:09:47,952 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:09:47,952 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:09:47,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:09:47,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:09:47,955 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:09:49,124 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:09:49,125 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:09:49,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:09:49 BoogieIcfgContainer [2019-12-26 23:09:49,127 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:09:49,128 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:09:49,128 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:09:49,131 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:09:49,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:09:46" (1/3) ... [2019-12-26 23:09:49,132 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5752d59f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:09:49, skipping insertion in model container [2019-12-26 23:09:49,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:09:47" (2/3) ... [2019-12-26 23:09:49,133 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5752d59f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:09:49, skipping insertion in model container [2019-12-26 23:09:49,133 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:09:49" (3/3) ... [2019-12-26 23:09:49,135 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_rmo.oepc.i [2019-12-26 23:09:49,146 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:09:49,146 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:09:49,154 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:09:49,155 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:09:49,203 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,204 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,204 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,204 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,204 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,205 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,205 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,205 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,206 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,207 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,208 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,209 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,210 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,211 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,212 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,218 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,219 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,220 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,220 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,221 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,221 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,222 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,223 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,225 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,227 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,228 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,229 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,230 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,231 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,232 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,233 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,234 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,235 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,236 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,237 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,238 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,239 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,240 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,241 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,242 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,243 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,244 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,245 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,246 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,247 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,248 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,249 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,250 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,251 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,252 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,253 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,254 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,255 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,256 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,257 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,258 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,259 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,260 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,261 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,262 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,263 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,264 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,265 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,266 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,267 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,270 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,271 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,272 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,272 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,272 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,273 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,275 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,276 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,277 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,278 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,279 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,280 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,281 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,282 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,283 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,283 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,284 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,285 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,285 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,286 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:09:49,301 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-26 23:09:49,321 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:09:49,322 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:09:49,322 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:09:49,322 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:09:49,322 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:09:49,322 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:09:49,322 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:09:49,322 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:09:49,339 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 231 places, 307 transitions [2019-12-26 23:09:49,341 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-26 23:09:49,504 INFO L132 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-26 23:09:49,504 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:09:49,554 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 726 event pairs. 0/220 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-26 23:09:49,648 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 231 places, 307 transitions [2019-12-26 23:09:49,786 INFO L132 PetriNetUnfolder]: 83/305 cut-off events. [2019-12-26 23:09:49,786 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:09:49,808 INFO L76 FinitePrefix]: Finished finitePrefix Result has 312 conditions, 305 events. 83/305 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 726 event pairs. 0/220 useless extension candidates. Maximal degree in co-relation 276. Up to 2 conditions per place. [2019-12-26 23:09:49,863 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 41414 [2019-12-26 23:09:49,864 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:09:56,451 WARN L192 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-26 23:09:56,584 WARN L192 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-26 23:09:56,655 INFO L206 etLargeBlockEncoding]: Checked pairs total: 238871 [2019-12-26 23:09:56,655 INFO L214 etLargeBlockEncoding]: Total number of compositions: 134 [2019-12-26 23:09:56,658 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 150 places, 186 transitions [2019-12-26 23:10:01,035 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 55330 states. [2019-12-26 23:10:01,037 INFO L276 IsEmpty]: Start isEmpty. Operand 55330 states. [2019-12-26 23:10:01,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:10:01,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:01,043 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:10:01,043 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:01,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:01,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1316112, now seen corresponding path program 1 times [2019-12-26 23:10:01,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:01,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18788076] [2019-12-26 23:10:01,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:01,303 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-26 23:10:01,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18788076] [2019-12-26 23:10:01,305 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:01,305 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:10:01,306 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88703408] [2019-12-26 23:10:01,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:01,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:01,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:01,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:01,332 INFO L87 Difference]: Start difference. First operand 55330 states. Second operand 3 states. [2019-12-26 23:10:02,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:02,103 INFO L93 Difference]: Finished difference Result 55134 states and 195732 transitions. [2019-12-26 23:10:02,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:02,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:10:02,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:02,565 INFO L225 Difference]: With dead ends: 55134 [2019-12-26 23:10:02,565 INFO L226 Difference]: Without dead ends: 54186 [2019-12-26 23:10:02,566 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-26 23:10:04,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54186 states. [2019-12-26 23:10:06,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54186 to 54186. [2019-12-26 23:10:06,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54186 states. [2019-12-26 23:10:06,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54186 states to 54186 states and 192533 transitions. [2019-12-26 23:10:06,730 INFO L78 Accepts]: Start accepts. Automaton has 54186 states and 192533 transitions. Word has length 3 [2019-12-26 23:10:06,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:06,731 INFO L462 AbstractCegarLoop]: Abstraction has 54186 states and 192533 transitions. [2019-12-26 23:10:06,731 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:06,731 INFO L276 IsEmpty]: Start isEmpty. Operand 54186 states and 192533 transitions. [2019-12-26 23:10:06,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:10:06,734 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:06,735 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:06,735 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:06,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:06,736 INFO L82 PathProgramCache]: Analyzing trace with hash 1209114037, now seen corresponding path program 1 times [2019-12-26 23:10:06,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:06,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789126673] [2019-12-26 23:10:06,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:06,910 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-26 23:10:06,910 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789126673] [2019-12-26 23:10:06,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:06,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:10:06,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872605260] [2019-12-26 23:10:06,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:10:06,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:06,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:10:06,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:10:06,914 INFO L87 Difference]: Start difference. First operand 54186 states and 192533 transitions. Second operand 4 states. [2019-12-26 23:10:07,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:07,056 INFO L93 Difference]: Finished difference Result 6606 states and 17259 transitions. [2019-12-26 23:10:07,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:10:07,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:10:07,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:07,104 INFO L225 Difference]: With dead ends: 6606 [2019-12-26 23:10:07,104 INFO L226 Difference]: Without dead ends: 5658 [2019-12-26 23:10:07,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:10:07,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5658 states. [2019-12-26 23:10:08,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5658 to 5658. [2019-12-26 23:10:08,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5658 states. [2019-12-26 23:10:08,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5658 states to 5658 states and 14157 transitions. [2019-12-26 23:10:08,888 INFO L78 Accepts]: Start accepts. Automaton has 5658 states and 14157 transitions. Word has length 11 [2019-12-26 23:10:08,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:08,888 INFO L462 AbstractCegarLoop]: Abstraction has 5658 states and 14157 transitions. [2019-12-26 23:10:08,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:10:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 5658 states and 14157 transitions. [2019-12-26 23:10:08,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:10:08,896 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:08,896 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:08,896 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:08,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:08,897 INFO L82 PathProgramCache]: Analyzing trace with hash 196484102, now seen corresponding path program 1 times [2019-12-26 23:10:08,897 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:08,897 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764894953] [2019-12-26 23:10:08,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:08,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:09,003 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-26 23:10:09,004 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764894953] [2019-12-26 23:10:09,004 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:09,004 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:10:09,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530990384] [2019-12-26 23:10:09,005 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:10:09,005 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:09,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:10:09,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:10:09,006 INFO L87 Difference]: Start difference. First operand 5658 states and 14157 transitions. Second operand 4 states. [2019-12-26 23:10:09,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:09,470 INFO L93 Difference]: Finished difference Result 7256 states and 17796 transitions. [2019-12-26 23:10:09,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:10:09,471 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-26 23:10:09,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:09,499 INFO L225 Difference]: With dead ends: 7256 [2019-12-26 23:10:09,499 INFO L226 Difference]: Without dead ends: 7256 [2019-12-26 23:10:09,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:10:09,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7256 states. [2019-12-26 23:10:09,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7256 to 7222. [2019-12-26 23:10:09,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7222 states. [2019-12-26 23:10:09,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7222 states to 7222 states and 17730 transitions. [2019-12-26 23:10:09,753 INFO L78 Accepts]: Start accepts. Automaton has 7222 states and 17730 transitions. Word has length 14 [2019-12-26 23:10:09,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:09,755 INFO L462 AbstractCegarLoop]: Abstraction has 7222 states and 17730 transitions. [2019-12-26 23:10:09,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:10:09,755 INFO L276 IsEmpty]: Start isEmpty. Operand 7222 states and 17730 transitions. [2019-12-26 23:10:09,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-26 23:10:09,760 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:09,760 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] [2019-12-26 23:10:09,760 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:09,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:09,761 INFO L82 PathProgramCache]: Analyzing trace with hash -1725930936, now seen corresponding path program 1 times [2019-12-26 23:10:09,761 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:09,762 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236247712] [2019-12-26 23:10:09,762 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:09,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:09,948 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-26 23:10:09,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236247712] [2019-12-26 23:10:09,949 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:09,950 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:10:09,950 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910887084] [2019-12-26 23:10:09,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:10:09,950 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:09,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:10:09,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:10:09,951 INFO L87 Difference]: Start difference. First operand 7222 states and 17730 transitions. Second operand 5 states. [2019-12-26 23:10:10,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:10,661 INFO L93 Difference]: Finished difference Result 8308 states and 20180 transitions. [2019-12-26 23:10:10,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:10:10,662 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-26 23:10:10,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:10,684 INFO L225 Difference]: With dead ends: 8308 [2019-12-26 23:10:10,684 INFO L226 Difference]: Without dead ends: 8308 [2019-12-26 23:10:10,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:10:10,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8308 states. [2019-12-26 23:10:10,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8308 to 8206. [2019-12-26 23:10:10,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8206 states. [2019-12-26 23:10:10,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8206 states to 8206 states and 19982 transitions. [2019-12-26 23:10:10,899 INFO L78 Accepts]: Start accepts. Automaton has 8206 states and 19982 transitions. Word has length 30 [2019-12-26 23:10:10,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:10,899 INFO L462 AbstractCegarLoop]: Abstraction has 8206 states and 19982 transitions. [2019-12-26 23:10:10,900 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:10:10,900 INFO L276 IsEmpty]: Start isEmpty. Operand 8206 states and 19982 transitions. [2019-12-26 23:10:10,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-26 23:10:10,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:10,904 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] [2019-12-26 23:10:10,904 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:10,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:10,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1964223061, now seen corresponding path program 1 times [2019-12-26 23:10:10,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:10,905 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059727486] [2019-12-26 23:10:10,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:10,945 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-26 23:10:10,945 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059727486] [2019-12-26 23:10:10,945 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:10,946 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:10:10,946 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328988967] [2019-12-26 23:10:10,946 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:10,947 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:10,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:10,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:10,949 INFO L87 Difference]: Start difference. First operand 8206 states and 19982 transitions. Second operand 3 states. [2019-12-26 23:10:11,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:11,091 INFO L93 Difference]: Finished difference Result 12335 states and 28548 transitions. [2019-12-26 23:10:11,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:11,092 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-26 23:10:11,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:11,122 INFO L225 Difference]: With dead ends: 12335 [2019-12-26 23:10:11,122 INFO L226 Difference]: Without dead ends: 12335 [2019-12-26 23:10:11,123 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-26 23:10:11,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12335 states. [2019-12-26 23:10:11,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12335 to 11324. [2019-12-26 23:10:11,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11324 states. [2019-12-26 23:10:11,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11324 states to 11324 states and 26462 transitions. [2019-12-26 23:10:11,485 INFO L78 Accepts]: Start accepts. Automaton has 11324 states and 26462 transitions. Word has length 31 [2019-12-26 23:10:11,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:11,486 INFO L462 AbstractCegarLoop]: Abstraction has 11324 states and 26462 transitions. [2019-12-26 23:10:11,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:11,486 INFO L276 IsEmpty]: Start isEmpty. Operand 11324 states and 26462 transitions. [2019-12-26 23:10:11,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 23:10:11,492 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:11,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:11,492 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:11,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:11,493 INFO L82 PathProgramCache]: Analyzing trace with hash -71378589, now seen corresponding path program 1 times [2019-12-26 23:10:11,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:11,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963430080] [2019-12-26 23:10:11,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:11,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:11,620 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-26 23:10:11,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963430080] [2019-12-26 23:10:11,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:11,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:10:11,622 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324254998] [2019-12-26 23:10:11,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:10:11,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:11,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:10:11,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:10:11,623 INFO L87 Difference]: Start difference. First operand 11324 states and 26462 transitions. Second operand 5 states. [2019-12-26 23:10:12,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:12,134 INFO L93 Difference]: Finished difference Result 12877 states and 29790 transitions. [2019-12-26 23:10:12,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:10:12,135 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2019-12-26 23:10:12,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:12,168 INFO L225 Difference]: With dead ends: 12877 [2019-12-26 23:10:12,168 INFO L226 Difference]: Without dead ends: 12877 [2019-12-26 23:10:12,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:10:12,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12877 states. [2019-12-26 23:10:12,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12877 to 11566. [2019-12-26 23:10:12,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11566 states. [2019-12-26 23:10:12,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11566 states to 11566 states and 27002 transitions. [2019-12-26 23:10:12,380 INFO L78 Accepts]: Start accepts. Automaton has 11566 states and 27002 transitions. Word has length 33 [2019-12-26 23:10:12,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:12,381 INFO L462 AbstractCegarLoop]: Abstraction has 11566 states and 27002 transitions. [2019-12-26 23:10:12,381 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:10:12,381 INFO L276 IsEmpty]: Start isEmpty. Operand 11566 states and 27002 transitions. [2019-12-26 23:10:12,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 23:10:12,395 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:12,395 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:12,396 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:12,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:12,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1192698792, now seen corresponding path program 1 times [2019-12-26 23:10:12,396 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:12,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549184777] [2019-12-26 23:10:12,397 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:12,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:12,480 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-26 23:10:12,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549184777] [2019-12-26 23:10:12,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:12,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:10:12,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802554308] [2019-12-26 23:10:12,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:10:12,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:12,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:10:12,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:10:12,483 INFO L87 Difference]: Start difference. First operand 11566 states and 27002 transitions. Second operand 5 states. [2019-12-26 23:10:13,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:13,482 INFO L93 Difference]: Finished difference Result 13636 states and 31396 transitions. [2019-12-26 23:10:13,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:10:13,482 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-26 23:10:13,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:13,510 INFO L225 Difference]: With dead ends: 13636 [2019-12-26 23:10:13,510 INFO L226 Difference]: Without dead ends: 13636 [2019-12-26 23:10:13,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:10:13,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13636 states. [2019-12-26 23:10:13,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13636 to 12977. [2019-12-26 23:10:13,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12977 states. [2019-12-26 23:10:13,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12977 states to 12977 states and 30047 transitions. [2019-12-26 23:10:13,735 INFO L78 Accepts]: Start accepts. Automaton has 12977 states and 30047 transitions. Word has length 42 [2019-12-26 23:10:13,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:13,735 INFO L462 AbstractCegarLoop]: Abstraction has 12977 states and 30047 transitions. [2019-12-26 23:10:13,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:10:13,736 INFO L276 IsEmpty]: Start isEmpty. Operand 12977 states and 30047 transitions. [2019-12-26 23:10:13,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-26 23:10:13,749 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:13,749 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] [2019-12-26 23:10:13,749 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:13,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:13,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1557518893, now seen corresponding path program 1 times [2019-12-26 23:10:13,750 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:13,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338803887] [2019-12-26 23:10:13,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:13,889 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-26 23:10:13,890 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338803887] [2019-12-26 23:10:13,890 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:13,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:10:13,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518455183] [2019-12-26 23:10:13,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:10:13,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:13,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:10:13,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:10:13,893 INFO L87 Difference]: Start difference. First operand 12977 states and 30047 transitions. Second operand 6 states. [2019-12-26 23:10:14,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:14,733 INFO L93 Difference]: Finished difference Result 15092 states and 34415 transitions. [2019-12-26 23:10:14,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:10:14,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 43 [2019-12-26 23:10:14,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:14,751 INFO L225 Difference]: With dead ends: 15092 [2019-12-26 23:10:14,751 INFO L226 Difference]: Without dead ends: 15067 [2019-12-26 23:10:14,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:10:14,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15067 states. [2019-12-26 23:10:14,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15067 to 14148. [2019-12-26 23:10:14,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14148 states. [2019-12-26 23:10:15,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14148 states to 14148 states and 32608 transitions. [2019-12-26 23:10:15,033 INFO L78 Accepts]: Start accepts. Automaton has 14148 states and 32608 transitions. Word has length 43 [2019-12-26 23:10:15,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:15,034 INFO L462 AbstractCegarLoop]: Abstraction has 14148 states and 32608 transitions. [2019-12-26 23:10:15,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:10:15,034 INFO L276 IsEmpty]: Start isEmpty. Operand 14148 states and 32608 transitions. [2019-12-26 23:10:15,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-12-26 23:10:15,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:15,052 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] [2019-12-26 23:10:15,052 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:15,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:15,053 INFO L82 PathProgramCache]: Analyzing trace with hash -112938140, now seen corresponding path program 1 times [2019-12-26 23:10:15,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:15,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163253525] [2019-12-26 23:10:15,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:15,343 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-26 23:10:15,344 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163253525] [2019-12-26 23:10:15,344 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:15,344 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:10:15,345 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873487287] [2019-12-26 23:10:15,345 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:10:15,345 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:15,346 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:10:15,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:10:15,346 INFO L87 Difference]: Start difference. First operand 14148 states and 32608 transitions. Second operand 11 states. [2019-12-26 23:10:16,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:16,775 INFO L93 Difference]: Finished difference Result 20464 states and 47586 transitions. [2019-12-26 23:10:16,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 23:10:16,776 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 43 [2019-12-26 23:10:16,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:16,797 INFO L225 Difference]: With dead ends: 20464 [2019-12-26 23:10:16,797 INFO L226 Difference]: Without dead ends: 19816 [2019-12-26 23:10:16,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=186, Unknown=0, NotChecked=0, Total=272 [2019-12-26 23:10:16,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19816 states. [2019-12-26 23:10:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19816 to 14533. [2019-12-26 23:10:17,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14533 states. [2019-12-26 23:10:17,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14533 states to 14533 states and 33403 transitions. [2019-12-26 23:10:17,212 INFO L78 Accepts]: Start accepts. Automaton has 14533 states and 33403 transitions. Word has length 43 [2019-12-26 23:10:17,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:17,212 INFO L462 AbstractCegarLoop]: Abstraction has 14533 states and 33403 transitions. [2019-12-26 23:10:17,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:10:17,212 INFO L276 IsEmpty]: Start isEmpty. Operand 14533 states and 33403 transitions. [2019-12-26 23:10:17,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-26 23:10:17,232 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:17,232 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] [2019-12-26 23:10:17,232 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:17,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:17,233 INFO L82 PathProgramCache]: Analyzing trace with hash -1777006862, now seen corresponding path program 1 times [2019-12-26 23:10:17,233 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:17,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848873502] [2019-12-26 23:10:17,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:17,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:17,280 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-26 23:10:17,281 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848873502] [2019-12-26 23:10:17,281 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:17,281 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:10:17,282 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184310622] [2019-12-26 23:10:17,282 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:17,282 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:17,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:17,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:17,283 INFO L87 Difference]: Start difference. First operand 14533 states and 33403 transitions. Second operand 3 states. [2019-12-26 23:10:17,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:17,415 INFO L93 Difference]: Finished difference Result 16107 states and 34760 transitions. [2019-12-26 23:10:17,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:17,415 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-12-26 23:10:17,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:17,435 INFO L225 Difference]: With dead ends: 16107 [2019-12-26 23:10:17,435 INFO L226 Difference]: Without dead ends: 16107 [2019-12-26 23:10:17,436 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-26 23:10:17,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16107 states. [2019-12-26 23:10:17,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16107 to 15018. [2019-12-26 23:10:17,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15018 states. [2019-12-26 23:10:17,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15018 states to 15018 states and 32551 transitions. [2019-12-26 23:10:17,649 INFO L78 Accepts]: Start accepts. Automaton has 15018 states and 32551 transitions. Word has length 46 [2019-12-26 23:10:17,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:17,650 INFO L462 AbstractCegarLoop]: Abstraction has 15018 states and 32551 transitions. [2019-12-26 23:10:17,650 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:17,650 INFO L276 IsEmpty]: Start isEmpty. Operand 15018 states and 32551 transitions. [2019-12-26 23:10:17,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-26 23:10:17,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:17,664 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] [2019-12-26 23:10:17,664 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:17,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:17,664 INFO L82 PathProgramCache]: Analyzing trace with hash -753849587, now seen corresponding path program 1 times [2019-12-26 23:10:17,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:17,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785541743] [2019-12-26 23:10:17,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:17,825 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-26 23:10:17,825 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785541743] [2019-12-26 23:10:17,826 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:17,826 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:10:17,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902616844] [2019-12-26 23:10:17,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:10:17,827 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:17,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:10:17,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:10:17,828 INFO L87 Difference]: Start difference. First operand 15018 states and 32551 transitions. Second operand 6 states. [2019-12-26 23:10:18,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:18,570 INFO L93 Difference]: Finished difference Result 16268 states and 34955 transitions. [2019-12-26 23:10:18,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:10:18,570 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 49 [2019-12-26 23:10:18,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:18,587 INFO L225 Difference]: With dead ends: 16268 [2019-12-26 23:10:18,588 INFO L226 Difference]: Without dead ends: 16200 [2019-12-26 23:10:18,588 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:10:18,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16200 states. [2019-12-26 23:10:18,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16200 to 14438. [2019-12-26 23:10:18,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14438 states. [2019-12-26 23:10:18,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14438 states to 14438 states and 31356 transitions. [2019-12-26 23:10:18,750 INFO L78 Accepts]: Start accepts. Automaton has 14438 states and 31356 transitions. Word has length 49 [2019-12-26 23:10:18,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:18,750 INFO L462 AbstractCegarLoop]: Abstraction has 14438 states and 31356 transitions. [2019-12-26 23:10:18,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:10:18,751 INFO L276 IsEmpty]: Start isEmpty. Operand 14438 states and 31356 transitions. [2019-12-26 23:10:18,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-26 23:10:18,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:18,765 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:18,765 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:18,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:18,765 INFO L82 PathProgramCache]: Analyzing trace with hash 1658446064, now seen corresponding path program 1 times [2019-12-26 23:10:18,765 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:18,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880740147] [2019-12-26 23:10:18,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:18,855 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-26 23:10:18,855 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880740147] [2019-12-26 23:10:18,855 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:18,856 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:10:18,856 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925071176] [2019-12-26 23:10:18,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:10:18,856 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:18,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:10:18,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:10:18,857 INFO L87 Difference]: Start difference. First operand 14438 states and 31356 transitions. Second operand 5 states. [2019-12-26 23:10:18,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:18,906 INFO L93 Difference]: Finished difference Result 3529 states and 7084 transitions. [2019-12-26 23:10:18,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:10:18,907 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 55 [2019-12-26 23:10:18,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:18,910 INFO L225 Difference]: With dead ends: 3529 [2019-12-26 23:10:18,911 INFO L226 Difference]: Without dead ends: 3235 [2019-12-26 23:10:18,911 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-26 23:10:18,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3235 states. [2019-12-26 23:10:18,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3235 to 2944. [2019-12-26 23:10:18,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2944 states. [2019-12-26 23:10:18,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2944 states to 2944 states and 5940 transitions. [2019-12-26 23:10:18,951 INFO L78 Accepts]: Start accepts. Automaton has 2944 states and 5940 transitions. Word has length 55 [2019-12-26 23:10:18,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:18,951 INFO L462 AbstractCegarLoop]: Abstraction has 2944 states and 5940 transitions. [2019-12-26 23:10:18,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:10:18,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2944 states and 5940 transitions. [2019-12-26 23:10:18,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-12-26 23:10:18,957 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:18,957 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:18,957 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:18,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:18,958 INFO L82 PathProgramCache]: Analyzing trace with hash -253914571, now seen corresponding path program 1 times [2019-12-26 23:10:18,958 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:18,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056070482] [2019-12-26 23:10:18,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:19,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:19,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056070482] [2019-12-26 23:10:19,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:19,067 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:10:19,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331415953] [2019-12-26 23:10:19,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:10:19,068 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:19,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:10:19,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:10:19,068 INFO L87 Difference]: Start difference. First operand 2944 states and 5940 transitions. Second operand 5 states. [2019-12-26 23:10:19,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:19,253 INFO L93 Difference]: Finished difference Result 4540 states and 9180 transitions. [2019-12-26 23:10:19,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:10:19,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 85 [2019-12-26 23:10:19,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:19,259 INFO L225 Difference]: With dead ends: 4540 [2019-12-26 23:10:19,259 INFO L226 Difference]: Without dead ends: 4540 [2019-12-26 23:10:19,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:10:19,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4540 states. [2019-12-26 23:10:19,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4540 to 3885. [2019-12-26 23:10:19,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3885 states. [2019-12-26 23:10:19,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3885 states to 3885 states and 7936 transitions. [2019-12-26 23:10:19,325 INFO L78 Accepts]: Start accepts. Automaton has 3885 states and 7936 transitions. Word has length 85 [2019-12-26 23:10:19,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:19,325 INFO L462 AbstractCegarLoop]: Abstraction has 3885 states and 7936 transitions. [2019-12-26 23:10:19,325 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:10:19,325 INFO L276 IsEmpty]: Start isEmpty. Operand 3885 states and 7936 transitions. [2019-12-26 23:10:19,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-12-26 23:10:19,332 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:19,332 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:19,332 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:19,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:19,333 INFO L82 PathProgramCache]: Analyzing trace with hash -963574665, now seen corresponding path program 1 times [2019-12-26 23:10:19,333 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:19,333 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905347728] [2019-12-26 23:10:19,333 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:19,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:19,418 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-26 23:10:19,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905347728] [2019-12-26 23:10:19,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:19,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:10:19,419 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91410661] [2019-12-26 23:10:19,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:10:19,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:19,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:10:19,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:10:19,420 INFO L87 Difference]: Start difference. First operand 3885 states and 7936 transitions. Second operand 3 states. [2019-12-26 23:10:19,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:19,474 INFO L93 Difference]: Finished difference Result 3884 states and 7934 transitions. [2019-12-26 23:10:19,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:10:19,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2019-12-26 23:10:19,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:19,478 INFO L225 Difference]: With dead ends: 3884 [2019-12-26 23:10:19,479 INFO L226 Difference]: Without dead ends: 3884 [2019-12-26 23:10:19,480 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-26 23:10:19,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3884 states. [2019-12-26 23:10:19,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3884 to 3513. [2019-12-26 23:10:19,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3513 states. [2019-12-26 23:10:19,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3513 states to 3513 states and 7234 transitions. [2019-12-26 23:10:19,526 INFO L78 Accepts]: Start accepts. Automaton has 3513 states and 7234 transitions. Word has length 86 [2019-12-26 23:10:19,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:19,527 INFO L462 AbstractCegarLoop]: Abstraction has 3513 states and 7234 transitions. [2019-12-26 23:10:19,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:10:19,527 INFO L276 IsEmpty]: Start isEmpty. Operand 3513 states and 7234 transitions. [2019-12-26 23:10:19,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-26 23:10:19,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:19,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:19,537 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:19,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:19,537 INFO L82 PathProgramCache]: Analyzing trace with hash 1762061429, now seen corresponding path program 1 times [2019-12-26 23:10:19,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:19,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930677489] [2019-12-26 23:10:19,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:19,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:19,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:10:19,767 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930677489] [2019-12-26 23:10:19,767 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:19,768 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:10:19,768 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101528980] [2019-12-26 23:10:19,768 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:10:19,768 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:19,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:10:19,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:10:19,769 INFO L87 Difference]: Start difference. First operand 3513 states and 7234 transitions. Second operand 9 states. [2019-12-26 23:10:20,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:20,856 INFO L93 Difference]: Finished difference Result 12061 states and 24710 transitions. [2019-12-26 23:10:20,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 23:10:20,857 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-12-26 23:10:20,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:20,867 INFO L225 Difference]: With dead ends: 12061 [2019-12-26 23:10:20,867 INFO L226 Difference]: Without dead ends: 9385 [2019-12-26 23:10:20,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2019-12-26 23:10:20,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9385 states. [2019-12-26 23:10:20,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9385 to 3601. [2019-12-26 23:10:20,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3601 states. [2019-12-26 23:10:20,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3601 states to 3601 states and 7380 transitions. [2019-12-26 23:10:20,928 INFO L78 Accepts]: Start accepts. Automaton has 3601 states and 7380 transitions. Word has length 87 [2019-12-26 23:10:20,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:20,928 INFO L462 AbstractCegarLoop]: Abstraction has 3601 states and 7380 transitions. [2019-12-26 23:10:20,928 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:10:20,928 INFO L276 IsEmpty]: Start isEmpty. Operand 3601 states and 7380 transitions. [2019-12-26 23:10:20,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-26 23:10:20,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:20,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-26 23:10:20,933 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:20,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:20,933 INFO L82 PathProgramCache]: Analyzing trace with hash -339855243, now seen corresponding path program 2 times [2019-12-26 23:10:20,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:20,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795944815] [2019-12-26 23:10:20,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:20,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:21,095 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-26 23:10:21,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795944815] [2019-12-26 23:10:21,097 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:21,097 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:10:21,098 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993774911] [2019-12-26 23:10:21,098 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:10:21,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:21,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:10:21,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:10:21,099 INFO L87 Difference]: Start difference. First operand 3601 states and 7380 transitions. Second operand 9 states. [2019-12-26 23:10:22,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:22,117 INFO L93 Difference]: Finished difference Result 9726 states and 19906 transitions. [2019-12-26 23:10:22,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 23:10:22,117 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 87 [2019-12-26 23:10:22,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:22,126 INFO L225 Difference]: With dead ends: 9726 [2019-12-26 23:10:22,126 INFO L226 Difference]: Without dead ends: 7660 [2019-12-26 23:10:22,126 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:10:22,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7660 states. [2019-12-26 23:10:22,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7660 to 3937. [2019-12-26 23:10:22,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3937 states. [2019-12-26 23:10:22,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3937 states to 3937 states and 8038 transitions. [2019-12-26 23:10:22,182 INFO L78 Accepts]: Start accepts. Automaton has 3937 states and 8038 transitions. Word has length 87 [2019-12-26 23:10:22,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:22,182 INFO L462 AbstractCegarLoop]: Abstraction has 3937 states and 8038 transitions. [2019-12-26 23:10:22,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:10:22,182 INFO L276 IsEmpty]: Start isEmpty. Operand 3937 states and 8038 transitions. [2019-12-26 23:10:22,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-26 23:10:22,187 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:22,187 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:22,187 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:22,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:22,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1343981707, now seen corresponding path program 3 times [2019-12-26 23:10:22,188 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:22,188 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715065549] [2019-12-26 23:10:22,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:22,311 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-26 23:10:22,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715065549] [2019-12-26 23:10:22,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:22,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:10:22,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317136071] [2019-12-26 23:10:22,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:10:22,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:22,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:10:22,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:10:22,314 INFO L87 Difference]: Start difference. First operand 3937 states and 8038 transitions. Second operand 5 states. [2019-12-26 23:10:22,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:22,442 INFO L93 Difference]: Finished difference Result 6640 states and 13532 transitions. [2019-12-26 23:10:22,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:10:22,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 87 [2019-12-26 23:10:22,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:22,446 INFO L225 Difference]: With dead ends: 6640 [2019-12-26 23:10:22,446 INFO L226 Difference]: Without dead ends: 2780 [2019-12-26 23:10:22,447 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:10:22,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2780 states. [2019-12-26 23:10:22,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2780 to 2622. [2019-12-26 23:10:22,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2622 states. [2019-12-26 23:10:22,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2622 states to 2622 states and 5336 transitions. [2019-12-26 23:10:22,486 INFO L78 Accepts]: Start accepts. Automaton has 2622 states and 5336 transitions. Word has length 87 [2019-12-26 23:10:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:22,486 INFO L462 AbstractCegarLoop]: Abstraction has 2622 states and 5336 transitions. [2019-12-26 23:10:22,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:10:22,486 INFO L276 IsEmpty]: Start isEmpty. Operand 2622 states and 5336 transitions. [2019-12-26 23:10:22,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-26 23:10:22,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:22,492 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:22,492 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:22,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:22,492 INFO L82 PathProgramCache]: Analyzing trace with hash -768002551, now seen corresponding path program 4 times [2019-12-26 23:10:22,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:22,493 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143783945] [2019-12-26 23:10:22,493 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:22,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:23,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-26 23:10:23,166 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143783945] [2019-12-26 23:10:23,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:23,169 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-26 23:10:23,170 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137180830] [2019-12-26 23:10:23,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-26 23:10:23,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:23,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-26 23:10:23,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=442, Unknown=0, NotChecked=0, Total=506 [2019-12-26 23:10:23,172 INFO L87 Difference]: Start difference. First operand 2622 states and 5336 transitions. Second operand 23 states. [2019-12-26 23:10:28,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:28,028 INFO L93 Difference]: Finished difference Result 4508 states and 8927 transitions. [2019-12-26 23:10:28,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2019-12-26 23:10:28,029 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 87 [2019-12-26 23:10:28,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:28,033 INFO L225 Difference]: With dead ends: 4508 [2019-12-26 23:10:28,034 INFO L226 Difference]: Without dead ends: 4467 [2019-12-26 23:10:28,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1926 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1038, Invalid=5124, Unknown=0, NotChecked=0, Total=6162 [2019-12-26 23:10:28,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4467 states. [2019-12-26 23:10:28,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4467 to 3326. [2019-12-26 23:10:28,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3326 states. [2019-12-26 23:10:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3326 states to 3326 states and 6709 transitions. [2019-12-26 23:10:28,088 INFO L78 Accepts]: Start accepts. Automaton has 3326 states and 6709 transitions. Word has length 87 [2019-12-26 23:10:28,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:28,088 INFO L462 AbstractCegarLoop]: Abstraction has 3326 states and 6709 transitions. [2019-12-26 23:10:28,089 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-26 23:10:28,089 INFO L276 IsEmpty]: Start isEmpty. Operand 3326 states and 6709 transitions. [2019-12-26 23:10:28,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-26 23:10:28,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:28,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:28,095 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:28,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:28,095 INFO L82 PathProgramCache]: Analyzing trace with hash 453868425, now seen corresponding path program 5 times [2019-12-26 23:10:28,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:28,096 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837742258] [2019-12-26 23:10:28,096 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:28,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:10:28,591 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-26 23:10:28,591 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837742258] [2019-12-26 23:10:28,591 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:10:28,591 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-26 23:10:28,592 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29587060] [2019-12-26 23:10:28,592 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-26 23:10:28,592 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:10:28,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-26 23:10:28,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=321, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:10:28,593 INFO L87 Difference]: Start difference. First operand 3326 states and 6709 transitions. Second operand 20 states. [2019-12-26 23:10:30,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:10:30,063 INFO L93 Difference]: Finished difference Result 6066 states and 12021 transitions. [2019-12-26 23:10:30,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 23:10:30,064 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 87 [2019-12-26 23:10:30,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:10:30,070 INFO L225 Difference]: With dead ends: 6066 [2019-12-26 23:10:30,071 INFO L226 Difference]: Without dead ends: 6023 [2019-12-26 23:10:30,071 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=1090, Unknown=0, NotChecked=0, Total=1260 [2019-12-26 23:10:30,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2019-12-26 23:10:30,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 4017. [2019-12-26 23:10:30,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4017 states. [2019-12-26 23:10:30,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 8090 transitions. [2019-12-26 23:10:30,116 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 8090 transitions. Word has length 87 [2019-12-26 23:10:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:10:30,117 INFO L462 AbstractCegarLoop]: Abstraction has 4017 states and 8090 transitions. [2019-12-26 23:10:30,117 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-26 23:10:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 8090 transitions. [2019-12-26 23:10:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-12-26 23:10:30,120 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:10:30,120 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:10:30,121 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:10:30,121 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:10:30,121 INFO L82 PathProgramCache]: Analyzing trace with hash 927908343, now seen corresponding path program 6 times [2019-12-26 23:10:30,121 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:10:30,121 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747216855] [2019-12-26 23:10:30,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:10:30,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:10:30,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:10:30,273 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:10:30,273 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:10:30,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1301] [1301] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_54| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1593~0.base_22| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1593~0.base_22|) (= v_~y$r_buff0_thd0~0_332 0) (= 0 v_~x~0_194) (= |v_#NULL.offset_7| 0) (= v_~y$w_buff1~0_277 0) (= |v_ULTIMATE.start_main_~#t1593~0.offset_16| 0) (= v_~__unbuffered_p1_EBX~0_58 0) (= v_~y$flush_delayed~0_268 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1593~0.base_22|)) (= v_~main$tmp_guard0~0_27 0) (= v_~y$r_buff0_thd1~0_239 0) (= 0 v_~weak$$choice0~0_149) (= v_~y$w_buff1_used~0_756 0) (= v_~y$read_delayed~0_6 0) (= 0 v_~__unbuffered_p1_EAX~0_88) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~y$r_buff1_thd2~0_570) (= v_~y$r_buff1_thd0~0_410 0) (= 0 v_~y$r_buff0_thd2~0_605) (= 0 v_~__unbuffered_cnt~0_64) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1593~0.base_22| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1593~0.base_22|) |v_ULTIMATE.start_main_~#t1593~0.offset_16| 0)) |v_#memory_int_17|) (= v_~weak$$choice2~0_244 0) (= 0 v_~y$w_buff0~0_330) (= 0 |v_#NULL.base_7|) (= v_~y~0_435 0) (= v_~main$tmp_guard1~0_84 0) (= |v_#valid_52| (store .cse0 |v_ULTIMATE.start_main_~#t1593~0.base_22| 1)) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~y$mem_tmp~0_167 0) (= v_~y$r_buff1_thd1~0_207 0) (= v_~y$w_buff0_used~0_1139 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_54|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_180|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_36|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_70|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_29|, ULTIMATE.start_main_#t~nondet70=|v_ULTIMATE.start_main_#t~nondet70_164|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_20|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_47|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_30|, ~y$mem_tmp~0=v_~y$mem_tmp~0_167, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_88, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_63|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_239, ~y$flush_delayed~0=v_~y$flush_delayed~0_268, #length=|v_#length_17|, ULTIMATE.start_main_#t~nondet62=|v_ULTIMATE.start_main_#t~nondet62_15|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_80|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_68|, ULTIMATE.start_main_#t~ite75=|v_ULTIMATE.start_main_#t~ite75_74|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_34|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_393|, ~weak$$choice0~0=v_~weak$$choice0~0_149, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_227|, ULTIMATE.start_main_~#t1594~0.offset=|v_ULTIMATE.start_main_~#t1594~0.offset_15|, ~y$w_buff1~0=v_~y$w_buff1~0_277, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_83|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_605, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_410, ~x~0=v_~x~0_194, ULTIMATE.start_main_~#t1594~0.base=|v_ULTIMATE.start_main_~#t1594~0.base_19|, ULTIMATE.start_main_~#t1593~0.offset=|v_ULTIMATE.start_main_~#t1593~0.offset_16|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_1139, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_84, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_26|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_61|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_44|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_30|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_48|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_207, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_24|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_151|, ~y$w_buff0~0=v_~y$w_buff0~0_330, ~y~0=v_~y~0_435, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_58, ULTIMATE.start_main_#t~nondet69=|v_ULTIMATE.start_main_#t~nondet69_164|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_27, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_8|, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_96|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite76=|v_ULTIMATE.start_main_#t~ite76_63|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_25|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_570, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_240|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_141|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_332, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_17|, ~weak$$choice2~0=v_~weak$$choice2~0_244, ULTIMATE.start_main_~#t1593~0.base=|v_ULTIMATE.start_main_~#t1593~0.base_22|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_756} AuxVars[] AssignedVars[#NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~nondet70, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet62, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite75, ULTIMATE.start_main_#t~ite63, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ULTIMATE.start_main_~#t1594~0.offset, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t1594~0.base, ULTIMATE.start_main_~#t1593~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet69, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet61, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite76, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ULTIMATE.start_main_~#t1593~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:10:30,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] L813-1-->L815: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1594~0.base_10|) 0) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1594~0.base_10| 4)) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1594~0.base_10| 1)) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1594~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t1594~0.base_10|)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1594~0.base_10| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1594~0.base_10|) |v_ULTIMATE.start_main_~#t1594~0.offset_9| 1)) |v_#memory_int_11|) (= |v_ULTIMATE.start_main_~#t1594~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{ULTIMATE.start_main_~#t1594~0.base=|v_ULTIMATE.start_main_~#t1594~0.base_10|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1594~0.offset=|v_ULTIMATE.start_main_~#t1594~0.offset_9|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_11|, #length=|v_#length_11|, ULTIMATE.start_main_#t~nondet61=|v_ULTIMATE.start_main_#t~nondet61_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1594~0.base, ULTIMATE.start_main_~#t1594~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet61] because there is no mapped edge [2019-12-26 23:10:30,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1182] [1182] P0ENTRY-->L4-3: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_6 |v_P0Thread1of1ForFork0_#in~arg.base_6|) (= v_~y$w_buff0_used~0_345 v_~y$w_buff1_used~0_208) (= v_~y$w_buff0_used~0_344 1) (= v_P0Thread1of1ForFork0_~arg.offset_6 |v_P0Thread1of1ForFork0_#in~arg.offset_6|) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|) (= 0 (mod v_~y$w_buff1_used~0_208 256)) (= v_~y$w_buff0~0_64 v_~y$w_buff1~0_60) (= 2 v_~y$w_buff0~0_63) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_345, ~y$w_buff0~0=v_~y$w_buff0~0_64, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_6|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_344, ~y$w_buff1~0=v_~y$w_buff1~0_60, ~y$w_buff0~0=v_~y$w_buff0~0_63, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_8, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_6|, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_6, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_6|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_6, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_208} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, ~y$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 23:10:30,294 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1228] [1228] L770-->L770-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-332606624 256) 0))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-332606624 |P1Thread1of1ForFork1_#t~ite31_Out-332606624|)) (and .cse0 (= ~y~0_In-332606624 |P1Thread1of1ForFork1_#t~ite31_Out-332606624|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-332606624, ~y$flush_delayed~0=~y$flush_delayed~0_In-332606624, ~y~0=~y~0_In-332606624} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-332606624, P1Thread1of1ForFork1_#t~ite31=|P1Thread1of1ForFork1_#t~ite31_Out-332606624|, ~y$flush_delayed~0=~y$flush_delayed~0_In-332606624, ~y~0=~y~0_In-332606624} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-26 23:10:30,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1224] [1224] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-431680593 256)))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite54_Out-431680593| ~y~0_In-431680593)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite54_Out-431680593| ~y$mem_tmp~0_In-431680593)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-431680593, ~y$flush_delayed~0=~y$flush_delayed~0_In-431680593, ~y~0=~y~0_In-431680593} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-431680593, ~y$flush_delayed~0=~y$flush_delayed~0_In-431680593, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-431680593|, ~y~0=~y~0_In-431680593} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-26 23:10:30,308 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1244] [1244] L739-->L739-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1460183707 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-1460183707 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-1460183707| ~y$w_buff0_used~0_In-1460183707) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork0_#t~ite5_Out-1460183707| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1460183707, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1460183707} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1460183707|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1460183707, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1460183707} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-26 23:10:30,309 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1220] [1220] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd1~0_In-1940937572 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1940937572 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1940937572 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1940937572 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-1940937572| ~y$w_buff1_used~0_In-1940937572) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1940937572| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1940937572, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1940937572, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1940937572, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1940937572} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1940937572|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1940937572, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1940937572, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1940937572, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1940937572} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-26 23:10:30,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1209] [1209] L741-->L742: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In464677744 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In464677744 256) 0))) (or (and (= 0 ~y$r_buff0_thd1~0_Out464677744) (not .cse0) (not .cse1)) (and (= ~y$r_buff0_thd1~0_Out464677744 ~y$r_buff0_thd1~0_In464677744) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In464677744, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In464677744} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In464677744, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out464677744|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out464677744} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:10:30,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1219] [1219] L742-->L742-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-1105226132 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In-1105226132 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1105226132 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd1~0_In-1105226132 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1105226132| ~y$r_buff1_thd1~0_In-1105226132) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork0_#t~ite8_Out-1105226132|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1105226132, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1105226132, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1105226132, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1105226132} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1105226132, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1105226132, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1105226132|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1105226132, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1105226132} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-26 23:10:30,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L742-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~__unbuffered_cnt~0_33 (+ v_~__unbuffered_cnt~0_34 1)) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~y$r_buff1_thd1~0_56 |v_P0Thread1of1ForFork0_#t~ite8_30|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_34} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_56, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_29|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_33} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:10:30,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1217] [1217] L790-2-->L790-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite56_Out-302941127| |P1Thread1of1ForFork1_#t~ite55_Out-302941127|)) (.cse1 (= (mod ~y$w_buff1_used~0_In-302941127 256) 0)) (.cse2 (= 0 (mod ~y$r_buff1_thd2~0_In-302941127 256)))) (or (and .cse0 (not .cse1) (= ~y$w_buff1~0_In-302941127 |P1Thread1of1ForFork1_#t~ite55_Out-302941127|) (not .cse2)) (and .cse0 (= ~y~0_In-302941127 |P1Thread1of1ForFork1_#t~ite55_Out-302941127|) (or .cse1 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-302941127, ~y$w_buff1~0=~y$w_buff1~0_In-302941127, ~y~0=~y~0_In-302941127, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-302941127} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-302941127, ~y$w_buff1~0=~y$w_buff1~0_In-302941127, P1Thread1of1ForFork1_#t~ite56=|P1Thread1of1ForFork1_#t~ite56_Out-302941127|, P1Thread1of1ForFork1_#t~ite55=|P1Thread1of1ForFork1_#t~ite55_Out-302941127|, ~y~0=~y~0_In-302941127, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-302941127} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55] because there is no mapped edge [2019-12-26 23:10:30,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1240] [1240] L791-->L791-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-759849559 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-759849559 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite57_Out-759849559| ~y$w_buff0_used~0_In-759849559) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite57_Out-759849559| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-759849559, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-759849559} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-759849559, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-759849559, P1Thread1of1ForFork1_#t~ite57=|P1Thread1of1ForFork1_#t~ite57_Out-759849559|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite57] because there is no mapped edge [2019-12-26 23:10:30,311 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1210] [1210] L792-->L792-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1450889101 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In-1450889101 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1450889101 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-1450889101 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite58_Out-1450889101|)) (and (= |P1Thread1of1ForFork1_#t~ite58_Out-1450889101| ~y$w_buff1_used~0_In-1450889101) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1450889101, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1450889101, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1450889101, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1450889101} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1450889101, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1450889101, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1450889101, P1Thread1of1ForFork1_#t~ite58=|P1Thread1of1ForFork1_#t~ite58_Out-1450889101|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1450889101} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite58] because there is no mapped edge [2019-12-26 23:10:30,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1218] [1218] L793-->L793-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In15557417 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In15557417 256)))) (or (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite59_Out15557417| 0)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite59_Out15557417| ~y$r_buff0_thd2~0_In15557417)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In15557417, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In15557417} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In15557417, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In15557417, P1Thread1of1ForFork1_#t~ite59=|P1Thread1of1ForFork1_#t~ite59_Out15557417|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite59] because there is no mapped edge [2019-12-26 23:10:30,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1237] [1237] L794-->L794-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-1482067085 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1482067085 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd2~0_In-1482067085 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1482067085 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-1482067085 |P1Thread1of1ForFork1_#t~ite60_Out-1482067085|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite60_Out-1482067085|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1482067085, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1482067085, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1482067085, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1482067085} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1482067085, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1482067085, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out-1482067085|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1482067085, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1482067085} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-26 23:10:30,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1271] [1271] L794-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_267 |v_P1Thread1of1ForFork1_#t~ite60_40|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_267, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_#t~ite60=|v_P1Thread1of1ForFork1_#t~ite60_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_#t~ite60, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 23:10:30,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1171] [1171] L819-->L821-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_104 256)) (= 0 (mod v_~y$w_buff0_used~0_277 256))) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_277, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_104, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:10:30,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1233] [1233] L821-2-->L821-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-990551532 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-990551532 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite63_Out-990551532| ~y~0_In-990551532) (or .cse0 .cse1)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite63_Out-990551532| ~y$w_buff1~0_In-990551532) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-990551532, ~y~0=~y~0_In-990551532, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-990551532, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-990551532} OutVars{ULTIMATE.start_main_#t~ite63=|ULTIMATE.start_main_#t~ite63_Out-990551532|, ~y$w_buff1~0=~y$w_buff1~0_In-990551532, ~y~0=~y~0_In-990551532, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-990551532, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-990551532} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63] because there is no mapped edge [2019-12-26 23:10:30,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1179] [1179] L821-4-->L822: Formula: (= v_~y~0_95 |v_ULTIMATE.start_main_#t~ite63_11|) InVars {ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_11|} OutVars{ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_10|, ~y~0=v_~y~0_95, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_7|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite63, ~y~0, ULTIMATE.start_main_#t~ite64] because there is no mapped edge [2019-12-26 23:10:30,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1236] [1236] L822-->L822-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-2045242730 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-2045242730 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-2045242730 |ULTIMATE.start_main_#t~ite65_Out-2045242730|)) (and (= 0 |ULTIMATE.start_main_#t~ite65_Out-2045242730|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2045242730, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2045242730} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2045242730, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2045242730, ULTIMATE.start_main_#t~ite65=|ULTIMATE.start_main_#t~ite65_Out-2045242730|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite65] because there is no mapped edge [2019-12-26 23:10:30,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1246] [1246] L823-->L823-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-992772902 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-992772902 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-992772902 256))) (.cse3 (= (mod ~y$w_buff1_used~0_In-992772902 256) 0))) (or (and (= ~y$w_buff1_used~0_In-992772902 |ULTIMATE.start_main_#t~ite66_Out-992772902|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite66_Out-992772902| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-992772902, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-992772902, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-992772902, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-992772902} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-992772902, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-992772902, ULTIMATE.start_main_#t~ite66=|ULTIMATE.start_main_#t~ite66_Out-992772902|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-992772902, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-992772902} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite66] because there is no mapped edge [2019-12-26 23:10:30,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1226] [1226] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1084920276 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1084920276 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite67_Out-1084920276| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite67_Out-1084920276| ~y$r_buff0_thd0~0_In-1084920276) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1084920276, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1084920276} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1084920276, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1084920276, ULTIMATE.start_main_#t~ite67=|ULTIMATE.start_main_#t~ite67_Out-1084920276|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite67] because there is no mapped edge [2019-12-26 23:10:30,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1214] [1214] L825-->L825-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In366271734 256))) (.cse3 (= (mod ~y$r_buff1_thd0~0_In366271734 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In366271734 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In366271734 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite68_Out366271734|)) (and (= ~y$r_buff1_thd0~0_In366271734 |ULTIMATE.start_main_#t~ite68_Out366271734|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In366271734, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In366271734, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In366271734, ~y$w_buff1_used~0=~y$w_buff1_used~0_In366271734} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In366271734, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In366271734, ULTIMATE.start_main_#t~ite68=|ULTIMATE.start_main_#t~ite68_Out366271734|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In366271734, ~y$w_buff1_used~0=~y$w_buff1_used~0_In366271734} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite68] because there is no mapped edge [2019-12-26 23:10:30,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1216] [1216] L840-->L840-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In1706683551 256) 0))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite91_Out1706683551| ~y~0_In1706683551)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite91_Out1706683551| ~y$mem_tmp~0_In1706683551)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1706683551, ~y$flush_delayed~0=~y$flush_delayed~0_In1706683551, ~y~0=~y~0_In1706683551} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1706683551, ULTIMATE.start_main_#t~ite91=|ULTIMATE.start_main_#t~ite91_Out1706683551|, ~y$flush_delayed~0=~y$flush_delayed~0_In1706683551, ~y~0=~y~0_In1706683551} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite91] because there is no mapped edge [2019-12-26 23:10:30,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1284] [1284] L840-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_37 256)) (= v_~y~0_283 |v_ULTIMATE.start_main_#t~ite91_30|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 0) (= v_~y$flush_delayed~0_174 0)) InVars {ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_30|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_29|, ~y$flush_delayed~0=v_~y$flush_delayed~0_174, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_37, ~y~0=v_~y~0_283, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite91, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:10:30,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:10:30 BasicIcfg [2019-12-26 23:10:30,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:10:30,451 INFO L168 Benchmark]: Toolchain (without parser) took 43571.92 ms. Allocated memory was 146.8 MB in the beginning and 1.4 GB in the end (delta: 1.3 GB). Free memory was 101.8 MB in the beginning and 498.1 MB in the end (delta: -396.3 MB). Peak memory consumption was 867.8 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:30,451 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-26 23:10:30,452 INFO L168 Benchmark]: CACSL2BoogieTranslator took 864.91 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 101.6 MB in the beginning and 156.3 MB in the end (delta: -54.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:30,453 INFO L168 Benchmark]: Boogie Procedure Inliner took 73.97 ms. Allocated memory is still 205.0 MB. Free memory was 156.3 MB in the beginning and 153.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:30,453 INFO L168 Benchmark]: Boogie Preprocessor took 47.24 ms. Allocated memory is still 205.0 MB. Free memory was 153.1 MB in the beginning and 150.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:30,454 INFO L168 Benchmark]: RCFGBuilder took 1259.16 ms. Allocated memory was 205.0 MB in the beginning and 234.4 MB in the end (delta: 29.4 MB). Free memory was 150.6 MB in the beginning and 192.0 MB in the end (delta: -41.5 MB). Peak memory consumption was 63.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:30,455 INFO L168 Benchmark]: TraceAbstraction took 41321.24 ms. Allocated memory was 234.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 192.0 MB in the beginning and 498.1 MB in the end (delta: -306.1 MB). Peak memory consumption was 870.4 MB. Max. memory is 7.1 GB. [2019-12-26 23:10:30,458 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.22 ms. Allocated memory is still 146.8 MB. Free memory was 121.9 MB in the beginning and 121.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 864.91 ms. Allocated memory was 146.8 MB in the beginning and 205.0 MB in the end (delta: 58.2 MB). Free memory was 101.6 MB in the beginning and 156.3 MB in the end (delta: -54.7 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 73.97 ms. Allocated memory is still 205.0 MB. Free memory was 156.3 MB in the beginning and 153.1 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.24 ms. Allocated memory is still 205.0 MB. Free memory was 153.1 MB in the beginning and 150.6 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1259.16 ms. Allocated memory was 205.0 MB in the beginning and 234.4 MB in the end (delta: 29.4 MB). Free memory was 150.6 MB in the beginning and 192.0 MB in the end (delta: -41.5 MB). Peak memory consumption was 63.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 41321.24 ms. Allocated memory was 234.4 MB in the beginning and 1.4 GB in the end (delta: 1.2 GB). Free memory was 192.0 MB in the beginning and 498.1 MB in the end (delta: -306.1 MB). Peak memory consumption was 870.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 7.3s, 231 ProgramPointsBefore, 150 ProgramPointsAfterwards, 307 TransitionsBefore, 186 TransitionsAfterwards, 41414 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 69 ConcurrentYvCompositions, 43 ChoiceCompositions, 14826 VarBasedMoverChecksPositive, 421 VarBasedMoverChecksNegative, 121 SemBasedMoverChecksPositive, 422 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.5s, 0 MoverChecksTotal, 238871 CheckedPairsTotal, 134 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1593, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t1594, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 x = 2 [L755] 2 y = 1 [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L764] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L767] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L768] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y = y$flush_delayed ? y$mem_tmp : y [L771] 2 y$flush_delayed = (_Bool)0 [L774] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L775] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L776] 2 y$flush_delayed = weak$$choice2 [L777] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=1, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L779] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=2, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L780] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L780] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L781] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L782] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L782] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L783] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L784] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L784] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L785] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L786] 2 y = y$flush_delayed ? y$mem_tmp : y [L787] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L793] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=1, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L829] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L830] 0 y$flush_delayed = weak$$choice2 [L831] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L832] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L833] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L833] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L834] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L834] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L835] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L835] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L836] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L836] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L837] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L837] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L838] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L838] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 40.9s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7101 SDtfs, 7407 SDslu, 25563 SDs, 0 SdLazy, 10100 SolverSat, 485 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 271 GetRequests, 40 SyntacticMatches, 16 SemanticMatches, 215 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2330 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55330occurred 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: 8.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 26299 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1093 NumberOfCodeBlocks, 1093 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 987 ConstructedInterpolants, 0 QuantifiedInterpolants, 398075 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...