/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:16:22,449 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:16:22,451 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:16:22,464 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:16:22,464 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:16:22,465 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:16:22,467 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:16:22,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:16:22,470 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:16:22,471 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:16:22,472 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:16:22,474 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:16:22,474 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:16:22,475 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:16:22,476 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:16:22,477 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:16:22,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:16:22,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:16:22,481 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:16:22,483 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:16:22,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:16:22,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:16:22,486 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:16:22,487 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:16:22,489 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:16:22,489 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:16:22,490 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:16:22,491 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:16:22,491 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:16:22,492 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:16:22,492 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:16:22,493 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:16:22,494 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:16:22,495 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:16:22,496 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:16:22,496 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:16:22,496 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:16:22,497 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:16:22,497 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:16:22,498 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:16:22,499 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:16:22,499 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 18:16:22,514 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:16:22,514 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:16:22,515 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:16:22,516 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:16:22,516 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:16:22,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:16:22,516 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:16:22,516 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:16:22,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:16:22,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:16:22,517 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:16:22,517 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:16:22,517 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:16:22,518 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:16:22,518 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:16:22,518 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:16:22,518 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:16:22,518 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:16:22,519 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:16:22,519 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:16:22,519 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:16:22,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:16:22,519 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:16:22,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:16:22,520 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:16:22,520 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:16:22,520 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:16:22,520 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:16:22,520 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:16:22,789 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:16:22,803 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:16:22,806 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:16:22,807 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:16:22,808 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:16:22,808 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i [2019-12-18 18:16:22,876 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca2d7af8f/960c091c3ab4474dbdefce541ed57c9c/FLAGbab871d68 [2019-12-18 18:16:23,435 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:16:23,435 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe001_pso.oepc.i [2019-12-18 18:16:23,462 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca2d7af8f/960c091c3ab4474dbdefce541ed57c9c/FLAGbab871d68 [2019-12-18 18:16:23,682 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ca2d7af8f/960c091c3ab4474dbdefce541ed57c9c [2019-12-18 18:16:23,693 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:16:23,698 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:16:23,700 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:16:23,700 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:16:23,704 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:16:23,705 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:16:23" (1/1) ... [2019-12-18 18:16:23,708 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@127092cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:16:23, skipping insertion in model container [2019-12-18 18:16:23,708 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:16:23" (1/1) ... [2019-12-18 18:16:23,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:16:23,771 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:16:24,324 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:16:24,339 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:16:24,435 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:16:24,511 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:16:24,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:16:24 WrapperNode [2019-12-18 18:16:24,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:16:24,513 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:16:24,513 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:16:24,513 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:16:24,522 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:16:24" (1/1) ... [2019-12-18 18:16:24,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:16:24" (1/1) ... [2019-12-18 18:16:24,593 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:16:24,594 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:16:24,594 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:16:24,594 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:16:24,601 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:16:24" (1/1) ... [2019-12-18 18:16:24,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:16:24" (1/1) ... [2019-12-18 18:16:24,606 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:16:24" (1/1) ... [2019-12-18 18:16:24,606 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:16:24" (1/1) ... [2019-12-18 18:16:24,617 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:16:24" (1/1) ... [2019-12-18 18:16:24,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:16:24" (1/1) ... [2019-12-18 18:16:24,624 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:16:24" (1/1) ... [2019-12-18 18:16:24,630 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:16:24,630 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:16:24,630 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:16:24,630 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:16:24,631 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:16:24" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:16:24,706 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:16:24,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:16:24,706 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:16:24,707 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:16:24,707 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:16:24,707 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:16:24,708 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:16:24,708 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:16:24,709 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:16:24,710 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:16:24,712 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:16:24,713 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:16:24,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:16:24,715 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:16:25,499 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:16:25,500 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:16:25,501 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:16:25 BoogieIcfgContainer [2019-12-18 18:16:25,501 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:16:25,504 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:16:25,504 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:16:25,508 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:16:25,508 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:16:23" (1/3) ... [2019-12-18 18:16:25,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278a2a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:16:25, skipping insertion in model container [2019-12-18 18:16:25,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:16:24" (2/3) ... [2019-12-18 18:16:25,511 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@278a2a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:16:25, skipping insertion in model container [2019-12-18 18:16:25,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:16:25" (3/3) ... [2019-12-18 18:16:25,514 INFO L109 eAbstractionObserver]: Analyzing ICFG safe001_pso.oepc.i [2019-12-18 18:16:25,526 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:16:25,526 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:16:25,538 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:16:25,539 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:16:25,602 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,603 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,603 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,604 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,604 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,605 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,606 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,607 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,608 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,609 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,610 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,611 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,612 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,614 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,614 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,614 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,615 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,615 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,617 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,618 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,619 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,620 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,621 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,622 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,623 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,646 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,646 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,646 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,647 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,648 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,649 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,653 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,654 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,661 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,664 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,668 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,668 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,669 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,674 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,675 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,676 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,677 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,679 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,679 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,680 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,680 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,681 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:16:25,694 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:16:25,710 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:16:25,710 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:16:25,710 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:16:25,710 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:16:25,711 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:16:25,711 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:16:25,711 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:16:25,711 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:16:25,727 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 18:16:25,729 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 18:16:25,816 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 18:16:25,816 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:16:25,834 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:16:25,861 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 18:16:25,913 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 18:16:25,913 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:16:25,923 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:16:25,944 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 18:16:25,945 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:16:30,844 WARN L192 SmtUtils]: Spent 243.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 18:16:30,970 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 18:16:30,999 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78277 [2019-12-18 18:16:30,999 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 18:16:31,003 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 106 transitions [2019-12-18 18:16:46,093 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 107408 states. [2019-12-18 18:16:46,095 INFO L276 IsEmpty]: Start isEmpty. Operand 107408 states. [2019-12-18 18:16:46,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 18:16:46,100 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:16:46,101 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 18:16:46,101 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:16:46,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:16:46,106 INFO L82 PathProgramCache]: Analyzing trace with hash 809703812, now seen corresponding path program 1 times [2019-12-18 18:16:46,112 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:16:46,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215593726] [2019-12-18 18:16:46,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:16:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:16:47,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:16:47,551 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215593726] [2019-12-18 18:16:47,552 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:16:47,553 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:16:47,553 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880276454] [2019-12-18 18:16:47,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:16:47,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:16:47,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:16:47,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:16:47,575 INFO L87 Difference]: Start difference. First operand 107408 states. Second operand 3 states. [2019-12-18 18:16:48,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:16:48,638 INFO L93 Difference]: Finished difference Result 107108 states and 460900 transitions. [2019-12-18 18:16:48,638 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:16:48,640 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 18:16:48,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:16:52,297 INFO L225 Difference]: With dead ends: 107108 [2019-12-18 18:16:52,297 INFO L226 Difference]: Without dead ends: 104924 [2019-12-18 18:16:52,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:16:55,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104924 states. [2019-12-18 18:16:58,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104924 to 104924. [2019-12-18 18:16:58,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104924 states. [2019-12-18 18:16:58,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104924 states to 104924 states and 451982 transitions. [2019-12-18 18:16:58,619 INFO L78 Accepts]: Start accepts. Automaton has 104924 states and 451982 transitions. Word has length 5 [2019-12-18 18:16:58,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:16:58,620 INFO L462 AbstractCegarLoop]: Abstraction has 104924 states and 451982 transitions. [2019-12-18 18:16:58,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:16:58,620 INFO L276 IsEmpty]: Start isEmpty. Operand 104924 states and 451982 transitions. [2019-12-18 18:16:58,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:16:58,623 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:16:58,623 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:16:58,623 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:16:58,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:16:58,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2105056515, now seen corresponding path program 1 times [2019-12-18 18:16:58,624 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:16:58,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092210449] [2019-12-18 18:16:58,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:16:58,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:16:58,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:16:58,755 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092210449] [2019-12-18 18:16:58,755 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:16:58,755 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:16:58,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74849053] [2019-12-18 18:16:58,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:16:58,757 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:16:58,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:16:58,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:16:58,758 INFO L87 Difference]: Start difference. First operand 104924 states and 451982 transitions. Second operand 4 states. [2019-12-18 18:17:03,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:17:03,683 INFO L93 Difference]: Finished difference Result 168606 states and 697152 transitions. [2019-12-18 18:17:03,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:17:03,684 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:17:03,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:17:04,309 INFO L225 Difference]: With dead ends: 168606 [2019-12-18 18:17:04,310 INFO L226 Difference]: Without dead ends: 168557 [2019-12-18 18:17:04,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:17:08,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168557 states. [2019-12-18 18:17:13,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168557 to 152629. [2019-12-18 18:17:13,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152629 states. [2019-12-18 18:17:13,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152629 states to 152629 states and 638547 transitions. [2019-12-18 18:17:13,632 INFO L78 Accepts]: Start accepts. Automaton has 152629 states and 638547 transitions. Word has length 11 [2019-12-18 18:17:13,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:17:13,632 INFO L462 AbstractCegarLoop]: Abstraction has 152629 states and 638547 transitions. [2019-12-18 18:17:13,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:17:13,632 INFO L276 IsEmpty]: Start isEmpty. Operand 152629 states and 638547 transitions. [2019-12-18 18:17:13,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:17:13,639 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:17:13,639 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:17:13,639 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:17:13,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:17:13,640 INFO L82 PathProgramCache]: Analyzing trace with hash 2027270657, now seen corresponding path program 1 times [2019-12-18 18:17:13,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:17:13,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502833080] [2019-12-18 18:17:13,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:17:13,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:17:13,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:17:13,735 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502833080] [2019-12-18 18:17:13,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:17:13,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:17:13,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084055802] [2019-12-18 18:17:13,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:17:13,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:17:13,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:17:13,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:17:13,737 INFO L87 Difference]: Start difference. First operand 152629 states and 638547 transitions. Second operand 4 states. [2019-12-18 18:17:20,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:17:20,483 INFO L93 Difference]: Finished difference Result 217678 states and 889823 transitions. [2019-12-18 18:17:20,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:17:20,489 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:17:20,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:17:21,259 INFO L225 Difference]: With dead ends: 217678 [2019-12-18 18:17:21,260 INFO L226 Difference]: Without dead ends: 217615 [2019-12-18 18:17:21,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:17:26,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217615 states. [2019-12-18 18:17:33,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217615 to 183279. [2019-12-18 18:17:33,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183279 states. [2019-12-18 18:17:34,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183279 states to 183279 states and 761454 transitions. [2019-12-18 18:17:34,024 INFO L78 Accepts]: Start accepts. Automaton has 183279 states and 761454 transitions. Word has length 13 [2019-12-18 18:17:34,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:17:34,026 INFO L462 AbstractCegarLoop]: Abstraction has 183279 states and 761454 transitions. [2019-12-18 18:17:34,026 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:17:34,026 INFO L276 IsEmpty]: Start isEmpty. Operand 183279 states and 761454 transitions. [2019-12-18 18:17:34,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:17:34,031 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:17:34,031 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:17:34,031 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:17:34,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:17:34,032 INFO L82 PathProgramCache]: Analyzing trace with hash 1789207667, now seen corresponding path program 1 times [2019-12-18 18:17:34,032 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:17:34,032 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91139262] [2019-12-18 18:17:34,032 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:17:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:17:34,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:17:34,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91139262] [2019-12-18 18:17:34,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:17:34,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:17:34,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444129064] [2019-12-18 18:17:34,089 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:17:34,089 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:17:34,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:17:34,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:17:34,090 INFO L87 Difference]: Start difference. First operand 183279 states and 761454 transitions. Second operand 3 states. [2019-12-18 18:17:34,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:17:34,227 INFO L93 Difference]: Finished difference Result 36985 states and 120640 transitions. [2019-12-18 18:17:34,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:17:34,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 18:17:34,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:17:34,298 INFO L225 Difference]: With dead ends: 36985 [2019-12-18 18:17:34,298 INFO L226 Difference]: Without dead ends: 36985 [2019-12-18 18:17:34,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:17:35,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36985 states. [2019-12-18 18:17:36,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36985 to 36985. [2019-12-18 18:17:36,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36985 states. [2019-12-18 18:17:36,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36985 states to 36985 states and 120640 transitions. [2019-12-18 18:17:36,182 INFO L78 Accepts]: Start accepts. Automaton has 36985 states and 120640 transitions. Word has length 13 [2019-12-18 18:17:36,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:17:36,183 INFO L462 AbstractCegarLoop]: Abstraction has 36985 states and 120640 transitions. [2019-12-18 18:17:36,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:17:36,183 INFO L276 IsEmpty]: Start isEmpty. Operand 36985 states and 120640 transitions. [2019-12-18 18:17:36,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 18:17:36,186 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:17:36,186 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 18:17:36,186 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:17:36,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:17:36,187 INFO L82 PathProgramCache]: Analyzing trace with hash 1405830784, now seen corresponding path program 1 times [2019-12-18 18:17:36,187 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:17:36,187 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887381371] [2019-12-18 18:17:36,187 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:17:36,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:17:36,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:17:36,338 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887381371] [2019-12-18 18:17:36,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:17:36,339 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:17:36,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158076378] [2019-12-18 18:17:36,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:17:36,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:17:36,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:17:36,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:17:36,342 INFO L87 Difference]: Start difference. First operand 36985 states and 120640 transitions. Second operand 5 states. [2019-12-18 18:17:37,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:17:37,165 INFO L93 Difference]: Finished difference Result 50257 states and 160609 transitions. [2019-12-18 18:17:37,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:17:37,166 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 18:17:37,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:17:37,248 INFO L225 Difference]: With dead ends: 50257 [2019-12-18 18:17:37,248 INFO L226 Difference]: Without dead ends: 50244 [2019-12-18 18:17:37,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:17:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50244 states. [2019-12-18 18:17:37,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50244 to 37328. [2019-12-18 18:17:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37328 states. [2019-12-18 18:17:37,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37328 states to 37328 states and 121606 transitions. [2019-12-18 18:17:37,948 INFO L78 Accepts]: Start accepts. Automaton has 37328 states and 121606 transitions. Word has length 19 [2019-12-18 18:17:37,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:17:37,949 INFO L462 AbstractCegarLoop]: Abstraction has 37328 states and 121606 transitions. [2019-12-18 18:17:37,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:17:37,949 INFO L276 IsEmpty]: Start isEmpty. Operand 37328 states and 121606 transitions. [2019-12-18 18:17:37,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:17:37,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:17:37,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:17:37,960 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:17:37,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:17:37,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1721998258, now seen corresponding path program 1 times [2019-12-18 18:17:37,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:17:37,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964498048] [2019-12-18 18:17:37,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:17:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:17:38,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:17:38,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964498048] [2019-12-18 18:17:38,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:17:38,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:17:38,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142233062] [2019-12-18 18:17:38,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:17:38,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:17:38,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:17:38,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:17:38,031 INFO L87 Difference]: Start difference. First operand 37328 states and 121606 transitions. Second operand 4 states. [2019-12-18 18:17:40,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:17:40,165 INFO L93 Difference]: Finished difference Result 7104 states and 19431 transitions. [2019-12-18 18:17:40,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:17:40,166 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:17:40,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:17:40,178 INFO L225 Difference]: With dead ends: 7104 [2019-12-18 18:17:40,178 INFO L226 Difference]: Without dead ends: 7104 [2019-12-18 18:17:40,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:17:40,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-18 18:17:40,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 6992. [2019-12-18 18:17:40,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2019-12-18 18:17:40,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 19111 transitions. [2019-12-18 18:17:40,265 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 19111 transitions. Word has length 25 [2019-12-18 18:17:40,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:17:40,266 INFO L462 AbstractCegarLoop]: Abstraction has 6992 states and 19111 transitions. [2019-12-18 18:17:40,266 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:17:40,266 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 19111 transitions. [2019-12-18 18:17:40,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 18:17:40,277 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:17:40,277 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] [2019-12-18 18:17:40,277 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:17:40,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:17:40,278 INFO L82 PathProgramCache]: Analyzing trace with hash 2138974623, now seen corresponding path program 1 times [2019-12-18 18:17:40,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:17:40,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637278754] [2019-12-18 18:17:40,278 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:17:40,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:17:40,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:17:40,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637278754] [2019-12-18 18:17:40,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:17:40,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:17:40,380 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260833547] [2019-12-18 18:17:40,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:17:40,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:17:40,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:17:40,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:17:40,381 INFO L87 Difference]: Start difference. First operand 6992 states and 19111 transitions. Second operand 5 states. [2019-12-18 18:17:40,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:17:40,420 INFO L93 Difference]: Finished difference Result 5024 states and 14421 transitions. [2019-12-18 18:17:40,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:17:40,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 18:17:40,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:17:40,429 INFO L225 Difference]: With dead ends: 5024 [2019-12-18 18:17:40,429 INFO L226 Difference]: Without dead ends: 5024 [2019-12-18 18:17:40,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:17:40,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2019-12-18 18:17:40,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 4660. [2019-12-18 18:17:40,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-18 18:17:40,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 13437 transitions. [2019-12-18 18:17:40,526 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 13437 transitions. Word has length 37 [2019-12-18 18:17:40,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:17:40,527 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 13437 transitions. [2019-12-18 18:17:40,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:17:40,527 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 13437 transitions. [2019-12-18 18:17:40,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:17:40,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:17:40,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:17:40,537 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:17:40,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:17:40,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1030638940, now seen corresponding path program 1 times [2019-12-18 18:17:40,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:17:40,538 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112437603] [2019-12-18 18:17:40,538 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:17:40,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:17:40,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:17:40,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112437603] [2019-12-18 18:17:40,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:17:40,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:17:40,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729164760] [2019-12-18 18:17:40,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:17:40,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:17:40,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:17:40,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:17:40,613 INFO L87 Difference]: Start difference. First operand 4660 states and 13437 transitions. Second operand 3 states. [2019-12-18 18:17:40,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:17:40,674 INFO L93 Difference]: Finished difference Result 4669 states and 13450 transitions. [2019-12-18 18:17:40,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:17:40,674 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:17:40,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:17:40,682 INFO L225 Difference]: With dead ends: 4669 [2019-12-18 18:17:40,682 INFO L226 Difference]: Without dead ends: 4669 [2019-12-18 18:17:40,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:17:40,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-18 18:17:40,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-18 18:17:40,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-18 18:17:40,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13446 transitions. [2019-12-18 18:17:40,771 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13446 transitions. Word has length 65 [2019-12-18 18:17:40,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:17:40,772 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13446 transitions. [2019-12-18 18:17:40,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:17:40,772 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13446 transitions. [2019-12-18 18:17:40,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:17:40,781 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:17:40,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:17:40,782 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:17:40,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:17:40,782 INFO L82 PathProgramCache]: Analyzing trace with hash 1902070617, now seen corresponding path program 1 times [2019-12-18 18:17:40,782 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:17:40,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567942661] [2019-12-18 18:17:40,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:17:40,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:17:40,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:17:40,848 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567942661] [2019-12-18 18:17:40,848 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:17:40,848 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:17:40,848 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925307555] [2019-12-18 18:17:40,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:17:40,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:17:40,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:17:40,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:17:40,849 INFO L87 Difference]: Start difference. First operand 4665 states and 13446 transitions. Second operand 3 states. [2019-12-18 18:17:40,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:17:40,902 INFO L93 Difference]: Finished difference Result 4669 states and 13441 transitions. [2019-12-18 18:17:40,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:17:40,903 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:17:40,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:17:40,910 INFO L225 Difference]: With dead ends: 4669 [2019-12-18 18:17:40,911 INFO L226 Difference]: Without dead ends: 4669 [2019-12-18 18:17:40,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:17:40,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-18 18:17:40,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-18 18:17:40,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-18 18:17:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13437 transitions. [2019-12-18 18:17:41,001 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13437 transitions. Word has length 65 [2019-12-18 18:17:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:17:41,002 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13437 transitions. [2019-12-18 18:17:41,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:17:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13437 transitions. [2019-12-18 18:17:41,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:17:41,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:17:41,012 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:17:41,012 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:17:41,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:17:41,012 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358751, now seen corresponding path program 1 times [2019-12-18 18:17:41,012 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:17:41,013 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354231837] [2019-12-18 18:17:41,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:17:41,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:17:41,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:17:41,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354231837] [2019-12-18 18:17:41,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:17:41,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:17:41,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575990316] [2019-12-18 18:17:41,123 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:17:41,123 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:17:41,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:17:41,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:17:41,124 INFO L87 Difference]: Start difference. First operand 4665 states and 13437 transitions. Second operand 3 states. [2019-12-18 18:17:41,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:17:41,159 INFO L93 Difference]: Finished difference Result 4413 states and 12532 transitions. [2019-12-18 18:17:41,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:17:41,160 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:17:41,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:17:41,167 INFO L225 Difference]: With dead ends: 4413 [2019-12-18 18:17:41,167 INFO L226 Difference]: Without dead ends: 4413 [2019-12-18 18:17:41,168 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 18:17:41,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2019-12-18 18:17:41,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 4413. [2019-12-18 18:17:41,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4413 states. [2019-12-18 18:17:41,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4413 states to 4413 states and 12532 transitions. [2019-12-18 18:17:41,249 INFO L78 Accepts]: Start accepts. Automaton has 4413 states and 12532 transitions. Word has length 65 [2019-12-18 18:17:41,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:17:41,249 INFO L462 AbstractCegarLoop]: Abstraction has 4413 states and 12532 transitions. [2019-12-18 18:17:41,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:17:41,250 INFO L276 IsEmpty]: Start isEmpty. Operand 4413 states and 12532 transitions. [2019-12-18 18:17:41,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:17:41,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:17:41,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:17:41,258 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:17:41,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:17:41,258 INFO L82 PathProgramCache]: Analyzing trace with hash 981685475, now seen corresponding path program 1 times [2019-12-18 18:17:41,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:17:41,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389957536] [2019-12-18 18:17:41,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:17:41,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:17:41,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:17:41,398 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389957536] [2019-12-18 18:17:41,398 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:17:41,398 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:17:41,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667383647] [2019-12-18 18:17:41,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:17:41,400 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:17:41,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:17:41,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:17:41,400 INFO L87 Difference]: Start difference. First operand 4413 states and 12532 transitions. Second operand 3 states. [2019-12-18 18:17:41,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:17:41,425 INFO L93 Difference]: Finished difference Result 4413 states and 12340 transitions. [2019-12-18 18:17:41,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:17:41,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 18:17:41,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:17:41,432 INFO L225 Difference]: With dead ends: 4413 [2019-12-18 18:17:41,433 INFO L226 Difference]: Without dead ends: 4413 [2019-12-18 18:17:41,433 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 18:17:41,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4413 states. [2019-12-18 18:17:41,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4413 to 4413. [2019-12-18 18:17:41,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4413 states. [2019-12-18 18:17:41,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4413 states to 4413 states and 12340 transitions. [2019-12-18 18:17:41,516 INFO L78 Accepts]: Start accepts. Automaton has 4413 states and 12340 transitions. Word has length 66 [2019-12-18 18:17:41,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:17:41,516 INFO L462 AbstractCegarLoop]: Abstraction has 4413 states and 12340 transitions. [2019-12-18 18:17:41,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:17:41,516 INFO L276 IsEmpty]: Start isEmpty. Operand 4413 states and 12340 transitions. [2019-12-18 18:17:41,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:17:41,526 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:17:41,526 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:17:41,526 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:17:41,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:17:41,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1724172683, now seen corresponding path program 1 times [2019-12-18 18:17:41,527 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:17:41,528 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834915503] [2019-12-18 18:17:41,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:17:41,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:17:41,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:17:41,629 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834915503] [2019-12-18 18:17:41,629 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:17:41,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:17:41,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412430268] [2019-12-18 18:17:41,630 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:17:41,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:17:41,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:17:41,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:17:41,631 INFO L87 Difference]: Start difference. First operand 4413 states and 12340 transitions. Second operand 5 states. [2019-12-18 18:17:41,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:17:41,920 INFO L93 Difference]: Finished difference Result 6679 states and 18593 transitions. [2019-12-18 18:17:41,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:17:41,920 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-12-18 18:17:41,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:17:41,929 INFO L225 Difference]: With dead ends: 6679 [2019-12-18 18:17:41,929 INFO L226 Difference]: Without dead ends: 6679 [2019-12-18 18:17:41,929 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 18:17:41,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6679 states. [2019-12-18 18:17:41,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6679 to 5169. [2019-12-18 18:17:41,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5169 states. [2019-12-18 18:17:42,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5169 states to 5169 states and 14506 transitions. [2019-12-18 18:17:42,003 INFO L78 Accepts]: Start accepts. Automaton has 5169 states and 14506 transitions. Word has length 67 [2019-12-18 18:17:42,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:17:42,003 INFO L462 AbstractCegarLoop]: Abstraction has 5169 states and 14506 transitions. [2019-12-18 18:17:42,003 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:17:42,003 INFO L276 IsEmpty]: Start isEmpty. Operand 5169 states and 14506 transitions. [2019-12-18 18:17:42,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:17:42,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:17:42,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:17:42,011 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:17:42,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:17:42,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1093155317, now seen corresponding path program 2 times [2019-12-18 18:17:42,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:17:42,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602457152] [2019-12-18 18:17:42,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:17:42,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:17:42,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:17:42,119 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602457152] [2019-12-18 18:17:42,119 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:17:42,119 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:17:42,119 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680886987] [2019-12-18 18:17:42,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:17:42,120 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:17:42,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:17:42,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:17:42,121 INFO L87 Difference]: Start difference. First operand 5169 states and 14506 transitions. Second operand 3 states. [2019-12-18 18:17:42,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:17:42,192 INFO L93 Difference]: Finished difference Result 5169 states and 14505 transitions. [2019-12-18 18:17:42,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:17:42,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 18:17:42,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:17:42,200 INFO L225 Difference]: With dead ends: 5169 [2019-12-18 18:17:42,200 INFO L226 Difference]: Without dead ends: 5169 [2019-12-18 18:17:42,200 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 18:17:42,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5169 states. [2019-12-18 18:17:42,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5169 to 2988. [2019-12-18 18:17:42,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2988 states. [2019-12-18 18:17:42,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2988 states to 2988 states and 8451 transitions. [2019-12-18 18:17:42,255 INFO L78 Accepts]: Start accepts. Automaton has 2988 states and 8451 transitions. Word has length 67 [2019-12-18 18:17:42,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:17:42,255 INFO L462 AbstractCegarLoop]: Abstraction has 2988 states and 8451 transitions. [2019-12-18 18:17:42,255 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:17:42,255 INFO L276 IsEmpty]: Start isEmpty. Operand 2988 states and 8451 transitions. [2019-12-18 18:17:42,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:17:42,259 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:17:42,260 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:17:42,260 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:17:42,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:17:42,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1652885238, now seen corresponding path program 1 times [2019-12-18 18:17:42,260 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:17:42,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409099943] [2019-12-18 18:17:42,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:17:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:17:42,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:17:42,386 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409099943] [2019-12-18 18:17:42,386 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:17:42,386 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:17:42,387 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305825499] [2019-12-18 18:17:42,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:17:42,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:17:42,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:17:42,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:17:42,388 INFO L87 Difference]: Start difference. First operand 2988 states and 8451 transitions. Second operand 6 states. [2019-12-18 18:17:42,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:17:42,506 INFO L93 Difference]: Finished difference Result 5343 states and 15110 transitions. [2019-12-18 18:17:42,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:17:42,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-18 18:17:42,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:17:42,513 INFO L225 Difference]: With dead ends: 5343 [2019-12-18 18:17:42,513 INFO L226 Difference]: Without dead ends: 2843 [2019-12-18 18:17:42,515 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 18:17:42,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2843 states. [2019-12-18 18:17:42,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2843 to 2447. [2019-12-18 18:17:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2447 states. [2019-12-18 18:17:42,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2447 states to 2447 states and 6867 transitions. [2019-12-18 18:17:42,586 INFO L78 Accepts]: Start accepts. Automaton has 2447 states and 6867 transitions. Word has length 68 [2019-12-18 18:17:42,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:17:42,587 INFO L462 AbstractCegarLoop]: Abstraction has 2447 states and 6867 transitions. [2019-12-18 18:17:42,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:17:42,587 INFO L276 IsEmpty]: Start isEmpty. Operand 2447 states and 6867 transitions. [2019-12-18 18:17:42,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:17:42,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:17:42,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:17:42,594 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:17:42,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:17:42,595 INFO L82 PathProgramCache]: Analyzing trace with hash 942277324, now seen corresponding path program 2 times [2019-12-18 18:17:42,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:17:42,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296035283] [2019-12-18 18:17:42,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:17:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:17:42,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:17:42,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296035283] [2019-12-18 18:17:42,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:17:42,751 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:17:42,751 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311421294] [2019-12-18 18:17:42,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 18:17:42,752 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:17:42,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 18:17:42,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:17:42,753 INFO L87 Difference]: Start difference. First operand 2447 states and 6867 transitions. Second operand 6 states. [2019-12-18 18:17:42,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:17:42,825 INFO L93 Difference]: Finished difference Result 4471 states and 12562 transitions. [2019-12-18 18:17:42,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:17:42,826 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-18 18:17:42,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:17:42,830 INFO L225 Difference]: With dead ends: 4471 [2019-12-18 18:17:42,830 INFO L226 Difference]: Without dead ends: 2200 [2019-12-18 18:17:42,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:17:42,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2200 states. [2019-12-18 18:17:42,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2200 to 2200. [2019-12-18 18:17:42,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2019-12-18 18:17:42,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 6194 transitions. [2019-12-18 18:17:42,878 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 6194 transitions. Word has length 68 [2019-12-18 18:17:42,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:17:42,879 INFO L462 AbstractCegarLoop]: Abstraction has 2200 states and 6194 transitions. [2019-12-18 18:17:42,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 18:17:42,879 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 6194 transitions. [2019-12-18 18:17:42,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:17:42,884 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:17:42,884 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:17:42,884 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:17:42,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:17:42,886 INFO L82 PathProgramCache]: Analyzing trace with hash -1259160564, now seen corresponding path program 3 times [2019-12-18 18:17:42,886 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:17:42,886 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387344108] [2019-12-18 18:17:42,886 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:17:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:17:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:17:43,071 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:17:43,072 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:17:43,076 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~x~0_194) (= 0 v_~x$r_buff0_thd2~0_213) (= 0 v_~weak$$choice0~0_14) (= v_~x$mem_tmp~0_19 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1807~0.base_20|) (= 0 v_~x$w_buff0~0_268) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1807~0.base_20| 4) |v_#length_25|) (= 0 |v_ULTIMATE.start_main_~#t1807~0.offset_17|) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1807~0.base_20|)) (= 0 v_~x$r_buff1_thd2~0_212) (= v_~x$r_buff1_thd0~0_297 0) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1807~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1807~0.base_20|) |v_ULTIMATE.start_main_~#t1807~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~x$read_delayed_var~0.base_7) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1807~0.base_20| 1)) (= v_~x$r_buff1_thd1~0_187 0) (= v_~x$r_buff0_thd0~0_372 0) (= v_~y~0_143 0) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_155 0) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_4|) (= 0 v_~__unbuffered_p0_EAX~0_24) (= 0 v_~x$r_buff1_thd3~0_195) (= 0 v_~x$r_buff0_thd3~0_123) (= |v_#NULL.offset_4| 0) (= 0 v_~x$w_buff1_used~0_504) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~__unbuffered_p2_EAX~0_22) (= v_~x$flush_delayed~0_34 0) (= v_~main$tmp_guard0~0_24 0) (= v_~weak$$choice2~0_110 0) (= 0 v_~x$w_buff0_used~0_807) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_268, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_34, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_45|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_123, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_50|, ULTIMATE.start_main_~#t1808~0.offset=|v_ULTIMATE.start_main_~#t1808~0.offset_17|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_372, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_37|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_212, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_48|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~x~0=v_~x~0_194, ULTIMATE.start_main_~#t1807~0.offset=|v_ULTIMATE.start_main_~#t1807~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_195, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_125|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_~#t1809~0.base=|v_ULTIMATE.start_main_~#t1809~0.base_20|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ULTIMATE.start_main_~#t1809~0.offset=|v_ULTIMATE.start_main_~#t1809~0.offset_16|, ~y~0=v_~y~0_143, ULTIMATE.start_main_~#t1808~0.base=|v_ULTIMATE.start_main_~#t1808~0.base_21|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_48|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_213, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_807, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_110, ULTIMATE.start_main_~#t1807~0.base=|v_ULTIMATE.start_main_~#t1807~0.base_20|, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t1808~0.offset, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1807~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1809~0.base, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1809~0.offset, ~y~0, ULTIMATE.start_main_~#t1808~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~weak$$choice2~0, ULTIMATE.start_main_~#t1807~0.base, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 18:17:43,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L805-1-->L807: Formula: (and (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1808~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1808~0.base_11| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1808~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1808~0.base_11|) |v_ULTIMATE.start_main_~#t1808~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1808~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1808~0.offset_10|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1808~0.base_11|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1808~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1808~0.base=|v_ULTIMATE.start_main_~#t1808~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1808~0.offset=|v_ULTIMATE.start_main_~#t1808~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1808~0.base, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1808~0.offset] because there is no mapped edge [2019-12-18 18:17:43,077 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= |v_ULTIMATE.start_main_~#t1809~0.offset_8| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1809~0.base_9|) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1809~0.base_9|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1809~0.base_9|)) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1809~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1809~0.base_9|) |v_ULTIMATE.start_main_~#t1809~0.offset_8| 2))) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1809~0.base_9| 4)) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1809~0.base_9| 1) |v_#valid_27|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, ULTIMATE.start_main_~#t1809~0.offset=|v_ULTIMATE.start_main_~#t1809~0.offset_8|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1809~0.base=|v_ULTIMATE.start_main_~#t1809~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t1809~0.offset, #length, ULTIMATE.start_main_~#t1809~0.base] because there is no mapped edge [2019-12-18 18:17:43,078 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_11| v_P1Thread1of1ForFork1_~arg.offset_11) (= 1 v_~x$w_buff0_used~0_98) (= 2 v_~x$w_buff0~0_31) (= v_P1Thread1of1ForFork1_~arg.base_11 |v_P1Thread1of1ForFork1_#in~arg.base_11|) (= v_~x$w_buff1_used~0_55 v_~x$w_buff0_used~0_99) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 0 (mod v_~x$w_buff1_used~0_55 256)) (= v_~x$w_buff0~0_32 v_~x$w_buff1~0_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13, ~x$w_buff0~0=v_~x$w_buff0~0_31, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_11, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_11, ~x$w_buff1~0=v_~x$w_buff1~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 18:17:43,081 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd3~0_In991208051 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In991208051 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out991208051| ~x$w_buff1~0_In991208051) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork2_#t~ite15_Out991208051| ~x~0_In991208051)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In991208051, ~x$w_buff1_used~0=~x$w_buff1_used~0_In991208051, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In991208051, ~x~0=~x~0_In991208051} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out991208051|, ~x$w_buff1~0=~x$w_buff1~0_In991208051, ~x$w_buff1_used~0=~x$w_buff1_used~0_In991208051, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In991208051, ~x~0=~x~0_In991208051} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 18:17:43,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= v_~x~0_20 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 18:17:43,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-985055119 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In-985055119 256)))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite17_Out-985055119| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-985055119 |P2Thread1of1ForFork2_#t~ite17_Out-985055119|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-985055119, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-985055119} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-985055119, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out-985055119|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-985055119} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 18:17:43,082 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1082382557 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd3~0_In-1082382557 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In-1082382557 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In-1082382557 256) 0))) (or (and (= ~x$w_buff1_used~0_In-1082382557 |P2Thread1of1ForFork2_#t~ite18_Out-1082382557|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P2Thread1of1ForFork2_#t~ite18_Out-1082382557| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1082382557, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1082382557, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1082382557, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1082382557} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1082382557, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1082382557, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1082382557, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1082382557|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1082382557} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 18:17:43,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-1077590076 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-1077590076| |P0Thread1of1ForFork0_#t~ite3_Out-1077590076|)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1077590076 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite3_Out-1077590076| ~x~0_In-1077590076) .cse2) (and (= ~x$w_buff1~0_In-1077590076 |P0Thread1of1ForFork0_#t~ite3_Out-1077590076|) (not .cse1) .cse2 (not .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1077590076, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1077590076, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1077590076, ~x~0=~x~0_In-1077590076} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1077590076|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1077590076|, ~x$w_buff1~0=~x$w_buff1~0_In-1077590076, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1077590076, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1077590076, ~x~0=~x~0_In-1077590076} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 18:17:43,083 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1114933727 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-1114933727 256) 0))) (or (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1114933727| 0)) (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-1114933727| ~x$w_buff0_used~0_In-1114933727)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1114933727, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1114933727} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1114933727|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1114933727, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1114933727} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:17:43,084 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-358462319 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-358462319 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd1~0_In-358462319 256) 0)) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-358462319 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In-358462319 |P0Thread1of1ForFork0_#t~ite6_Out-358462319|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-358462319| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-358462319, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-358462319, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-358462319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-358462319} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-358462319|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-358462319, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-358462319, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-358462319, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-358462319} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:17:43,085 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In1382014948 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In1382014948 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite19_Out1382014948|)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out1382014948| ~x$r_buff0_thd3~0_In1382014948)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1382014948, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1382014948} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1382014948, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out1382014948|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1382014948} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 18:17:43,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1054464021 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1054464021 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In-1054464021 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In-1054464021 256)))) (or (and (= |P2Thread1of1ForFork2_#t~ite20_Out-1054464021| ~x$r_buff1_thd3~0_In-1054464021) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out-1054464021|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1054464021, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1054464021, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1054464021, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1054464021} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out-1054464021|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1054464021, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1054464021, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1054464021, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1054464021} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 18:17:43,086 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P2Thread1of1ForFork2_#t~ite20_54| v_~x$r_buff1_thd3~0_147)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_53|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 18:17:43,087 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1125797554 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1125797554 256) 0))) (or (and (= ~x$r_buff0_thd1~0_In-1125797554 |P0Thread1of1ForFork0_#t~ite7_Out-1125797554|) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork0_#t~ite7_Out-1125797554| 0) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1125797554, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1125797554} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1125797554, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1125797554|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1125797554} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 18:17:43,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In1704152008 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1704152008 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In1704152008 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In1704152008 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out1704152008| ~x$r_buff1_thd1~0_In1704152008) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out1704152008| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1704152008, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1704152008, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1704152008, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1704152008} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1704152008, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1704152008|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1704152008, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1704152008, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1704152008} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:17:43,088 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L737-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_61 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_61} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 18:17:43,089 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In805080555 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In805080555 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out805080555| 0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out805080555| ~x$w_buff0_used~0_In805080555) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In805080555, ~x$w_buff0_used~0=~x$w_buff0_used~0_In805080555} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out805080555|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In805080555, ~x$w_buff0_used~0=~x$w_buff0_used~0_In805080555} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 18:17:43,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In206570320 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In206570320 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In206570320 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In206570320 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out206570320|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In206570320 |P1Thread1of1ForFork1_#t~ite12_Out206570320|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In206570320, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In206570320, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In206570320, ~x$w_buff0_used~0=~x$w_buff0_used~0_In206570320} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In206570320, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In206570320, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out206570320|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In206570320, ~x$w_buff0_used~0=~x$w_buff0_used~0_In206570320} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 18:17:43,090 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In964751841 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In964751841 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In964751841 ~x$r_buff0_thd2~0_Out964751841) (or .cse0 .cse1)) (and (= ~x$r_buff0_thd2~0_Out964751841 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In964751841, ~x$w_buff0_used~0=~x$w_buff0_used~0_In964751841} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out964751841|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out964751841, ~x$w_buff0_used~0=~x$w_buff0_used~0_In964751841} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 18:17:43,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse3 (= 0 (mod ~x$r_buff0_thd2~0_In-530544713 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-530544713 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In-530544713 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-530544713 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out-530544713| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out-530544713| ~x$r_buff1_thd2~0_In-530544713)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-530544713, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-530544713, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-530544713, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-530544713} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-530544713, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-530544713, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-530544713, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-530544713|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-530544713} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 18:17:43,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_162 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_162, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 18:17:43,091 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 18:17:43,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In1392111684 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1392111684 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite24_Out1392111684| |ULTIMATE.start_main_#t~ite25_Out1392111684|))) (or (and (or .cse0 .cse1) (= ~x~0_In1392111684 |ULTIMATE.start_main_#t~ite24_Out1392111684|) .cse2) (and (= |ULTIMATE.start_main_#t~ite24_Out1392111684| ~x$w_buff1~0_In1392111684) (not .cse1) (not .cse0) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1392111684, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1392111684, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1392111684, ~x~0=~x~0_In1392111684} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1392111684, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1392111684|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out1392111684|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1392111684, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1392111684, ~x~0=~x~0_In1392111684} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 18:17:43,092 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1545447095 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1545447095 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite26_Out1545447095| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In1545447095 |ULTIMATE.start_main_#t~ite26_Out1545447095|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1545447095, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1545447095} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1545447095, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out1545447095|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1545447095} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 18:17:43,093 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In1934228032 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1934228032 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In1934228032 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In1934228032 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite27_Out1934228032| 0)) (and (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite27_Out1934228032| ~x$w_buff1_used~0_In1934228032) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1934228032, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1934228032, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1934228032, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1934228032} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1934228032, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1934228032, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1934228032|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1934228032, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1934228032} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 18:17:43,094 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In892904267 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In892904267 256)))) (or (and (= ~x$r_buff0_thd0~0_In892904267 |ULTIMATE.start_main_#t~ite28_Out892904267|) (or .cse0 .cse1)) (and (= 0 |ULTIMATE.start_main_#t~ite28_Out892904267|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In892904267, ~x$w_buff0_used~0=~x$w_buff0_used~0_In892904267} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In892904267, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out892904267|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In892904267} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 18:17:43,095 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In-1027722506 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-1027722506 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1027722506 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In-1027722506 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite29_Out-1027722506|)) (and (= ~x$r_buff1_thd0~0_In-1027722506 |ULTIMATE.start_main_#t~ite29_Out-1027722506|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1027722506, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1027722506, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1027722506, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1027722506} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1027722506, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-1027722506|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1027722506, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1027722506, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1027722506} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 18:17:43,102 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_112 v_~x$r_buff0_thd0~0_111) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 18:17:43,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L834-->L837-1: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_23 256) 0)) (= v_~x$mem_tmp~0_13 v_~x~0_153) (= v_~x$flush_delayed~0_22 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~x~0=v_~x~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:17:43,103 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 18:17:43,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:17:43 BasicIcfg [2019-12-18 18:17:43,249 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:17:43,251 INFO L168 Benchmark]: Toolchain (without parser) took 79555.59 ms. Allocated memory was 145.2 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.7 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 18:17:43,252 INFO L168 Benchmark]: CDTParser took 0.39 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 18:17:43,253 INFO L168 Benchmark]: CACSL2BoogieTranslator took 812.29 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 155.2 MB in the end (delta: -54.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:17:43,256 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.78 ms. Allocated memory is still 202.9 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:17:43,257 INFO L168 Benchmark]: Boogie Preprocessor took 36.27 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 149.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:17:43,257 INFO L168 Benchmark]: RCFGBuilder took 871.37 ms. Allocated memory is still 202.9 MB. Free memory was 149.8 MB in the beginning and 100.2 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:17:43,258 INFO L168 Benchmark]: TraceAbstraction took 77745.86 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 99.6 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. [2019-12-18 18:17:43,270 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.39 ms. Allocated memory is still 145.2 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 812.29 ms. Allocated memory was 145.2 MB in the beginning and 202.9 MB in the end (delta: 57.7 MB). Free memory was 100.3 MB in the beginning and 155.2 MB in the end (delta: -54.9 MB). Peak memory consumption was 20.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.78 ms. Allocated memory is still 202.9 MB. Free memory was 155.2 MB in the beginning and 152.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.27 ms. Allocated memory is still 202.9 MB. Free memory was 152.5 MB in the beginning and 149.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 871.37 ms. Allocated memory is still 202.9 MB. Free memory was 149.8 MB in the beginning and 100.2 MB in the end (delta: 49.6 MB). Peak memory consumption was 49.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 77745.86 ms. Allocated memory was 202.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 99.6 MB in the beginning and 2.5 GB in the end (delta: -2.4 GB). Peak memory consumption was 1.2 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.2s, 174 ProgramPointsBefore, 94 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 6159 VarBasedMoverChecksPositive, 253 VarBasedMoverChecksNegative, 78 SemBasedMoverChecksPositive, 250 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 78277 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1807, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L807] FCALL, FORK 0 pthread_create(&t1808, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] FCALL, FORK 0 pthread_create(&t1809, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L727] 1 __unbuffered_p0_EAX = y [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 77.3s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 21.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2022 SDtfs, 1436 SDslu, 2691 SDs, 0 SdLazy, 1229 SolverSat, 81 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 18 SyntacticMatches, 9 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183279occurred 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: 31.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 67751 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 722 NumberOfCodeBlocks, 722 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 639 ConstructedInterpolants, 0 QuantifiedInterpolants, 136373 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...