/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:13:00,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:13:00,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:13:00,492 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:13:00,492 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:13:00,494 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:13:00,497 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:13:00,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:13:00,508 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:13:00,509 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:13:00,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:13:00,514 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:13:00,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:13:00,516 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:13:00,519 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:13:00,520 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:13:00,521 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:13:00,522 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:13:00,523 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:13:00,525 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:13:00,527 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:13:00,528 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:13:00,529 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:13:00,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:13:00,531 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:13:00,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:13:00,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:13:00,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:13:00,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:13:00,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:13:00,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:13:00,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:13:00,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:13:00,536 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:13:00,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:13:00,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:13:00,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:13:00,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:13:00,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:13:00,540 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:13:00,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:13:00,541 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-MCR.epf [2019-12-27 18:13:00,555 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:13:00,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:13:00,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:13:00,557 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:13:00,557 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:13:00,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:13:00,557 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:13:00,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:13:00,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:13:00,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:13:00,558 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:13:00,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:13:00,558 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:13:00,558 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:13:00,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:13:00,559 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:13:00,559 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:13:00,559 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:13:00,559 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:13:00,560 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:13:00,560 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:13:00,560 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:13:00,560 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:13:00,560 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:13:00,561 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:13:00,561 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:13:00,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:13:00,561 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:13:00,561 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:13:00,562 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:13:00,562 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:13:00,857 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:13:00,875 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:13:00,880 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:13:00,881 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:13:00,881 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:13:00,883 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i [2019-12-27 18:13:00,950 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce45ec750/8f3ee9d0749943e69d186a4f90004ab9/FLAG71a9d31b7 [2019-12-27 18:13:01,434 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:13:01,435 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_pso.opt.i [2019-12-27 18:13:01,450 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce45ec750/8f3ee9d0749943e69d186a4f90004ab9/FLAG71a9d31b7 [2019-12-27 18:13:01,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce45ec750/8f3ee9d0749943e69d186a4f90004ab9 [2019-12-27 18:13:01,730 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:13:01,732 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:13:01,733 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:13:01,733 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:13:01,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:13:01,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:13:01" (1/1) ... [2019-12-27 18:13:01,741 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cc96705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:01, skipping insertion in model container [2019-12-27 18:13:01,741 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:13:01" (1/1) ... [2019-12-27 18:13:01,749 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:13:01,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:13:02,372 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:13:02,385 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:13:02,495 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:13:02,575 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:13:02,575 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:02 WrapperNode [2019-12-27 18:13:02,575 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:13:02,576 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:13:02,576 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:13:02,577 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:13:02,586 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:02" (1/1) ... [2019-12-27 18:13:02,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:02" (1/1) ... [2019-12-27 18:13:02,647 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:13:02,647 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:13:02,647 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:13:02,647 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:13:02,658 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:02" (1/1) ... [2019-12-27 18:13:02,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:02" (1/1) ... [2019-12-27 18:13:02,663 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:02" (1/1) ... [2019-12-27 18:13:02,664 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:02" (1/1) ... [2019-12-27 18:13:02,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:02" (1/1) ... [2019-12-27 18:13:02,687 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:02" (1/1) ... [2019-12-27 18:13:02,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:02" (1/1) ... [2019-12-27 18:13:02,700 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:13:02,701 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:13:02,701 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:13:02,701 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:13:02,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:13:02,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:13:02,777 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:13:02,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:13:02,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:13:02,778 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:13:02,778 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:13:02,779 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:13:02,779 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:13:02,780 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:13:02,780 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:13:02,780 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:13:02,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:13:02,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:13:02,783 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 18:13:03,766 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:13:03,766 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:13:03,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:13:03 BoogieIcfgContainer [2019-12-27 18:13:03,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:13:03,769 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:13:03,769 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:13:03,773 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:13:03,773 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:13:01" (1/3) ... [2019-12-27 18:13:03,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c1209e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:13:03, skipping insertion in model container [2019-12-27 18:13:03,774 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:13:02" (2/3) ... [2019-12-27 18:13:03,774 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69c1209e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:13:03, skipping insertion in model container [2019-12-27 18:13:03,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:13:03" (3/3) ... [2019-12-27 18:13:03,777 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_pso.opt.i [2019-12-27 18:13:03,787 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:13:03,787 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:13:03,795 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:13:03,796 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:13:03,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,836 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,836 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,837 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,837 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,838 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,839 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,840 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,841 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,842 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,843 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,844 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,845 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,846 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,846 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,846 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,846 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,864 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,865 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,866 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,867 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,872 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,872 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,882 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,883 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,883 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,884 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,886 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,887 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,887 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,887 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,888 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,889 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,891 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,891 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,892 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,892 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,893 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:13:03,908 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:13:03,928 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:13:03,929 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:13:03,929 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:13:03,929 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:13:03,929 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:13:03,929 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:13:03,929 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:13:03,929 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:13:03,946 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-27 18:13:03,948 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 18:13:04,055 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 18:13:04,056 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:13:04,074 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 332 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:13:04,100 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-27 18:13:04,156 INFO L132 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-27 18:13:04,156 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:13:04,163 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 332 event pairs. 0/159 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 18:13:04,183 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-27 18:13:04,184 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:13:09,216 WARN L192 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 18:13:09,343 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 18:13:09,379 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87419 [2019-12-27 18:13:09,379 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-27 18:13:09,383 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 106 transitions [2019-12-27 18:13:25,999 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 107408 states. [2019-12-27 18:13:26,000 INFO L276 IsEmpty]: Start isEmpty. Operand 107408 states. [2019-12-27 18:13:26,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:13:26,007 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:13:26,007 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:13:26,008 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-27 18:13:26,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:13:26,014 INFO L82 PathProgramCache]: Analyzing trace with hash 809706692, now seen corresponding path program 1 times [2019-12-27 18:13:26,025 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:13:26,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682543434] [2019-12-27 18:13:26,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:13:26,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:13:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:13:26,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682543434] [2019-12-27 18:13:26,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:13:26,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:13:26,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [732726208] [2019-12-27 18:13:26,304 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:13:26,308 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:13:26,321 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:13:26,322 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:13:26,325 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:13:26,326 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:13:26,326 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:13:26,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:13:26,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:13:26,342 INFO L87 Difference]: Start difference. First operand 107408 states. Second operand 3 states. [2019-12-27 18:13:27,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:13:27,753 INFO L93 Difference]: Finished difference Result 107108 states and 460900 transitions. [2019-12-27 18:13:27,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:13:27,755 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:13:27,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:13:28,455 INFO L225 Difference]: With dead ends: 107108 [2019-12-27 18:13:28,455 INFO L226 Difference]: Without dead ends: 104924 [2019-12-27 18:13:28,457 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:13:34,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104924 states. [2019-12-27 18:13:38,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104924 to 104924. [2019-12-27 18:13:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104924 states. [2019-12-27 18:13:38,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104924 states to 104924 states and 451982 transitions. [2019-12-27 18:13:38,634 INFO L78 Accepts]: Start accepts. Automaton has 104924 states and 451982 transitions. Word has length 5 [2019-12-27 18:13:38,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:13:38,634 INFO L462 AbstractCegarLoop]: Abstraction has 104924 states and 451982 transitions. [2019-12-27 18:13:38,634 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:13:38,634 INFO L276 IsEmpty]: Start isEmpty. Operand 104924 states and 451982 transitions. [2019-12-27 18:13:38,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 18:13:38,638 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:13:38,638 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:13:38,639 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-27 18:13:38,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:13:38,639 INFO L82 PathProgramCache]: Analyzing trace with hash 1056800905, now seen corresponding path program 1 times [2019-12-27 18:13:38,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:13:38,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045923675] [2019-12-27 18:13:38,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:13:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:13:38,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:13:38,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045923675] [2019-12-27 18:13:38,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:13:38,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:13:38,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1887164622] [2019-12-27 18:13:38,738 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:13:38,739 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:13:38,746 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 24 states and 35 transitions. [2019-12-27 18:13:38,747 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:13:38,797 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:13:38,799 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:13:38,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:13:38,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:13:38,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:13:38,800 INFO L87 Difference]: Start difference. First operand 104924 states and 451982 transitions. Second operand 5 states. [2019-12-27 18:13:44,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:13:44,031 INFO L93 Difference]: Finished difference Result 168606 states and 697152 transitions. [2019-12-27 18:13:44,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:13:44,031 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2019-12-27 18:13:44,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:13:45,269 INFO L225 Difference]: With dead ends: 168606 [2019-12-27 18:13:45,270 INFO L226 Difference]: Without dead ends: 168557 [2019-12-27 18:13:45,271 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:13:49,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168557 states. [2019-12-27 18:13:53,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168557 to 152629. [2019-12-27 18:13:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152629 states. [2019-12-27 18:13:54,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152629 states to 152629 states and 638547 transitions. [2019-12-27 18:13:54,494 INFO L78 Accepts]: Start accepts. Automaton has 152629 states and 638547 transitions. Word has length 11 [2019-12-27 18:13:54,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:13:54,495 INFO L462 AbstractCegarLoop]: Abstraction has 152629 states and 638547 transitions. [2019-12-27 18:13:54,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:13:54,495 INFO L276 IsEmpty]: Start isEmpty. Operand 152629 states and 638547 transitions. [2019-12-27 18:13:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:13:54,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:13:54,504 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:13:54,505 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-27 18:13:54,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:13:54,505 INFO L82 PathProgramCache]: Analyzing trace with hash 933289536, now seen corresponding path program 1 times [2019-12-27 18:13:54,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:13:54,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485433257] [2019-12-27 18:13:54,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:13:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:13:54,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:13:54,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485433257] [2019-12-27 18:13:54,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:13:54,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:13:54,608 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1054594034] [2019-12-27 18:13:54,608 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:13:54,609 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:13:54,611 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:13:54,611 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:13:54,611 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:13:54,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:13:54,612 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:13:54,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:13:54,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:13:54,613 INFO L87 Difference]: Start difference. First operand 152629 states and 638547 transitions. Second operand 4 states. [2019-12-27 18:14:01,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:01,172 INFO L93 Difference]: Finished difference Result 217678 states and 889823 transitions. [2019-12-27 18:14:01,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:14:01,172 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:14:01,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:01,773 INFO L225 Difference]: With dead ends: 217678 [2019-12-27 18:14:01,773 INFO L226 Difference]: Without dead ends: 217615 [2019-12-27 18:14:01,773 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-27 18:14:12,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217615 states. [2019-12-27 18:14:16,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217615 to 183279. [2019-12-27 18:14:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183279 states. [2019-12-27 18:14:17,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183279 states to 183279 states and 761454 transitions. [2019-12-27 18:14:17,249 INFO L78 Accepts]: Start accepts. Automaton has 183279 states and 761454 transitions. Word has length 13 [2019-12-27 18:14:17,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:17,251 INFO L462 AbstractCegarLoop]: Abstraction has 183279 states and 761454 transitions. [2019-12-27 18:14:17,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:14:17,251 INFO L276 IsEmpty]: Start isEmpty. Operand 183279 states and 761454 transitions. [2019-12-27 18:14:17,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:14:17,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:17,254 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:17,255 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-27 18:14:17,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:17,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1797085387, now seen corresponding path program 1 times [2019-12-27 18:14:17,256 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:17,256 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786027962] [2019-12-27 18:14:17,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:17,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:17,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:17,308 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786027962] [2019-12-27 18:14:17,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:17,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:14:17,309 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [474502618] [2019-12-27 18:14:17,309 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:17,310 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:17,311 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:14:17,311 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:17,312 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:17,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:17,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:17,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:17,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:17,313 INFO L87 Difference]: Start difference. First operand 183279 states and 761454 transitions. Second operand 3 states. [2019-12-27 18:14:17,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:17,447 INFO L93 Difference]: Finished difference Result 36985 states and 120640 transitions. [2019-12-27 18:14:17,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:17,448 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:14:17,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:17,503 INFO L225 Difference]: With dead ends: 36985 [2019-12-27 18:14:17,503 INFO L226 Difference]: Without dead ends: 36985 [2019-12-27 18:14:17,504 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:17,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36985 states. [2019-12-27 18:14:19,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36985 to 36985. [2019-12-27 18:14:19,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36985 states. [2019-12-27 18:14:19,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36985 states to 36985 states and 120640 transitions. [2019-12-27 18:14:19,341 INFO L78 Accepts]: Start accepts. Automaton has 36985 states and 120640 transitions. Word has length 13 [2019-12-27 18:14:19,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:19,342 INFO L462 AbstractCegarLoop]: Abstraction has 36985 states and 120640 transitions. [2019-12-27 18:14:19,342 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:19,342 INFO L276 IsEmpty]: Start isEmpty. Operand 36985 states and 120640 transitions. [2019-12-27 18:14:19,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 18:14:19,345 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:19,345 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-27 18:14:19,345 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-27 18:14:19,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:19,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1117796869, now seen corresponding path program 1 times [2019-12-27 18:14:19,346 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:19,346 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922127258] [2019-12-27 18:14:19,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:19,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:19,446 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922127258] [2019-12-27 18:14:19,447 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:19,447 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:14:19,447 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1747830987] [2019-12-27 18:14:19,447 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:19,449 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:19,454 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 57 transitions. [2019-12-27 18:14:19,454 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:19,468 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:14:19,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:14:19,468 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:19,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:14:19,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:14:19,469 INFO L87 Difference]: Start difference. First operand 36985 states and 120640 transitions. Second operand 6 states. [2019-12-27 18:14:20,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:20,502 INFO L93 Difference]: Finished difference Result 58249 states and 186844 transitions. [2019-12-27 18:14:20,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 18:14:20,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 19 [2019-12-27 18:14:20,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:20,591 INFO L225 Difference]: With dead ends: 58249 [2019-12-27 18:14:20,591 INFO L226 Difference]: Without dead ends: 58236 [2019-12-27 18:14:20,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:14:20,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58236 states. [2019-12-27 18:14:24,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58236 to 37328. [2019-12-27 18:14:24,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37328 states. [2019-12-27 18:14:24,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37328 states to 37328 states and 121606 transitions. [2019-12-27 18:14:24,209 INFO L78 Accepts]: Start accepts. Automaton has 37328 states and 121606 transitions. Word has length 19 [2019-12-27 18:14:24,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:24,210 INFO L462 AbstractCegarLoop]: Abstraction has 37328 states and 121606 transitions. [2019-12-27 18:14:24,210 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:14:24,210 INFO L276 IsEmpty]: Start isEmpty. Operand 37328 states and 121606 transitions. [2019-12-27 18:14:24,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:14:24,223 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:24,223 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:24,223 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-27 18:14:24,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:24,224 INFO L82 PathProgramCache]: Analyzing trace with hash 7812214, now seen corresponding path program 1 times [2019-12-27 18:14:24,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:24,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921622163] [2019-12-27 18:14:24,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:24,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:24,314 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921622163] [2019-12-27 18:14:24,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:24,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:14:24,315 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [700602381] [2019-12-27 18:14:24,315 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:24,319 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:24,332 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 121 transitions. [2019-12-27 18:14:24,332 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:24,388 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:14:24,389 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:14:24,389 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:24,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:14:24,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:14:24,390 INFO L87 Difference]: Start difference. First operand 37328 states and 121606 transitions. Second operand 6 states. [2019-12-27 18:14:24,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:24,440 INFO L93 Difference]: Finished difference Result 7104 states and 19431 transitions. [2019-12-27 18:14:24,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:14:24,441 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 18:14:24,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:24,452 INFO L225 Difference]: With dead ends: 7104 [2019-12-27 18:14:24,452 INFO L226 Difference]: Without dead ends: 7104 [2019-12-27 18:14:24,453 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:14:24,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-27 18:14:24,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 6992. [2019-12-27 18:14:24,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2019-12-27 18:14:24,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 19111 transitions. [2019-12-27 18:14:24,563 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 19111 transitions. Word has length 25 [2019-12-27 18:14:24,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:24,563 INFO L462 AbstractCegarLoop]: Abstraction has 6992 states and 19111 transitions. [2019-12-27 18:14:24,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:14:24,563 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 19111 transitions. [2019-12-27 18:14:24,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 18:14:24,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:24,575 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-27 18:14:24,575 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-27 18:14:24,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:24,575 INFO L82 PathProgramCache]: Analyzing trace with hash -1437682904, now seen corresponding path program 1 times [2019-12-27 18:14:24,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:24,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002048889] [2019-12-27 18:14:24,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:24,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:24,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:24,658 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002048889] [2019-12-27 18:14:24,658 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:24,658 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:14:24,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [772151777] [2019-12-27 18:14:24,658 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:24,667 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:24,696 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 71 states and 103 transitions. [2019-12-27 18:14:24,696 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:24,697 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:24,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:14:24,698 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:24,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:14:24,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:14:24,698 INFO L87 Difference]: Start difference. First operand 6992 states and 19111 transitions. Second operand 5 states. [2019-12-27 18:14:24,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:24,741 INFO L93 Difference]: Finished difference Result 5024 states and 14421 transitions. [2019-12-27 18:14:24,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:14:24,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-27 18:14:24,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:24,749 INFO L225 Difference]: With dead ends: 5024 [2019-12-27 18:14:24,750 INFO L226 Difference]: Without dead ends: 5024 [2019-12-27 18:14:24,750 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-27 18:14:24,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2019-12-27 18:14:24,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 4660. [2019-12-27 18:14:24,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-27 18:14:24,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 13437 transitions. [2019-12-27 18:14:24,848 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 13437 transitions. Word has length 37 [2019-12-27 18:14:24,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:24,848 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 13437 transitions. [2019-12-27 18:14:24,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:14:24,848 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 13437 transitions. [2019-12-27 18:14:24,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:24,858 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:24,858 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-27 18:14:24,858 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-27 18:14:24,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:24,859 INFO L82 PathProgramCache]: Analyzing trace with hash 2059462380, now seen corresponding path program 1 times [2019-12-27 18:14:24,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:24,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584476594] [2019-12-27 18:14:24,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:24,948 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584476594] [2019-12-27 18:14:24,948 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:24,948 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:14:24,948 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1528835926] [2019-12-27 18:14:24,949 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:24,974 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:25,125 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 291 transitions. [2019-12-27 18:14:25,126 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:25,128 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:25,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:25,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:25,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:25,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:25,130 INFO L87 Difference]: Start difference. First operand 4660 states and 13437 transitions. Second operand 3 states. [2019-12-27 18:14:25,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:25,190 INFO L93 Difference]: Finished difference Result 4669 states and 13450 transitions. [2019-12-27 18:14:25,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:25,191 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:14:25,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:25,202 INFO L225 Difference]: With dead ends: 4669 [2019-12-27 18:14:25,202 INFO L226 Difference]: Without dead ends: 4669 [2019-12-27 18:14:25,203 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-27 18:14:25,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-27 18:14:25,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-27 18:14:25,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13446 transitions. [2019-12-27 18:14:25,285 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13446 transitions. Word has length 65 [2019-12-27 18:14:25,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:25,286 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13446 transitions. [2019-12-27 18:14:25,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:25,286 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13446 transitions. [2019-12-27 18:14:25,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:25,293 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:25,293 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-27 18:14:25,293 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-27 18:14:25,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:25,293 INFO L82 PathProgramCache]: Analyzing trace with hash -151073877, now seen corresponding path program 1 times [2019-12-27 18:14:25,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:25,294 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062113672] [2019-12-27 18:14:25,294 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:25,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:25,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:25,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062113672] [2019-12-27 18:14:25,381 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:25,381 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:14:25,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [703288928] [2019-12-27 18:14:25,381 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:25,401 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:25,741 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 291 transitions. [2019-12-27 18:14:25,741 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:25,742 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:25,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:25,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:25,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:25,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:25,743 INFO L87 Difference]: Start difference. First operand 4665 states and 13446 transitions. Second operand 3 states. [2019-12-27 18:14:25,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:25,798 INFO L93 Difference]: Finished difference Result 4669 states and 13441 transitions. [2019-12-27 18:14:25,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:25,798 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:14:25,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:25,806 INFO L225 Difference]: With dead ends: 4669 [2019-12-27 18:14:25,806 INFO L226 Difference]: Without dead ends: 4669 [2019-12-27 18:14:25,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:25,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-27 18:14:25,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-27 18:14:25,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-27 18:14:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13437 transitions. [2019-12-27 18:14:25,874 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13437 transitions. Word has length 65 [2019-12-27 18:14:25,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:25,874 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13437 transitions. [2019-12-27 18:14:25,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:25,874 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13437 transitions. [2019-12-27 18:14:25,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:25,881 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:25,881 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-27 18:14:25,881 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-27 18:14:25,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:25,882 INFO L82 PathProgramCache]: Analyzing trace with hash -160756913, now seen corresponding path program 1 times [2019-12-27 18:14:25,882 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:25,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408268692] [2019-12-27 18:14:25,883 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:25,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:25,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:25,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408268692] [2019-12-27 18:14:25,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:25,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:14:25,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1061206352] [2019-12-27 18:14:25,988 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:26,008 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:26,130 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 177 states and 291 transitions. [2019-12-27 18:14:26,131 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:26,148 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:14:26,148 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:14:26,149 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:26,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:14:26,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:14:26,150 INFO L87 Difference]: Start difference. First operand 4665 states and 13437 transitions. Second operand 6 states. [2019-12-27 18:14:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:26,506 INFO L93 Difference]: Finished difference Result 7415 states and 21062 transitions. [2019-12-27 18:14:26,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:14:26,507 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-27 18:14:26,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:26,518 INFO L225 Difference]: With dead ends: 7415 [2019-12-27 18:14:26,518 INFO L226 Difference]: Without dead ends: 7415 [2019-12-27 18:14:26,518 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:14:26,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7415 states. [2019-12-27 18:14:26,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7415 to 5421. [2019-12-27 18:14:26,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-12-27 18:14:26,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 15667 transitions. [2019-12-27 18:14:26,611 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 15667 transitions. Word has length 65 [2019-12-27 18:14:26,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:26,612 INFO L462 AbstractCegarLoop]: Abstraction has 5421 states and 15667 transitions. [2019-12-27 18:14:26,612 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:14:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 15667 transitions. [2019-12-27 18:14:26,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:26,624 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:26,624 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-27 18:14:26,624 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-27 18:14:26,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:26,625 INFO L82 PathProgramCache]: Analyzing trace with hash 947021199, now seen corresponding path program 2 times [2019-12-27 18:14:26,626 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:26,626 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209854145] [2019-12-27 18:14:26,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:26,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:26,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:26,723 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209854145] [2019-12-27 18:14:26,724 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:26,724 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:14:26,724 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1350993319] [2019-12-27 18:14:26,724 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:26,744 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:26,839 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 248 transitions. [2019-12-27 18:14:26,839 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:26,891 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 18:14:26,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:14:26,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:26,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:14:26,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:14:26,893 INFO L87 Difference]: Start difference. First operand 5421 states and 15667 transitions. Second operand 8 states. [2019-12-27 18:14:28,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:28,124 INFO L93 Difference]: Finished difference Result 12278 states and 35556 transitions. [2019-12-27 18:14:28,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 18:14:28,125 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 18:14:28,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:28,142 INFO L225 Difference]: With dead ends: 12278 [2019-12-27 18:14:28,143 INFO L226 Difference]: Without dead ends: 12278 [2019-12-27 18:14:28,143 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2019-12-27 18:14:28,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12278 states. [2019-12-27 18:14:28,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12278 to 5935. [2019-12-27 18:14:28,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5935 states. [2019-12-27 18:14:28,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5935 states to 5935 states and 17205 transitions. [2019-12-27 18:14:28,270 INFO L78 Accepts]: Start accepts. Automaton has 5935 states and 17205 transitions. Word has length 65 [2019-12-27 18:14:28,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:28,271 INFO L462 AbstractCegarLoop]: Abstraction has 5935 states and 17205 transitions. [2019-12-27 18:14:28,271 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:14:28,271 INFO L276 IsEmpty]: Start isEmpty. Operand 5935 states and 17205 transitions. [2019-12-27 18:14:28,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 18:14:28,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:28,279 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-27 18:14:28,279 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-27 18:14:28,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:28,279 INFO L82 PathProgramCache]: Analyzing trace with hash 1073447055, now seen corresponding path program 3 times [2019-12-27 18:14:28,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:28,280 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963079766] [2019-12-27 18:14:28,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:28,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:28,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:28,353 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963079766] [2019-12-27 18:14:28,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:28,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:14:28,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1348664569] [2019-12-27 18:14:28,354 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:28,374 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:28,745 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 221 states and 398 transitions. [2019-12-27 18:14:28,746 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:28,747 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:28,747 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:28,748 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:28,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:28,748 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:28,749 INFO L87 Difference]: Start difference. First operand 5935 states and 17205 transitions. Second operand 3 states. [2019-12-27 18:14:28,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:28,786 INFO L93 Difference]: Finished difference Result 5113 states and 14532 transitions. [2019-12-27 18:14:28,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:28,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 18:14:28,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:28,796 INFO L225 Difference]: With dead ends: 5113 [2019-12-27 18:14:28,796 INFO L226 Difference]: Without dead ends: 5113 [2019-12-27 18:14:28,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:28,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5113 states. [2019-12-27 18:14:28,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5113 to 4949. [2019-12-27 18:14:28,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4949 states. [2019-12-27 18:14:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4949 states to 4949 states and 14078 transitions. [2019-12-27 18:14:28,925 INFO L78 Accepts]: Start accepts. Automaton has 4949 states and 14078 transitions. Word has length 65 [2019-12-27 18:14:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:28,925 INFO L462 AbstractCegarLoop]: Abstraction has 4949 states and 14078 transitions. [2019-12-27 18:14:28,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 4949 states and 14078 transitions. [2019-12-27 18:14:28,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:14:28,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:28,936 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-27 18:14:28,937 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-27 18:14:28,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:28,937 INFO L82 PathProgramCache]: Analyzing trace with hash -924926265, now seen corresponding path program 1 times [2019-12-27 18:14:28,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:28,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107559861] [2019-12-27 18:14:28,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:29,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:29,038 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107559861] [2019-12-27 18:14:29,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:29,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:14:29,038 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [216209351] [2019-12-27 18:14:29,038 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:29,074 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:29,194 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 146 states and 238 transitions. [2019-12-27 18:14:29,194 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:29,238 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 18:14:29,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 18:14:29,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:29,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 18:14:29,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 18:14:29,239 INFO L87 Difference]: Start difference. First operand 4949 states and 14078 transitions. Second operand 5 states. [2019-12-27 18:14:29,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:29,530 INFO L93 Difference]: Finished difference Result 7463 states and 21088 transitions. [2019-12-27 18:14:29,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:14:29,530 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 18:14:29,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:29,541 INFO L225 Difference]: With dead ends: 7463 [2019-12-27 18:14:29,541 INFO L226 Difference]: Without dead ends: 7463 [2019-12-27 18:14:29,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 6 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:14:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7463 states. [2019-12-27 18:14:29,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7463 to 6154. [2019-12-27 18:14:29,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6154 states. [2019-12-27 18:14:29,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6154 states to 6154 states and 17545 transitions. [2019-12-27 18:14:29,704 INFO L78 Accepts]: Start accepts. Automaton has 6154 states and 17545 transitions. Word has length 66 [2019-12-27 18:14:29,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:29,704 INFO L462 AbstractCegarLoop]: Abstraction has 6154 states and 17545 transitions. [2019-12-27 18:14:29,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 18:14:29,705 INFO L276 IsEmpty]: Start isEmpty. Operand 6154 states and 17545 transitions. [2019-12-27 18:14:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:14:29,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:29,716 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-27 18:14:29,717 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-27 18:14:29,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:29,717 INFO L82 PathProgramCache]: Analyzing trace with hash -1368765211, now seen corresponding path program 2 times [2019-12-27 18:14:29,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:29,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351530967] [2019-12-27 18:14:29,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:29,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:29,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:29,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351530967] [2019-12-27 18:14:29,900 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:29,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 18:14:29,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [388049768] [2019-12-27 18:14:29,901 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:29,922 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:30,017 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 273 transitions. [2019-12-27 18:14:30,017 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:30,072 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 18:14:30,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 18:14:30,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:30,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 18:14:30,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 18:14:30,073 INFO L87 Difference]: Start difference. First operand 6154 states and 17545 transitions. Second operand 9 states. [2019-12-27 18:14:30,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:30,975 INFO L93 Difference]: Finished difference Result 8873 states and 24909 transitions. [2019-12-27 18:14:30,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 18:14:30,976 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-27 18:14:30,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:30,987 INFO L225 Difference]: With dead ends: 8873 [2019-12-27 18:14:30,987 INFO L226 Difference]: Without dead ends: 8873 [2019-12-27 18:14:30,987 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 20 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2019-12-27 18:14:31,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8873 states. [2019-12-27 18:14:31,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8873 to 6219. [2019-12-27 18:14:31,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6219 states. [2019-12-27 18:14:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6219 states to 6219 states and 17713 transitions. [2019-12-27 18:14:31,086 INFO L78 Accepts]: Start accepts. Automaton has 6219 states and 17713 transitions. Word has length 66 [2019-12-27 18:14:31,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:31,086 INFO L462 AbstractCegarLoop]: Abstraction has 6219 states and 17713 transitions. [2019-12-27 18:14:31,086 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 18:14:31,086 INFO L276 IsEmpty]: Start isEmpty. Operand 6219 states and 17713 transitions. [2019-12-27 18:14:31,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 18:14:31,095 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:31,095 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:14:31,095 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-27 18:14:31,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:31,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1762090943, now seen corresponding path program 3 times [2019-12-27 18:14:31,097 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:31,097 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090896825] [2019-12-27 18:14:31,097 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:31,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:31,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090896825] [2019-12-27 18:14:31,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:31,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:14:31,171 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [699423821] [2019-12-27 18:14:31,172 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:31,191 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:31,326 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 169 states and 274 transitions. [2019-12-27 18:14:31,326 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:31,327 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:31,327 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:31,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:31,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:31,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:31,328 INFO L87 Difference]: Start difference. First operand 6219 states and 17713 transitions. Second operand 3 states. [2019-12-27 18:14:31,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:31,404 INFO L93 Difference]: Finished difference Result 6219 states and 17712 transitions. [2019-12-27 18:14:31,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:31,405 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 18:14:31,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:31,415 INFO L225 Difference]: With dead ends: 6219 [2019-12-27 18:14:31,415 INFO L226 Difference]: Without dead ends: 6219 [2019-12-27 18:14:31,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:31,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6219 states. [2019-12-27 18:14:31,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6219 to 3886. [2019-12-27 18:14:31,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3886 states. [2019-12-27 18:14:31,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3886 states to 3886 states and 11243 transitions. [2019-12-27 18:14:31,551 INFO L78 Accepts]: Start accepts. Automaton has 3886 states and 11243 transitions. Word has length 66 [2019-12-27 18:14:31,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:31,551 INFO L462 AbstractCegarLoop]: Abstraction has 3886 states and 11243 transitions. [2019-12-27 18:14:31,551 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:31,552 INFO L276 IsEmpty]: Start isEmpty. Operand 3886 states and 11243 transitions. [2019-12-27 18:14:31,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:14:31,562 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:31,562 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-27 18:14:31,562 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-27 18:14:31,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:31,563 INFO L82 PathProgramCache]: Analyzing trace with hash -1906146231, now seen corresponding path program 1 times [2019-12-27 18:14:31,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:31,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390388731] [2019-12-27 18:14:31,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:31,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:31,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:31,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390388731] [2019-12-27 18:14:31,681 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:31,681 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:14:31,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1366264679] [2019-12-27 18:14:31,681 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:31,706 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:31,826 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 255 transitions. [2019-12-27 18:14:31,827 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:31,849 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:14:31,849 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:14:31,849 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:31,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:14:31,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:14:31,850 INFO L87 Difference]: Start difference. First operand 3886 states and 11243 transitions. Second operand 7 states. [2019-12-27 18:14:32,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:32,045 INFO L93 Difference]: Finished difference Result 6941 states and 20100 transitions. [2019-12-27 18:14:32,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:14:32,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-27 18:14:32,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:32,051 INFO L225 Difference]: With dead ends: 6941 [2019-12-27 18:14:32,051 INFO L226 Difference]: Without dead ends: 4152 [2019-12-27 18:14:32,052 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-12-27 18:14:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4152 states. [2019-12-27 18:14:32,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4152 to 3366. [2019-12-27 18:14:32,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3366 states. [2019-12-27 18:14:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3366 states to 3366 states and 9718 transitions. [2019-12-27 18:14:32,109 INFO L78 Accepts]: Start accepts. Automaton has 3366 states and 9718 transitions. Word has length 67 [2019-12-27 18:14:32,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:32,109 INFO L462 AbstractCegarLoop]: Abstraction has 3366 states and 9718 transitions. [2019-12-27 18:14:32,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:14:32,109 INFO L276 IsEmpty]: Start isEmpty. Operand 3366 states and 9718 transitions. [2019-12-27 18:14:32,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:14:32,114 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:32,114 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-27 18:14:32,114 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:32,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:32,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1418245853, now seen corresponding path program 2 times [2019-12-27 18:14:32,115 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:32,116 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120564521] [2019-12-27 18:14:32,116 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:32,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:32,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120564521] [2019-12-27 18:14:32,246 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:32,246 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:14:32,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [287753040] [2019-12-27 18:14:32,246 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:32,272 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:32,428 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 158 states and 260 transitions. [2019-12-27 18:14:32,428 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:32,429 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:14:32,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:14:32,430 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:32,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:14:32,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:14:32,430 INFO L87 Difference]: Start difference. First operand 3366 states and 9718 transitions. Second operand 6 states. [2019-12-27 18:14:32,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:32,526 INFO L93 Difference]: Finished difference Result 5944 states and 17219 transitions. [2019-12-27 18:14:32,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:14:32,526 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-12-27 18:14:32,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:32,531 INFO L225 Difference]: With dead ends: 5944 [2019-12-27 18:14:32,531 INFO L226 Difference]: Without dead ends: 2666 [2019-12-27 18:14:32,531 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-27 18:14:32,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2019-12-27 18:14:32,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2222. [2019-12-27 18:14:32,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2222 states. [2019-12-27 18:14:32,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 6388 transitions. [2019-12-27 18:14:32,617 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 6388 transitions. Word has length 67 [2019-12-27 18:14:32,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:32,618 INFO L462 AbstractCegarLoop]: Abstraction has 2222 states and 6388 transitions. [2019-12-27 18:14:32,618 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:14:32,618 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 6388 transitions. [2019-12-27 18:14:32,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 18:14:32,622 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:32,622 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-27 18:14:32,622 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:32,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:32,623 INFO L82 PathProgramCache]: Analyzing trace with hash 1668809625, now seen corresponding path program 3 times [2019-12-27 18:14:32,623 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:32,624 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083877368] [2019-12-27 18:14:32,624 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:14:32,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:14:32,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083877368] [2019-12-27 18:14:32,669 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:14:32,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:14:32,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [620913901] [2019-12-27 18:14:32,670 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:14:32,689 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:14:32,806 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 349 transitions. [2019-12-27 18:14:32,806 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:14:32,807 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:14:32,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:14:32,807 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:14:32,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:14:32,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:32,808 INFO L87 Difference]: Start difference. First operand 2222 states and 6388 transitions. Second operand 3 states. [2019-12-27 18:14:32,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:14:32,822 INFO L93 Difference]: Finished difference Result 1948 states and 5386 transitions. [2019-12-27 18:14:32,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:14:32,822 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-27 18:14:32,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:14:32,824 INFO L225 Difference]: With dead ends: 1948 [2019-12-27 18:14:32,824 INFO L226 Difference]: Without dead ends: 1948 [2019-12-27 18:14:32,824 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:14:32,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1948 states. [2019-12-27 18:14:32,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1948 to 1804. [2019-12-27 18:14:32,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1804 states. [2019-12-27 18:14:32,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1804 states to 1804 states and 5006 transitions. [2019-12-27 18:14:32,852 INFO L78 Accepts]: Start accepts. Automaton has 1804 states and 5006 transitions. Word has length 67 [2019-12-27 18:14:32,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:14:32,853 INFO L462 AbstractCegarLoop]: Abstraction has 1804 states and 5006 transitions. [2019-12-27 18:14:32,853 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:14:32,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1804 states and 5006 transitions. [2019-12-27 18:14:32,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-27 18:14:32,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:14:32,855 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-27 18:14:32,855 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 18:14:32,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:14:32,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1093105687, now seen corresponding path program 1 times [2019-12-27 18:14:32,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:14:32,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622906392] [2019-12-27 18:14:32,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:14:32,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:14:32,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:14:32,977 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:14:32,977 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:14:32,981 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_49| 0 0))) (and (= 0 v_~x$w_buff0_used~0_815) (= v_~x$r_buff0_thd1~0_121 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2034~0.base_21|)) (= v_~x$flush_delayed~0_33 0) (= v_~y~0_122 0) (= 0 v_~x$r_buff0_thd3~0_131) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t2034~0.base_21| 4)) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t2034~0.base_21|) (= 0 v_~x$r_buff1_thd3~0_199) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$r_buff1_thd2~0_200) (= v_~weak$$choice2~0_113 0) (= v_~z~0_31 0) (= v_~main$tmp_guard1~0_21 0) (= 0 v_~x$w_buff1~0_221) (= 0 v_~weak$$choice0~0_15) (= v_~main$tmp_guard0~0_23 0) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_15|) (= v_~x$r_buff0_thd0~0_372 0) (= 0 v_~x~0_181) (= 0 |v_#NULL.base_4|) (= v_~__unbuffered_cnt~0_156 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$r_buff0_thd2~0_212) (= 0 v_~x$w_buff1_used~0_499) (= |v_#valid_47| (store .cse0 |v_ULTIMATE.start_main_~#t2034~0.base_21| 1)) (= |v_#NULL.offset_4| 0) (= v_~x$r_buff1_thd1~0_184 0) (= v_~x$r_buff1_thd0~0_296 0) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2034~0.base_21| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2034~0.base_21|) |v_ULTIMATE.start_main_~#t2034~0.offset_18| 0)) |v_#memory_int_15|) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~__unbuffered_p2_EAX~0_22) (= 0 |v_ULTIMATE.start_main_~#t2034~0.offset_18|) (= 0 v_~x$w_buff0~0_269))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_49|, #memory_int=|v_#memory_int_16|, #length=|v_#length_20|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_22|, ~x$w_buff0~0=v_~x$w_buff0~0_269, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_28|, ~x$flush_delayed~0=v_~x$flush_delayed~0_33, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_40|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_30|, ULTIMATE.start_main_~#t2036~0.offset=|v_ULTIMATE.start_main_~#t2036~0.offset_17|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_30|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_46|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_184, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_131, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_51|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_37|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_46|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_33|, #length=|v_#length_19|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ULTIMATE.start_main_~#t2035~0.base=|v_ULTIMATE.start_main_~#t2035~0.base_22|, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_372, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_11|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_38|, ~x$w_buff1~0=v_~x$w_buff1~0_221, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_43|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_499, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_200, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_49|, ULTIMATE.start_main_~#t2034~0.offset=|v_ULTIMATE.start_main_~#t2034~0.offset_18|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_112|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_15, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_33|, ULTIMATE.start_main_~#t2034~0.base=|v_ULTIMATE.start_main_~#t2034~0.base_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_156, ~x~0=v_~x~0_181, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_121, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_22|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_34|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_32|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_30|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_118|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_18|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_26|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_51|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_32|, ~y~0=v_~y~0_122, ULTIMATE.start_main_~#t2035~0.offset=|v_ULTIMATE.start_main_~#t2035~0.offset_18|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_11|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_24|, ULTIMATE.start_main_~#t2036~0.base=|v_ULTIMATE.start_main_~#t2036~0.base_21|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_26|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_49|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_23, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_296, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_212, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_60|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_39|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_815, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_33|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_15|, ~z~0=v_~z~0_31, ~weak$$choice2~0=v_~weak$$choice2~0_113, ~x$read_delayed~0=v_~x$read_delayed~0_7} 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, ULTIMATE.start_main_~#t2036~0.offset, #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_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t2035~0.base, ~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_~#t2034~0.offset, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t2034~0.base, ~__unbuffered_cnt~0, ~x~0, ~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_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_~#t2035~0.offset, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_~#t2036~0.base, 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, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 18:14:32,982 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L805-1-->L807: Formula: (and (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2035~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t2035~0.base_13|) |v_ULTIMATE.start_main_~#t2035~0.offset_11| 1)) |v_#memory_int_11|) (= |v_#valid_32| (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2035~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t2035~0.base_13| 0)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2035~0.base_13|)) (= 0 |v_ULTIMATE.start_main_~#t2035~0.offset_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2035~0.base_13|) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2035~0.base_13| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2035~0.offset=|v_ULTIMATE.start_main_~#t2035~0.offset_11|, ULTIMATE.start_main_~#t2035~0.base=|v_ULTIMATE.start_main_~#t2035~0.base_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2035~0.offset, ULTIMATE.start_main_~#t2035~0.base] because there is no mapped edge [2019-12-27 18:14:32,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [688] [688] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_11| v_P1Thread1of1ForFork1_~arg.offset_11) (= 1 v_~x$w_buff0_used~0_98) (= 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) (= 2 v_~x$w_buff0~0_30) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= v_~x$w_buff0~0_31 v_~x$w_buff1~0_21) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 0 (mod v_~x$w_buff1_used~0_55 256))) InVars {~x$w_buff0~0=v_~x$w_buff0~0_31, 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_30, 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-27 18:14:32,983 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2036~0.base_9|) (= |v_ULTIMATE.start_main_~#t2036~0.offset_8| 0) (= (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2036~0.base_9|) 0) (= (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2036~0.base_9| 1) |v_#valid_27|) (not (= |v_ULTIMATE.start_main_~#t2036~0.base_9| 0)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2036~0.base_9| 4) |v_#length_13|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2036~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2036~0.base_9|) |v_ULTIMATE.start_main_~#t2036~0.offset_8| 2)) |v_#memory_int_9|)) 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_~#t2036~0.base=|v_ULTIMATE.start_main_~#t2036~0.base_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_~#t2036~0.offset=|v_ULTIMATE.start_main_~#t2036~0.offset_8|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2036~0.base, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, ULTIMATE.start_main_~#t2036~0.offset, #length] because there is no mapped edge [2019-12-27 18:14:32,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L782-2-->L782-4: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-2136844676 256))) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-2136844676 256) 0))) (or (and (= ~x~0_In-2136844676 |P2Thread1of1ForFork2_#t~ite15_Out-2136844676|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In-2136844676 |P2Thread1of1ForFork2_#t~ite15_Out-2136844676|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2136844676, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2136844676, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2136844676, ~x~0=~x~0_In-2136844676} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-2136844676|, ~x$w_buff1~0=~x$w_buff1~0_In-2136844676, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2136844676, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-2136844676, ~x~0=~x~0_In-2136844676} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-27 18:14:32,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [695] [695] L782-4-->L783: Formula: (= |v_P2Thread1of1ForFork2_#t~ite15_8| v_~x~0_17) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_8|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_7|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-27 18:14:32,987 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L783-->L783-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In1226873031 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1226873031 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out1226873031| ~x$w_buff0_used~0_In1226873031)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite17_Out1226873031| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1226873031, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1226873031} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1226873031, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out1226873031|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1226873031} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 18:14:32,988 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L784-->L784-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1656978187 256))) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-1656978187 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-1656978187 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1656978187 256)))) (or (and (= ~x$w_buff1_used~0_In-1656978187 |P2Thread1of1ForFork2_#t~ite18_Out-1656978187|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out-1656978187| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1656978187, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1656978187, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1656978187, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1656978187} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1656978187, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1656978187, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1656978187, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1656978187|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1656978187} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-27 18:14:32,989 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-960314389 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-960314389 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out-960314389| ~x$r_buff0_thd3~0_In-960314389)) (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out-960314389| 0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-960314389, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-960314389} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-960314389, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-960314389|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-960314389} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-27 18:14:32,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L786-->L786-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In1379507482 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd3~0_In1379507482 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1379507482 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1379507482 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd3~0_In1379507482 |P2Thread1of1ForFork2_#t~ite20_Out1379507482|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out1379507482|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1379507482, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1379507482, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1379507482, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1379507482} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out1379507482|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1379507482, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1379507482, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1379507482, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1379507482} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-27 18:14:32,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_56| v_~x$r_buff1_thd3~0_147) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_56|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_55|, ~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-27 18:14:32,990 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L733-2-->L733-5: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In1943064615 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd1~0_In1943064615 256))) (.cse1 (= |P0Thread1of1ForFork0_#t~ite3_Out1943064615| |P0Thread1of1ForFork0_#t~ite4_Out1943064615|))) (or (and (not .cse0) .cse1 (not .cse2) (= |P0Thread1of1ForFork0_#t~ite3_Out1943064615| ~x$w_buff1~0_In1943064615)) (and (or .cse0 .cse2) .cse1 (= |P0Thread1of1ForFork0_#t~ite3_Out1943064615| ~x~0_In1943064615)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1943064615, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1943064615, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1943064615, ~x~0=~x~0_In1943064615} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out1943064615|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out1943064615|, ~x$w_buff1~0=~x$w_buff1~0_In1943064615, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1943064615, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1943064615, ~x~0=~x~0_In1943064615} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-27 18:14:32,991 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-2131310586 256))) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-2131310586 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-2131310586| ~x$w_buff0_used~0_In-2131310586)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-2131310586| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2131310586, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2131310586} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-2131310586|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-2131310586, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2131310586} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 18:14:32,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In2109845084 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2109845084 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd1~0_In2109845084 256))) (.cse2 (= (mod ~x$w_buff1_used~0_In2109845084 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite6_Out2109845084| ~x$w_buff1_used~0_In2109845084)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out2109845084| 0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2109845084, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2109845084, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2109845084, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2109845084} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out2109845084|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2109845084, ~x$w_buff1_used~0=~x$w_buff1_used~0_In2109845084, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In2109845084, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2109845084} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 18:14:32,992 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In2023794242 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In2023794242 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out2023794242|)) (and (or .cse0 .cse1) (= ~x$r_buff0_thd1~0_In2023794242 |P0Thread1of1ForFork0_#t~ite7_Out2023794242|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2023794242, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2023794242} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In2023794242, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out2023794242|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2023794242} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 18:14:32,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L737-->L737-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1837251619 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1837251619 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1837251619 256) 0)) (.cse3 (= (mod ~x$r_buff1_thd1~0_In-1837251619 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1837251619| 0)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1837251619| ~x$r_buff1_thd1~0_In-1837251619) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1837251619, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1837251619, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1837251619, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1837251619} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1837251619, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1837251619|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1837251619, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1837251619, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1837251619} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 18:14:32,993 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L737-2-->P0EXIT: Formula: (and (= v_~x$r_buff1_thd1~0_126 |v_P0Thread1of1ForFork0_#t~ite8_36|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_63 1) v_~__unbuffered_cnt~0_62)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_35|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_62, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_126} 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-27 18:14:32,994 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1242976023 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1242976023 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1242976023| ~x$w_buff0_used~0_In-1242976023)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork1_#t~ite11_Out-1242976023| 0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1242976023, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1242976023} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-1242976023|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1242976023, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1242976023} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-27 18:14:32,995 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L764-->L764-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In354367407 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In354367407 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In354367407 256))) (.cse2 (= (mod ~x$r_buff0_thd2~0_In354367407 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out354367407| 0)) (and (= |P1Thread1of1ForFork1_#t~ite12_Out354367407| ~x$w_buff1_used~0_In354367407) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In354367407, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In354367407, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In354367407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In354367407} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In354367407, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In354367407, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out354367407|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In354367407, ~x$w_buff0_used~0=~x$w_buff0_used~0_In354367407} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-27 18:14:32,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L765-->L766: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In2043379882 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In2043379882 256)))) (or (and (= ~x$r_buff0_thd2~0_Out2043379882 0) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_Out2043379882 ~x$r_buff0_thd2~0_In2043379882) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In2043379882, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2043379882} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out2043379882|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out2043379882, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2043379882} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 18:14:32,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-2123647879 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-2123647879 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-2123647879 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-2123647879 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In-2123647879 |P1Thread1of1ForFork1_#t~ite14_Out-2123647879|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-2123647879|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-2123647879, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2123647879, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2123647879, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2123647879} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-2123647879, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-2123647879, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-2123647879, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-2123647879|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-2123647879} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-27 18:14:32,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L766-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_154 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |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_154, ~__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-27 18:14:32,996 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] 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-27 18:14:32,997 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L815-2-->L815-5: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd0~0_In-1641309820 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-1641309820 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite25_Out-1641309820| |ULTIMATE.start_main_#t~ite24_Out-1641309820|))) (or (and (or .cse0 .cse1) .cse2 (= |ULTIMATE.start_main_#t~ite24_Out-1641309820| ~x~0_In-1641309820)) (and (= ~x$w_buff1~0_In-1641309820 |ULTIMATE.start_main_#t~ite24_Out-1641309820|) (not .cse0) (not .cse1) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-1641309820, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1641309820, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1641309820, ~x~0=~x~0_In-1641309820} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-1641309820, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-1641309820|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-1641309820|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1641309820, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1641309820, ~x~0=~x~0_In-1641309820} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-27 18:14:32,998 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In574503389 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In574503389 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite26_Out574503389|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out574503389| ~x$w_buff0_used~0_In574503389)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In574503389, ~x$w_buff0_used~0=~x$w_buff0_used~0_In574503389} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In574503389, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out574503389|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In574503389} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-27 18:14:32,999 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In183980043 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In183980043 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In183980043 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd0~0_In183980043 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite27_Out183980043| ~x$w_buff1_used~0_In183980043)) (and (= 0 |ULTIMATE.start_main_#t~ite27_Out183980043|) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In183980043, ~x$w_buff1_used~0=~x$w_buff1_used~0_In183980043, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In183980043, ~x$w_buff0_used~0=~x$w_buff0_used~0_In183980043} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In183980043, ~x$w_buff1_used~0=~x$w_buff1_used~0_In183980043, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out183980043|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In183980043, ~x$w_buff0_used~0=~x$w_buff0_used~0_In183980043} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-27 18:14:33,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L818-->L818-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In166021767 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd0~0_In166021767 256) 0))) (or (and (= ~x$r_buff0_thd0~0_In166021767 |ULTIMATE.start_main_#t~ite28_Out166021767|) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite28_Out166021767| 0) (not .cse1) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In166021767, ~x$w_buff0_used~0=~x$w_buff0_used~0_In166021767} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In166021767, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out166021767|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In166021767} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-27 18:14:33,000 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L819-->L819-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In942687965 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In942687965 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In942687965 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd0~0_In942687965 256) 0))) (or (and (= ~x$r_buff1_thd0~0_In942687965 |ULTIMATE.start_main_#t~ite29_Out942687965|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |ULTIMATE.start_main_#t~ite29_Out942687965| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In942687965, ~x$w_buff1_used~0=~x$w_buff1_used~0_In942687965, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In942687965, ~x$w_buff0_used~0=~x$w_buff0_used~0_In942687965} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In942687965, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out942687965|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In942687965, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In942687965, ~x$w_buff0_used~0=~x$w_buff0_used~0_In942687965} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-27 18:14:33,007 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_111 v_~x$r_buff0_thd0~0_110) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_110, 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-27 18:14:33,009 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L834-->L837-1: Formula: (and (= v_~x$mem_tmp~0_12 v_~x~0_151) (= (mod v_~main$tmp_guard1~0_14 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_~x$flush_delayed~0_25 0) (not (= (mod v_~x$flush_delayed~0_26 256) 0))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_12} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_24|, ~x$flush_delayed~0=v_~x$flush_delayed~0_25, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_14, ~x$mem_tmp~0=v_~x$mem_tmp~0_12, ~x~0=v_~x~0_151, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} 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-27 18:14:33,009 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-27 18:14:33,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:14:33 BasicIcfg [2019-12-27 18:14:33,095 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:14:33,096 INFO L168 Benchmark]: Toolchain (without parser) took 91364.95 ms. Allocated memory was 138.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 100.4 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 875.1 MB. Max. memory is 7.1 GB. [2019-12-27 18:14:33,097 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2019-12-27 18:14:33,098 INFO L168 Benchmark]: CACSL2BoogieTranslator took 842.87 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 100.1 MB in the beginning and 157.4 MB in the end (delta: -57.3 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. [2019-12-27 18:14:33,098 INFO L168 Benchmark]: Boogie Procedure Inliner took 70.74 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:14:33,099 INFO L168 Benchmark]: Boogie Preprocessor took 53.18 ms. Allocated memory is still 203.9 MB. Free memory was 154.8 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:14:33,099 INFO L168 Benchmark]: RCFGBuilder took 1067.16 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 102.5 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:14:33,100 INFO L168 Benchmark]: TraceAbstraction took 89325.59 ms. Allocated memory was 203.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 811.6 MB. Max. memory is 7.1 GB. [2019-12-27 18:14:33,103 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.24 ms. Allocated memory is still 138.9 MB. Free memory was 120.8 MB in the beginning and 120.6 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 842.87 ms. Allocated memory was 138.9 MB in the beginning and 203.9 MB in the end (delta: 65.0 MB). Free memory was 100.1 MB in the beginning and 157.4 MB in the end (delta: -57.3 MB). Peak memory consumption was 25.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 70.74 ms. Allocated memory is still 203.9 MB. Free memory was 157.4 MB in the beginning and 154.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 53.18 ms. Allocated memory is still 203.9 MB. Free memory was 154.8 MB in the beginning and 152.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1067.16 ms. Allocated memory is still 203.9 MB. Free memory was 152.2 MB in the beginning and 102.5 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 89325.59 ms. Allocated memory was 203.9 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.9 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 811.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.4s, 174 ProgramPointsBefore, 94 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 29 ChoiceCompositions, 6170 VarBasedMoverChecksPositive, 251 VarBasedMoverChecksNegative, 77 SemBasedMoverChecksPositive, 248 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 87419 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(&t2034, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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, z=0] [L807] FCALL, FORK 0 pthread_create(&t2035, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, z=0] [L809] FCALL, FORK 0 pthread_create(&t2036, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=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_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, z=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=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=1, z=1] [L727] 1 z = 2 [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __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=1, z=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_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=1, z=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_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=1, z=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [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 [__unbuffered_cnt=0, __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_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [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 [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 [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_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=1, z=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_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=1, z=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_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=1, z=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_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=1, z=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_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=1, z=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_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=1, z=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_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=1, z=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_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=1, z=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 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __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=1, z=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 89.0s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 20.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2676 SDtfs, 2346 SDslu, 5177 SDs, 0 SdLazy, 3589 SolverSat, 170 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 64 SyntacticMatches, 22 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.0s 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: 41.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 87827 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 915 NumberOfCodeBlocks, 915 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 829 ConstructedInterpolants, 0 QuantifiedInterpolants, 115903 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...