/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/safe022_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:55:04,527 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:55:04,529 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:55:04,545 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:55:04,545 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:55:04,546 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:55:04,548 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:55:04,549 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:55:04,551 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:55:04,552 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:55:04,553 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:55:04,554 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:55:04,554 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:55:04,555 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:55:04,556 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:55:04,557 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:55:04,558 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:55:04,558 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:55:04,560 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:55:04,562 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:55:04,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:55:04,565 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:55:04,566 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:55:04,566 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:55:04,568 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:55:04,569 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:55:04,569 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:55:04,570 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:55:04,570 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:55:04,571 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:55:04,571 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:55:04,572 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:55:04,573 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:55:04,574 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:55:04,575 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:55:04,575 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:55:04,576 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:55:04,576 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:55:04,576 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:55:04,577 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:55:04,577 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:55:04,578 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:55:04,592 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:55:04,592 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:55:04,593 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:55:04,593 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:55:04,593 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:55:04,594 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:55:04,594 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:55:04,594 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:55:04,594 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:55:04,594 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:55:04,595 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:55:04,595 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:55:04,595 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:55:04,595 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:55:04,595 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:55:04,596 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:55:04,596 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:55:04,596 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:55:04,596 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:55:04,596 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:55:04,597 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:55:04,597 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:55:04,597 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:55:04,597 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:55:04,597 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:55:04,598 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:55:04,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:55:04,598 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:55:04,598 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:55:04,598 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:55:04,858 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:55:04,873 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:55:04,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:55:04,878 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:55:04,878 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:55:04,880 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe022_rmo.opt.i [2019-12-18 14:55:04,951 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6bde491f/cd24bdec879149d59a9c0aeed47bf63e/FLAG4bd0077d4 [2019-12-18 14:55:05,518 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:55:05,519 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe022_rmo.opt.i [2019-12-18 14:55:05,541 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6bde491f/cd24bdec879149d59a9c0aeed47bf63e/FLAG4bd0077d4 [2019-12-18 14:55:05,827 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6bde491f/cd24bdec879149d59a9c0aeed47bf63e [2019-12-18 14:55:05,834 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:55:05,835 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:55:05,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:55:05,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:55:05,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:55:05,843 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:55:05" (1/1) ... [2019-12-18 14:55:05,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49c2c113 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:55:05, skipping insertion in model container [2019-12-18 14:55:05,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:55:05" (1/1) ... [2019-12-18 14:55:05,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:55:05,897 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:55:06,465 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:55:06,476 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:55:06,563 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:55:06,635 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:55:06,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:55:06 WrapperNode [2019-12-18 14:55:06,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:55:06,637 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:55:06,637 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:55:06,637 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:55:06,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:55:06" (1/1) ... [2019-12-18 14:55:06,671 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:55:06" (1/1) ... [2019-12-18 14:55:06,701 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:55:06,702 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:55:06,702 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:55:06,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:55:06,712 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:55:06" (1/1) ... [2019-12-18 14:55:06,712 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:55:06" (1/1) ... [2019-12-18 14:55:06,717 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:55:06" (1/1) ... [2019-12-18 14:55:06,717 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:55:06" (1/1) ... [2019-12-18 14:55:06,738 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:55:06" (1/1) ... [2019-12-18 14:55:06,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:55:06" (1/1) ... [2019-12-18 14:55:06,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:55:06" (1/1) ... [2019-12-18 14:55:06,754 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:55:06,755 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:55:06,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:55:06,755 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:55:06,763 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:55:06" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:55:06,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:55:06,812 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:55:06,812 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:55:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:55:06,813 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:55:06,814 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:55:06,814 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:55:06,815 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:55:06,815 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:55:06,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:55:06,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:55:06,818 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:55:07,458 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:55:07,458 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:55:07,459 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:55:07 BoogieIcfgContainer [2019-12-18 14:55:07,460 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:55:07,461 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:55:07,461 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:55:07,464 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:55:07,464 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:55:05" (1/3) ... [2019-12-18 14:55:07,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c75d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:55:07, skipping insertion in model container [2019-12-18 14:55:07,465 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:55:06" (2/3) ... [2019-12-18 14:55:07,465 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78c75d5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:55:07, skipping insertion in model container [2019-12-18 14:55:07,466 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:55:07" (3/3) ... [2019-12-18 14:55:07,467 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_rmo.opt.i [2019-12-18 14:55:07,477 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:55:07,477 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:55:07,486 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:55:07,487 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:55:07,541 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,542 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,542 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,543 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,543 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,543 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,544 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,544 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,544 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,545 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,546 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,547 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,548 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,549 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,550 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,551 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,554 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,555 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,556 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,556 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,558 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,559 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,560 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,561 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,562 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,565 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,566 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,567 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,568 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,569 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,570 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,571 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,572 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,573 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,574 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,575 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,576 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,590 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,591 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,592 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,594 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,595 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,596 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,597 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,598 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,599 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,600 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,601 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,607 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,608 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,608 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,611 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,625 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,626 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,627 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,628 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,628 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,629 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,630 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,631 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,631 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,632 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:55:07,647 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:55:07,666 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:55:07,666 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:55:07,666 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:55:07,667 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:55:07,667 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:55:07,667 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:55:07,667 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:55:07,667 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:55:07,682 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 181 transitions [2019-12-18 14:55:07,684 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 14:55:07,767 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 14:55:07,768 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:55:07,788 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 14:55:07,807 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 147 places, 181 transitions [2019-12-18 14:55:07,878 INFO L126 PetriNetUnfolder]: 41/179 cut-off events. [2019-12-18 14:55:07,879 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:55:07,886 INFO L76 FinitePrefix]: Finished finitePrefix Result has 186 conditions, 179 events. 41/179 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 345 event pairs. 6/142 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-18 14:55:07,903 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-18 14:55:07,904 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:55:12,453 WARN L192 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 81 [2019-12-18 14:55:12,617 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49472 [2019-12-18 14:55:12,617 INFO L214 etLargeBlockEncoding]: Total number of compositions: 106 [2019-12-18 14:55:12,621 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 75 places, 84 transitions [2019-12-18 14:55:13,023 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8220 states. [2019-12-18 14:55:13,026 INFO L276 IsEmpty]: Start isEmpty. Operand 8220 states. [2019-12-18 14:55:13,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 14:55:13,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:13,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 14:55:13,033 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:13,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:13,039 INFO L82 PathProgramCache]: Analyzing trace with hash 795105, now seen corresponding path program 1 times [2019-12-18 14:55:13,048 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:13,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228172964] [2019-12-18 14:55:13,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:13,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:13,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:55:13,256 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [228172964] [2019-12-18 14:55:13,256 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:13,257 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:55:13,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522815704] [2019-12-18 14:55:13,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:55:13,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:13,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:55:13,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:55:13,277 INFO L87 Difference]: Start difference. First operand 8220 states. Second operand 3 states. [2019-12-18 14:55:13,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:13,535 INFO L93 Difference]: Finished difference Result 8074 states and 26190 transitions. [2019-12-18 14:55:13,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:55:13,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 14:55:13,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:13,613 INFO L225 Difference]: With dead ends: 8074 [2019-12-18 14:55:13,614 INFO L226 Difference]: Without dead ends: 7606 [2019-12-18 14:55:13,615 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:55:13,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7606 states. [2019-12-18 14:55:13,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7606 to 7606. [2019-12-18 14:55:13,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7606 states. [2019-12-18 14:55:13,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7606 states to 7606 states and 24627 transitions. [2019-12-18 14:55:13,985 INFO L78 Accepts]: Start accepts. Automaton has 7606 states and 24627 transitions. Word has length 3 [2019-12-18 14:55:13,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:13,986 INFO L462 AbstractCegarLoop]: Abstraction has 7606 states and 24627 transitions. [2019-12-18 14:55:13,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:55:13,986 INFO L276 IsEmpty]: Start isEmpty. Operand 7606 states and 24627 transitions. [2019-12-18 14:55:13,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:55:13,989 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:13,989 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:13,990 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:13,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:13,990 INFO L82 PathProgramCache]: Analyzing trace with hash 884428319, now seen corresponding path program 1 times [2019-12-18 14:55:13,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:13,991 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284764369] [2019-12-18 14:55:13,991 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:14,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:55:14,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284764369] [2019-12-18 14:55:14,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:14,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:55:14,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977395884] [2019-12-18 14:55:14,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:55:14,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:14,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:55:14,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:55:14,153 INFO L87 Difference]: Start difference. First operand 7606 states and 24627 transitions. Second operand 4 states. [2019-12-18 14:55:14,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:14,483 INFO L93 Difference]: Finished difference Result 11630 states and 36033 transitions. [2019-12-18 14:55:14,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:55:14,484 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:55:14,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:14,571 INFO L225 Difference]: With dead ends: 11630 [2019-12-18 14:55:14,571 INFO L226 Difference]: Without dead ends: 11623 [2019-12-18 14:55:14,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:55:14,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11623 states. [2019-12-18 14:55:14,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11623 to 10415. [2019-12-18 14:55:14,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10415 states. [2019-12-18 14:55:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10415 states to 10415 states and 32855 transitions. [2019-12-18 14:55:14,919 INFO L78 Accepts]: Start accepts. Automaton has 10415 states and 32855 transitions. Word has length 11 [2019-12-18 14:55:14,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:14,920 INFO L462 AbstractCegarLoop]: Abstraction has 10415 states and 32855 transitions. [2019-12-18 14:55:14,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:55:14,920 INFO L276 IsEmpty]: Start isEmpty. Operand 10415 states and 32855 transitions. [2019-12-18 14:55:14,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:55:14,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:14,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:14,925 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:14,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:14,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1398507206, now seen corresponding path program 1 times [2019-12-18 14:55:14,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:14,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194311402] [2019-12-18 14:55:14,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:14,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:15,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:55:15,017 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194311402] [2019-12-18 14:55:15,017 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:15,017 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:55:15,018 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347604655] [2019-12-18 14:55:15,018 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:55:15,019 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:15,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:55:15,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:55:15,019 INFO L87 Difference]: Start difference. First operand 10415 states and 32855 transitions. Second operand 5 states. [2019-12-18 14:55:15,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:15,438 INFO L93 Difference]: Finished difference Result 14471 states and 44955 transitions. [2019-12-18 14:55:15,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:55:15,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-18 14:55:15,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:15,483 INFO L225 Difference]: With dead ends: 14471 [2019-12-18 14:55:15,483 INFO L226 Difference]: Without dead ends: 14471 [2019-12-18 14:55:15,484 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-18 14:55:15,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14471 states. [2019-12-18 14:55:15,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14471 to 11360. [2019-12-18 14:55:15,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11360 states. [2019-12-18 14:55:15,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11360 states to 11360 states and 35793 transitions. [2019-12-18 14:55:15,927 INFO L78 Accepts]: Start accepts. Automaton has 11360 states and 35793 transitions. Word has length 14 [2019-12-18 14:55:15,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:15,930 INFO L462 AbstractCegarLoop]: Abstraction has 11360 states and 35793 transitions. [2019-12-18 14:55:15,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:55:15,930 INFO L276 IsEmpty]: Start isEmpty. Operand 11360 states and 35793 transitions. [2019-12-18 14:55:15,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:55:15,934 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:15,934 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:15,934 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:15,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:15,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1120571574, now seen corresponding path program 1 times [2019-12-18 14:55:15,935 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:15,935 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181577792] [2019-12-18 14:55:15,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:15,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:16,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:55:16,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181577792] [2019-12-18 14:55:16,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:16,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:55:16,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537179880] [2019-12-18 14:55:16,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:55:16,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:16,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:55:16,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:55:16,043 INFO L87 Difference]: Start difference. First operand 11360 states and 35793 transitions. Second operand 3 states. [2019-12-18 14:55:16,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:16,101 INFO L93 Difference]: Finished difference Result 11335 states and 35719 transitions. [2019-12-18 14:55:16,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:55:16,102 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 14:55:16,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:16,129 INFO L225 Difference]: With dead ends: 11335 [2019-12-18 14:55:16,129 INFO L226 Difference]: Without dead ends: 11335 [2019-12-18 14:55:16,129 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:55:16,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11335 states. [2019-12-18 14:55:16,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11335 to 11335. [2019-12-18 14:55:16,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11335 states. [2019-12-18 14:55:17,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11335 states to 11335 states and 35719 transitions. [2019-12-18 14:55:17,011 INFO L78 Accepts]: Start accepts. Automaton has 11335 states and 35719 transitions. Word has length 16 [2019-12-18 14:55:17,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:17,011 INFO L462 AbstractCegarLoop]: Abstraction has 11335 states and 35719 transitions. [2019-12-18 14:55:17,012 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:55:17,012 INFO L276 IsEmpty]: Start isEmpty. Operand 11335 states and 35719 transitions. [2019-12-18 14:55:17,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 14:55:17,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:17,015 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:17,016 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:17,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:17,016 INFO L82 PathProgramCache]: Analyzing trace with hash -1732892148, now seen corresponding path program 1 times [2019-12-18 14:55:17,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:17,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461277888] [2019-12-18 14:55:17,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:17,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:17,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:55:17,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461277888] [2019-12-18 14:55:17,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:17,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:55:17,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163184274] [2019-12-18 14:55:17,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:55:17,063 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:17,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:55:17,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:55:17,064 INFO L87 Difference]: Start difference. First operand 11335 states and 35719 transitions. Second operand 4 states. [2019-12-18 14:55:17,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:17,139 INFO L93 Difference]: Finished difference Result 18566 states and 58786 transitions. [2019-12-18 14:55:17,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:55:17,140 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 14:55:17,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:17,162 INFO L225 Difference]: With dead ends: 18566 [2019-12-18 14:55:17,163 INFO L226 Difference]: Without dead ends: 9176 [2019-12-18 14:55:17,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:55:17,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9176 states. [2019-12-18 14:55:17,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9176 to 9176. [2019-12-18 14:55:17,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9176 states. [2019-12-18 14:55:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9176 states to 9176 states and 28440 transitions. [2019-12-18 14:55:17,539 INFO L78 Accepts]: Start accepts. Automaton has 9176 states and 28440 transitions. Word has length 17 [2019-12-18 14:55:17,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:17,539 INFO L462 AbstractCegarLoop]: Abstraction has 9176 states and 28440 transitions. [2019-12-18 14:55:17,539 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:55:17,539 INFO L276 IsEmpty]: Start isEmpty. Operand 9176 states and 28440 transitions. [2019-12-18 14:55:17,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-18 14:55:17,546 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:17,546 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:17,546 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:17,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:17,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1167521807, now seen corresponding path program 1 times [2019-12-18 14:55:17,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:17,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663649723] [2019-12-18 14:55:17,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:17,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:55:17,628 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663649723] [2019-12-18 14:55:17,628 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:17,628 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:55:17,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323650300] [2019-12-18 14:55:17,629 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:55:17,629 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:17,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:55:17,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:55:17,630 INFO L87 Difference]: Start difference. First operand 9176 states and 28440 transitions. Second operand 3 states. [2019-12-18 14:55:17,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:17,679 INFO L93 Difference]: Finished difference Result 8732 states and 26564 transitions. [2019-12-18 14:55:17,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:55:17,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-18 14:55:17,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:17,698 INFO L225 Difference]: With dead ends: 8732 [2019-12-18 14:55:17,698 INFO L226 Difference]: Without dead ends: 8732 [2019-12-18 14:55:17,698 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:55:17,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8732 states. [2019-12-18 14:55:17,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8732 to 8732. [2019-12-18 14:55:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8732 states. [2019-12-18 14:55:17,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8732 states to 8732 states and 26564 transitions. [2019-12-18 14:55:17,914 INFO L78 Accepts]: Start accepts. Automaton has 8732 states and 26564 transitions. Word has length 18 [2019-12-18 14:55:17,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:17,914 INFO L462 AbstractCegarLoop]: Abstraction has 8732 states and 26564 transitions. [2019-12-18 14:55:17,914 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:55:17,915 INFO L276 IsEmpty]: Start isEmpty. Operand 8732 states and 26564 transitions. [2019-12-18 14:55:17,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:55:17,918 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:17,918 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:17,919 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:17,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:17,919 INFO L82 PathProgramCache]: Analyzing trace with hash 800753806, now seen corresponding path program 1 times [2019-12-18 14:55:17,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:17,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790866684] [2019-12-18 14:55:17,920 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:55:17,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790866684] [2019-12-18 14:55:17,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:17,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:55:17,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156661994] [2019-12-18 14:55:17,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:55:17,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:17,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:55:17,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:55:17,988 INFO L87 Difference]: Start difference. First operand 8732 states and 26564 transitions. Second operand 4 states. [2019-12-18 14:55:18,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:18,021 INFO L93 Difference]: Finished difference Result 1587 states and 3865 transitions. [2019-12-18 14:55:18,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:55:18,022 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-18 14:55:18,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:18,024 INFO L225 Difference]: With dead ends: 1587 [2019-12-18 14:55:18,024 INFO L226 Difference]: Without dead ends: 1155 [2019-12-18 14:55:18,025 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:55:18,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1155 states. [2019-12-18 14:55:18,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1155 to 1155. [2019-12-18 14:55:18,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1155 states. [2019-12-18 14:55:18,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1155 states to 1155 states and 2511 transitions. [2019-12-18 14:55:18,045 INFO L78 Accepts]: Start accepts. Automaton has 1155 states and 2511 transitions. Word has length 19 [2019-12-18 14:55:18,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:18,045 INFO L462 AbstractCegarLoop]: Abstraction has 1155 states and 2511 transitions. [2019-12-18 14:55:18,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:55:18,046 INFO L276 IsEmpty]: Start isEmpty. Operand 1155 states and 2511 transitions. [2019-12-18 14:55:18,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-18 14:55:18,048 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:18,048 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] [2019-12-18 14:55:18,048 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:18,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:18,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1297290495, now seen corresponding path program 1 times [2019-12-18 14:55:18,049 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:18,049 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040750066] [2019-12-18 14:55:18,049 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:18,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:18,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:55:18,147 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040750066] [2019-12-18 14:55:18,147 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:18,147 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:55:18,147 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597985117] [2019-12-18 14:55:18,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:55:18,148 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:18,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:55:18,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:55:18,149 INFO L87 Difference]: Start difference. First operand 1155 states and 2511 transitions. Second operand 6 states. [2019-12-18 14:55:18,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:18,397 INFO L93 Difference]: Finished difference Result 1173 states and 2521 transitions. [2019-12-18 14:55:18,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:55:18,397 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-18 14:55:18,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:18,399 INFO L225 Difference]: With dead ends: 1173 [2019-12-18 14:55:18,400 INFO L226 Difference]: Without dead ends: 1121 [2019-12-18 14:55:18,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:55:18,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1121 states. [2019-12-18 14:55:18,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1121 to 1100. [2019-12-18 14:55:18,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1100 states. [2019-12-18 14:55:18,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1100 states to 1100 states and 2394 transitions. [2019-12-18 14:55:18,418 INFO L78 Accepts]: Start accepts. Automaton has 1100 states and 2394 transitions. Word has length 24 [2019-12-18 14:55:18,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:18,418 INFO L462 AbstractCegarLoop]: Abstraction has 1100 states and 2394 transitions. [2019-12-18 14:55:18,418 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:55:18,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1100 states and 2394 transitions. [2019-12-18 14:55:18,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-18 14:55:18,420 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:18,420 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:18,421 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:18,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:18,421 INFO L82 PathProgramCache]: Analyzing trace with hash 747998845, now seen corresponding path program 1 times [2019-12-18 14:55:18,421 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:18,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070102559] [2019-12-18 14:55:18,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:18,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:18,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:55:18,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070102559] [2019-12-18 14:55:18,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:18,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:55:18,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191053554] [2019-12-18 14:55:18,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:55:18,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:18,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:55:18,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:55:18,499 INFO L87 Difference]: Start difference. First operand 1100 states and 2394 transitions. Second operand 5 states. [2019-12-18 14:55:18,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:18,547 INFO L93 Difference]: Finished difference Result 556 states and 1184 transitions. [2019-12-18 14:55:18,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:55:18,547 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-18 14:55:18,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:18,548 INFO L225 Difference]: With dead ends: 556 [2019-12-18 14:55:18,548 INFO L226 Difference]: Without dead ends: 471 [2019-12-18 14:55:18,549 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-18 14:55:18,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2019-12-18 14:55:18,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 471. [2019-12-18 14:55:18,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-12-18 14:55:18,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 1036 transitions. [2019-12-18 14:55:18,556 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 1036 transitions. Word has length 28 [2019-12-18 14:55:18,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:18,556 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 1036 transitions. [2019-12-18 14:55:18,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:55:18,556 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 1036 transitions. [2019-12-18 14:55:18,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 14:55:18,558 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:18,558 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:18,559 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:18,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:18,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1382412251, now seen corresponding path program 1 times [2019-12-18 14:55:18,559 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:18,560 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949003735] [2019-12-18 14:55:18,560 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:18,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:18,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:55:18,662 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949003735] [2019-12-18 14:55:18,662 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:18,662 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:55:18,662 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18525040] [2019-12-18 14:55:18,663 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:55:18,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:18,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:55:18,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:55:18,663 INFO L87 Difference]: Start difference. First operand 471 states and 1036 transitions. Second operand 7 states. [2019-12-18 14:55:18,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:18,980 INFO L93 Difference]: Finished difference Result 982 states and 2086 transitions. [2019-12-18 14:55:18,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:55:18,980 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-18 14:55:18,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:18,981 INFO L225 Difference]: With dead ends: 982 [2019-12-18 14:55:18,982 INFO L226 Difference]: Without dead ends: 683 [2019-12-18 14:55:18,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:55:18,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2019-12-18 14:55:19,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 529. [2019-12-18 14:55:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2019-12-18 14:55:19,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 1137 transitions. [2019-12-18 14:55:19,006 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 1137 transitions. Word has length 51 [2019-12-18 14:55:19,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:19,006 INFO L462 AbstractCegarLoop]: Abstraction has 529 states and 1137 transitions. [2019-12-18 14:55:19,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:55:19,006 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 1137 transitions. [2019-12-18 14:55:19,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 14:55:19,009 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:19,009 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:19,009 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:19,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:19,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1158154681, now seen corresponding path program 2 times [2019-12-18 14:55:19,010 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:19,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528177636] [2019-12-18 14:55:19,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:19,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:19,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:55:19,158 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528177636] [2019-12-18 14:55:19,158 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:19,158 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:55:19,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242201476] [2019-12-18 14:55:19,159 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:55:19,159 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:19,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:55:19,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:55:19,160 INFO L87 Difference]: Start difference. First operand 529 states and 1137 transitions. Second operand 5 states. [2019-12-18 14:55:19,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:19,559 INFO L93 Difference]: Finished difference Result 885 states and 1849 transitions. [2019-12-18 14:55:19,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:55:19,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2019-12-18 14:55:19,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:19,561 INFO L225 Difference]: With dead ends: 885 [2019-12-18 14:55:19,561 INFO L226 Difference]: Without dead ends: 861 [2019-12-18 14:55:19,561 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-18 14:55:19,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 861 states. [2019-12-18 14:55:19,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 861 to 712. [2019-12-18 14:55:19,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 712 states. [2019-12-18 14:55:19,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1532 transitions. [2019-12-18 14:55:19,572 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1532 transitions. Word has length 51 [2019-12-18 14:55:19,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:19,572 INFO L462 AbstractCegarLoop]: Abstraction has 712 states and 1532 transitions. [2019-12-18 14:55:19,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:55:19,572 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1532 transitions. [2019-12-18 14:55:19,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-18 14:55:19,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:19,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:19,574 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:19,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:19,575 INFO L82 PathProgramCache]: Analyzing trace with hash -320603405, now seen corresponding path program 3 times [2019-12-18 14:55:19,575 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:19,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260646536] [2019-12-18 14:55:19,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:19,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:55:19,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:55:19,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260646536] [2019-12-18 14:55:19,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:55:19,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:55:19,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948834844] [2019-12-18 14:55:19,644 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:55:19,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:55:19,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:55:19,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:55:19,645 INFO L87 Difference]: Start difference. First operand 712 states and 1532 transitions. Second operand 3 states. [2019-12-18 14:55:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:55:19,696 INFO L93 Difference]: Finished difference Result 923 states and 1980 transitions. [2019-12-18 14:55:19,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:55:19,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-18 14:55:19,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:55:19,698 INFO L225 Difference]: With dead ends: 923 [2019-12-18 14:55:19,698 INFO L226 Difference]: Without dead ends: 923 [2019-12-18 14:55:19,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:55:19,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-12-18 14:55:19,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 754. [2019-12-18 14:55:19,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 754 states. [2019-12-18 14:55:19,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1638 transitions. [2019-12-18 14:55:19,710 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1638 transitions. Word has length 51 [2019-12-18 14:55:19,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:55:19,710 INFO L462 AbstractCegarLoop]: Abstraction has 754 states and 1638 transitions. [2019-12-18 14:55:19,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:55:19,711 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1638 transitions. [2019-12-18 14:55:19,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-18 14:55:19,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:55:19,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:55:19,713 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:55:19,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:55:19,713 INFO L82 PathProgramCache]: Analyzing trace with hash 482770276, now seen corresponding path program 1 times [2019-12-18 14:55:19,714 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:55:19,714 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436913384] [2019-12-18 14:55:19,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:55:19,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:55:19,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:55:19,830 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:55:19,830 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:55:19,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L794: Formula: (let ((.cse0 (store |v_#valid_75| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (= 0 v_~y$w_buff0~0_235) (= 0 v_~__unbuffered_cnt~0_55) (= v_~x~0_86 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2315~0.base_48| 4)) (= |v_#NULL.offset_6| 0) (= v_~weak$$choice2~0_112 0) (= v_~main$tmp_guard0~0_29 0) (= v_~y$r_buff0_thd1~0_177 0) (= 0 v_~y$r_buff0_thd2~0_324) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2315~0.base_48| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t2315~0.base_48|) |v_ULTIMATE.start_main_~#t2315~0.offset_31| 0)) |v_#memory_int_17|) (= v_~y$r_buff1_thd0~0_129 0) (= v_~y$read_delayed~0_6 0) (= v_~__unbuffered_p1_EBX~0_49 0) (= 0 v_~weak$$choice0~0_29) (= v_~y$w_buff1~0_162 0) (< 0 |v_#StackHeapBarrier_14|) (= v_~main$tmp_guard1~0_41 0) (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t2315~0.base_48|) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff0_used~0_632 0) (= 0 v_~__unbuffered_p1_EAX~0_55) (= |v_ULTIMATE.start_main_~#t2315~0.offset_31| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2315~0.base_48|) 0) (= v_~y~0_137 0) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$flush_delayed~0_38) (= v_~y$mem_tmp~0_31 0) (= v_~y$w_buff1_used~0_311 0) (= 0 v_~y$read_delayed_var~0.offset_6) (= 0 v_~y$r_buff1_thd2~0_223) (= |v_#valid_73| (store .cse0 |v_ULTIMATE.start_main_~#t2315~0.base_48| 1)) (= v_~y$r_buff1_thd1~0_115 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_75|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{~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_632, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_41, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_26|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_430|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_84|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_40|, ~y$read_delayed~0=v_~y$read_delayed~0_6, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_115, ~y$mem_tmp~0=v_~y$mem_tmp~0_31, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_55, ~y$w_buff0~0=v_~y$w_buff0~0_235, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_177, ~y$flush_delayed~0=v_~y$flush_delayed~0_38, #length=|v_#length_17|, ~y~0=v_~y~0_137, ULTIMATE.start_main_~#t2316~0.offset=|v_ULTIMATE.start_main_~#t2316~0.offset_31|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ULTIMATE.start_main_~#t2316~0.base=|v_ULTIMATE.start_main_~#t2316~0.base_49|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t2315~0.offset=|v_ULTIMATE.start_main_~#t2315~0.offset_31|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_223, ~weak$$choice0~0=v_~weak$$choice0~0_29, #StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_89|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_62|, ~y$w_buff1~0=v_~y$w_buff1~0_162, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_~#t2315~0.base=|v_ULTIMATE.start_main_~#t2315~0.base_48|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_31|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_73|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_324, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_15|, ~weak$$choice2~0=v_~weak$$choice2~0_112, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_129, ~x~0=v_~x~0_86, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_311} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ULTIMATE.start_main_~#t2316~0.offset, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t2316~0.base, #NULL.base, ULTIMATE.start_main_~#t2315~0.offset, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_~#t2315~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:55:19,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L794-1-->L796: Formula: (and (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2316~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t2316~0.base_13| 4)) (= |v_ULTIMATE.start_main_~#t2316~0.offset_11| 0) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2316~0.base_13| 1)) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2316~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2316~0.base_13|) |v_ULTIMATE.start_main_~#t2316~0.offset_11| 1))) (not (= 0 |v_ULTIMATE.start_main_~#t2316~0.base_13|)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t2316~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_12|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t2316~0.base=|v_ULTIMATE.start_main_~#t2316~0.base_13|, ULTIMATE.start_main_~#t2316~0.offset=|v_ULTIMATE.start_main_~#t2316~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t2316~0.base, ULTIMATE.start_main_~#t2316~0.offset] because there is no mapped edge [2019-12-18 14:55:19,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L738: Formula: (and (= 1 ~x~0_Out506653520) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In506653520)) (= ~y$r_buff0_thd1~0_Out506653520 1) (= ~y$r_buff0_thd1~0_In506653520 ~y$r_buff1_thd1~0_Out506653520) (= ~y$r_buff0_thd0~0_In506653520 ~y$r_buff1_thd0~0_Out506653520) (= ~y$r_buff1_thd2~0_Out506653520 ~y$r_buff0_thd2~0_In506653520)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In506653520, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In506653520, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In506653520, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In506653520} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out506653520, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out506653520, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In506653520, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out506653520, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In506653520, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In506653520, ~x~0=~x~0_Out506653520, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out506653520} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff0_thd1~0, ~x~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 14:55:19,842 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L739-->L739-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-896628610 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-896628610 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-896628610| ~y$w_buff0_used~0_In-896628610) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite5_Out-896628610| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-896628610, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-896628610} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-896628610|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-896628610, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-896628610} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:55:19,846 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L762-->L762-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-2090640685 256) 0))) (or (and .cse0 (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-2090640685 256) 0))) (or (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-2090640685 256))) (and .cse1 (= (mod ~y$w_buff1_used~0_In-2090640685 256) 0)) (= 0 (mod ~y$w_buff0_used~0_In-2090640685 256)))) (= |P1Thread1of1ForFork1_#t~ite21_Out-2090640685| |P1Thread1of1ForFork1_#t~ite20_Out-2090640685|) (= ~y$w_buff0_used~0_In-2090640685 |P1Thread1of1ForFork1_#t~ite20_Out-2090640685|)) (and (= |P1Thread1of1ForFork1_#t~ite20_In-2090640685| |P1Thread1of1ForFork1_#t~ite20_Out-2090640685|) (= ~y$w_buff0_used~0_In-2090640685 |P1Thread1of1ForFork1_#t~ite21_Out-2090640685|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2090640685, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2090640685, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-2090640685|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2090640685, ~weak$$choice2~0=~weak$$choice2~0_In-2090640685, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2090640685} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-2090640685, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2090640685, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-2090640685|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-2090640685, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-2090640685|, ~weak$$choice2~0=~weak$$choice2~0_In-2090640685, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2090640685} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-18 14:55:19,847 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-8: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite24_Out-1052435754| |P1Thread1of1ForFork1_#t~ite23_Out-1052435754|)) (.cse4 (= 0 (mod ~y$r_buff1_thd2~0_In-1052435754 256))) (.cse1 (= (mod ~weak$$choice2~0_In-1052435754 256) 0)) (.cse5 (= 0 (mod ~y$w_buff0_used~0_In-1052435754 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1052435754 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1052435754 256)))) (or (and (or (and .cse0 .cse1 (or (and .cse2 .cse3) (and .cse2 .cse4) .cse5) (= |P1Thread1of1ForFork1_#t~ite23_Out-1052435754| ~y$w_buff1_used~0_In-1052435754)) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-1052435754| |P1Thread1of1ForFork1_#t~ite23_In-1052435754|) (= |P1Thread1of1ForFork1_#t~ite24_Out-1052435754| ~y$w_buff1_used~0_In-1052435754) (not .cse1))) (= |P1Thread1of1ForFork1_#t~ite22_In-1052435754| |P1Thread1of1ForFork1_#t~ite22_Out-1052435754|)) (let ((.cse6 (not .cse2))) (and .cse0 (or (not .cse4) .cse6) (= 0 |P1Thread1of1ForFork1_#t~ite22_Out-1052435754|) .cse1 (not .cse5) (or (not .cse3) .cse6) (= |P1Thread1of1ForFork1_#t~ite23_Out-1052435754| |P1Thread1of1ForFork1_#t~ite22_Out-1052435754|))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1052435754, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1052435754, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1052435754, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1052435754|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1052435754|, ~weak$$choice2~0=~weak$$choice2~0_In-1052435754, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1052435754} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1052435754, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1052435754, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1052435754, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1052435754|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1052435754|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1052435754|, ~weak$$choice2~0=~weak$$choice2~0_In-1052435754, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1052435754} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-18 14:55:19,849 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [704] [704] L740-->L740-2: Formula: (let ((.cse2 (= (mod ~y$r_buff1_thd1~0_In-1727855459 256) 0)) (.cse3 (= (mod ~y$w_buff1_used~0_In-1727855459 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1727855459 256))) (.cse1 (= (mod ~y$r_buff0_thd1~0_In-1727855459 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1727855459| 0)) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1727855459| ~y$w_buff1_used~0_In-1727855459)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1727855459, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1727855459, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1727855459, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1727855459} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1727855459|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1727855459, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1727855459, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1727855459, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1727855459} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:55:19,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L742: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In221202062 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In221202062 256)))) (or (and (= ~y$r_buff0_thd1~0_Out221202062 ~y$r_buff0_thd1~0_In221202062) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~y$r_buff0_thd1~0_Out221202062 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In221202062, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In221202062} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In221202062, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out221202062|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out221202062} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:55:19,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L742-->L742-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In559021361 256))) (.cse3 (= (mod ~y$r_buff0_thd1~0_In559021361 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In559021361 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd1~0_In559021361 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out559021361| 0)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out559021361| ~y$r_buff1_thd1~0_In559021361) (or .cse0 .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In559021361, ~y$w_buff0_used~0=~y$w_buff0_used~0_In559021361, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In559021361, ~y$w_buff1_used~0=~y$w_buff1_used~0_In559021361} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In559021361, ~y$w_buff0_used~0=~y$w_buff0_used~0_In559021361, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out559021361|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In559021361, ~y$w_buff1_used~0=~y$w_buff1_used~0_In559021361} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:55:19,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L763-8-->L765: Formula: (and (= v_~y$w_buff1_used~0_299 |v_P1Thread1of1ForFork1_#t~ite24_29|) (not (= (mod v_~weak$$choice2~0_92 256) 0)) (= v_~y$r_buff0_thd2~0_309 v_~y$r_buff0_thd2~0_310)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_310, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_309, P1Thread1of1ForFork1_#t~ite23=|v_P1Thread1of1ForFork1_#t~ite23_28|, P1Thread1of1ForFork1_#t~ite24=|v_P1Thread1of1ForFork1_#t~ite24_28|, P1Thread1of1ForFork1_#t~ite22=|v_P1Thread1of1ForFork1_#t~ite22_24|, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_29|, ~weak$$choice2~0=v_~weak$$choice2~0_92, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_31|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_34|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_299} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:55:19,851 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In160519248 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite29_In160519248| |P1Thread1of1ForFork1_#t~ite29_Out160519248|) (= |P1Thread1of1ForFork1_#t~ite30_Out160519248| ~y$r_buff1_thd2~0_In160519248) (not .cse0)) (and (= |P1Thread1of1ForFork1_#t~ite29_Out160519248| |P1Thread1of1ForFork1_#t~ite30_Out160519248|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In160519248 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In160519248 256)) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In160519248 256))) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In160519248 256))))) (= |P1Thread1of1ForFork1_#t~ite29_Out160519248| ~y$r_buff1_thd2~0_In160519248) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In160519248, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In160519248|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In160519248, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In160519248, ~weak$$choice2~0=~weak$$choice2~0_In160519248, ~y$w_buff1_used~0=~y$w_buff1_used~0_In160519248} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In160519248, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out160519248|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out160519248|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In160519248, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In160519248, ~weak$$choice2~0=~weak$$choice2~0_In160519248, ~y$w_buff1_used~0=~y$w_buff1_used~0_In160519248} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30] because there is no mapped edge [2019-12-18 14:55:19,853 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L767-->L771: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_25 v_~y$mem_tmp~0_5) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_5, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_5, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_25} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-18 14:55:19,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L771-2-->L771-4: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-460796682 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-460796682 256) 0))) (or (and (= ~y~0_In-460796682 |P1Thread1of1ForFork1_#t~ite32_Out-460796682|) (or .cse0 .cse1)) (and (not .cse1) (= ~y$w_buff1~0_In-460796682 |P1Thread1of1ForFork1_#t~ite32_Out-460796682|) (not .cse0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-460796682, ~y$w_buff1~0=~y$w_buff1~0_In-460796682, ~y~0=~y~0_In-460796682, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460796682} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-460796682, ~y$w_buff1~0=~y$w_buff1~0_In-460796682, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-460796682|, ~y~0=~y~0_In-460796682, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-460796682} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-18 14:55:19,854 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [654] [654] L771-4-->L772: Formula: (= v_~y~0_18 |v_P1Thread1of1ForFork1_#t~ite32_10|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_9|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_13|, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~y~0] because there is no mapped edge [2019-12-18 14:55:19,855 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [707] [707] L772-->L772-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In2124821985 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In2124821985 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite34_Out2124821985|) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite34_Out2124821985| ~y$w_buff0_used~0_In2124821985) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2124821985, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2124821985} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2124821985, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In2124821985, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out2124821985|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 14:55:19,856 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L773-->L773-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In-1664959203 256))) (.cse3 (= (mod ~y$r_buff1_thd2~0_In-1664959203 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1664959203 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1664959203 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-1664959203 |P1Thread1of1ForFork1_#t~ite35_Out-1664959203|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P1Thread1of1ForFork1_#t~ite35_Out-1664959203|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1664959203, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1664959203, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1664959203, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1664959203} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1664959203, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1664959203, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1664959203, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-1664959203|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1664959203} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 14:55:19,857 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In297268182 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In297268182 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out297268182|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In297268182 |P1Thread1of1ForFork1_#t~ite36_Out297268182|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In297268182, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In297268182} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In297268182, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In297268182, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out297268182|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-18 14:55:19,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L775-->L775-2: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-471241727 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-471241727 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In-471241727 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-471241727 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite37_Out-471241727| ~y$r_buff1_thd2~0_In-471241727)) (and (= |P1Thread1of1ForFork1_#t~ite37_Out-471241727| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-471241727, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-471241727, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-471241727, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-471241727} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-471241727, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-471241727, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-471241727, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-471241727|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-471241727} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:55:19,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L775-2-->P1EXIT: Formula: (and (= v_~y$r_buff1_thd2~0_106 |v_P1Thread1of1ForFork1_#t~ite37_28|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_106, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_27|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 14:55:19,858 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L742-2-->P0EXIT: Formula: (and (= v_~y$r_buff1_thd1~0_69 |v_P0Thread1of1ForFork0_#t~ite8_30|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_43 1) v_~__unbuffered_cnt~0_42) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, 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_42} 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-18 14:55:19,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [690] [690] L800-->L802-2: Formula: (and (or (= 0 (mod v_~y$r_buff0_thd0~0_38 256)) (= (mod v_~y$w_buff0_used~0_265 256) 0)) (not (= (mod v_~main$tmp_guard0~0_7 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_265, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:55:19,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L802-2-->L802-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In271656094 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In271656094 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite40_Out271656094| ~y~0_In271656094)) (and (= ~y$w_buff1~0_In271656094 |ULTIMATE.start_main_#t~ite40_Out271656094|) (not .cse1) (not .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In271656094, ~y~0=~y~0_In271656094, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In271656094, ~y$w_buff1_used~0=~y$w_buff1_used~0_In271656094} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out271656094|, ~y$w_buff1~0=~y$w_buff1~0_In271656094, ~y~0=~y~0_In271656094, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In271656094, ~y$w_buff1_used~0=~y$w_buff1_used~0_In271656094} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-18 14:55:19,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [692] [692] L802-4-->L803: Formula: (= v_~y~0_51 |v_ULTIMATE.start_main_#t~ite40_24|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_24|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_23|, ~y~0=v_~y~0_51} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-18 14:55:19,860 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1626410468 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1626410468 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out1626410468| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In1626410468 |ULTIMATE.start_main_#t~ite42_Out1626410468|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1626410468, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1626410468} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1626410468, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1626410468, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out1626410468|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 14:55:19,861 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L804-->L804-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1231450436 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1231450436 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1231450436 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In-1231450436 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite43_Out-1231450436|)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= ~y$w_buff1_used~0_In-1231450436 |ULTIMATE.start_main_#t~ite43_Out-1231450436|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1231450436, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1231450436, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1231450436, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1231450436} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1231450436, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1231450436, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1231450436|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1231450436, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1231450436} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 14:55:19,862 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L805-->L805-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1577833511 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1577833511 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-1577833511| 0) (not .cse1)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-1577833511| ~y$r_buff0_thd0~0_In-1577833511)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1577833511, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1577833511} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1577833511, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1577833511, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1577833511|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 14:55:19,863 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L806-->L806-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1395166954 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1395166954 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1395166954 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd0~0_In-1395166954 256)))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out-1395166954| ~y$r_buff1_thd0~0_In-1395166954) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite45_Out-1395166954| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1395166954, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1395166954, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1395166954, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1395166954} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1395166954, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1395166954, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1395166954, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1395166954|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1395166954} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 14:55:19,864 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L806-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start_main_#t~ite45_31| v_~y$r_buff1_thd0~0_77) (= v_~__unbuffered_p1_EBX~0_17 0) (= v_~main$tmp_guard1~0_13 0) (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= 1 v_~__unbuffered_p1_EAX~0_21)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_77, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_30|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:55:19,943 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:55:19 BasicIcfg [2019-12-18 14:55:19,943 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:55:19,946 INFO L168 Benchmark]: Toolchain (without parser) took 14109.80 ms. Allocated memory was 144.7 MB in the beginning and 594.5 MB in the end (delta: 449.8 MB). Free memory was 101.1 MB in the beginning and 282.2 MB in the end (delta: -181.0 MB). Peak memory consumption was 268.8 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:19,948 INFO L168 Benchmark]: CDTParser took 1.63 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 14:55:19,949 INFO L168 Benchmark]: CACSL2BoogieTranslator took 797.74 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.7 MB in the beginning and 155.6 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:19,950 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.62 ms. Allocated memory is still 201.3 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:19,950 INFO L168 Benchmark]: Boogie Preprocessor took 52.91 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:19,952 INFO L168 Benchmark]: RCFGBuilder took 704.71 ms. Allocated memory is still 201.3 MB. Free memory was 151.0 MB in the beginning and 106.9 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:19,959 INFO L168 Benchmark]: TraceAbstraction took 12482.59 ms. Allocated memory was 201.3 MB in the beginning and 594.5 MB in the end (delta: 393.2 MB). Free memory was 106.2 MB in the beginning and 282.2 MB in the end (delta: -176.0 MB). Peak memory consumption was 217.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:55:19,966 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.63 ms. Allocated memory is still 144.7 MB. Free memory was 121.0 MB in the beginning and 120.8 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 797.74 ms. Allocated memory was 144.7 MB in the beginning and 201.3 MB in the end (delta: 56.6 MB). Free memory was 100.7 MB in the beginning and 155.6 MB in the end (delta: -54.9 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 64.62 ms. Allocated memory is still 201.3 MB. Free memory was 155.6 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 52.91 ms. Allocated memory is still 201.3 MB. Free memory was 153.0 MB in the beginning and 151.0 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 704.71 ms. Allocated memory is still 201.3 MB. Free memory was 151.0 MB in the beginning and 106.9 MB in the end (delta: 44.1 MB). Peak memory consumption was 44.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12482.59 ms. Allocated memory was 201.3 MB in the beginning and 594.5 MB in the end (delta: 393.2 MB). Free memory was 106.2 MB in the beginning and 282.2 MB in the end (delta: -176.0 MB). Peak memory consumption was 217.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.9s, 147 ProgramPointsBefore, 75 ProgramPointsAfterwards, 181 TransitionsBefore, 84 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 29 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 28 ChoiceCompositions, 4569 VarBasedMoverChecksPositive, 175 VarBasedMoverChecksNegative, 19 SemBasedMoverChecksPositive, 211 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.3s, 0 MoverChecksTotal, 49472 CheckedPairsTotal, 106 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L794] FCALL, FORK 0 pthread_create(&t2315, ((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] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L796] FCALL, FORK 0 pthread_create(&t2316, ((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=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 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)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, 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=1, 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) [L759] 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) [L760] 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=5, 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))=1, x=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L760] 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)) [L761] 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=5, 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=1, y=0, y$flush_delayed=1, 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=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L761] 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)) [L762] 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)) [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 [L765] 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)) [L766] 2 __unbuffered_p1_EBX = 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=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] 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 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] 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 [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 12.1s, OverallIterations: 13, TraceHistogramMax: 1, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1237 SDtfs, 1416 SDslu, 2185 SDs, 0 SdLazy, 1046 SolverSat, 59 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11360occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 12 MinimizatonAttempts, 4812 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 355 NumberOfCodeBlocks, 355 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 291 ConstructedInterpolants, 0 QuantifiedInterpolants, 27785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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...