/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 17:02:26,537 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 17:02:26,540 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 17:02:26,557 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 17:02:26,557 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 17:02:26,558 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 17:02:26,559 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 17:02:26,561 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 17:02:26,563 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 17:02:26,564 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 17:02:26,565 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 17:02:26,566 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 17:02:26,566 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 17:02:26,567 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 17:02:26,568 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 17:02:26,569 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 17:02:26,570 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 17:02:26,571 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 17:02:26,572 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 17:02:26,574 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 17:02:26,576 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 17:02:26,577 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 17:02:26,578 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 17:02:26,579 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 17:02:26,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 17:02:26,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 17:02:26,582 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 17:02:26,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 17:02:26,583 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 17:02:26,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 17:02:26,584 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 17:02:26,585 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 17:02:26,586 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 17:02:26,586 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 17:02:26,587 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 17:02:26,588 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 17:02:26,588 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 17:02:26,589 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 17:02:26,589 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 17:02:26,589 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 17:02:26,590 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 17:02:26,591 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe.epf [2019-12-18 17:02:26,605 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 17:02:26,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 17:02:26,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 17:02:26,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 17:02:26,607 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 17:02:26,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 17:02:26,607 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 17:02:26,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 17:02:26,608 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 17:02:26,608 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 17:02:26,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 17:02:26,608 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 17:02:26,609 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 17:02:26,609 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 17:02:26,609 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 17:02:26,609 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 17:02:26,609 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 17:02:26,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 17:02:26,610 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 17:02:26,610 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 17:02:26,610 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 17:02:26,610 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:02:26,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 17:02:26,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 17:02:26,611 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 17:02:26,611 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 17:02:26,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 17:02:26,612 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 17:02:26,612 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 17:02:26,873 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 17:02:26,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 17:02:26,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 17:02:26,889 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 17:02:26,889 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 17:02:26,890 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i [2019-12-18 17:02:26,970 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/799078960/75fef2f94b394cd4b16380be1a80daf5/FLAGda2bf63b5 [2019-12-18 17:02:27,514 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 17:02:27,515 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix028_tso.opt.i [2019-12-18 17:02:27,541 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/799078960/75fef2f94b394cd4b16380be1a80daf5/FLAGda2bf63b5 [2019-12-18 17:02:27,821 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/799078960/75fef2f94b394cd4b16380be1a80daf5 [2019-12-18 17:02:27,829 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 17:02:27,831 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 17:02:27,832 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 17:02:27,832 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 17:02:27,836 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 17:02:27,837 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:02:27" (1/1) ... [2019-12-18 17:02:27,840 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e5dfff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:27, skipping insertion in model container [2019-12-18 17:02:27,840 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 05:02:27" (1/1) ... [2019-12-18 17:02:27,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 17:02:27,905 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 17:02:28,470 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:02:28,492 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 17:02:28,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 17:02:28,655 INFO L208 MainTranslator]: Completed translation [2019-12-18 17:02:28,655 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:28 WrapperNode [2019-12-18 17:02:28,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 17:02:28,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 17:02:28,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 17:02:28,657 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 17:02:28,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:28" (1/1) ... [2019-12-18 17:02:28,694 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:28" (1/1) ... [2019-12-18 17:02:28,736 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 17:02:28,737 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 17:02:28,737 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 17:02:28,737 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 17:02:28,747 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:28" (1/1) ... [2019-12-18 17:02:28,747 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:28" (1/1) ... [2019-12-18 17:02:28,753 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:28" (1/1) ... [2019-12-18 17:02:28,753 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:28" (1/1) ... [2019-12-18 17:02:28,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:28" (1/1) ... [2019-12-18 17:02:28,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:28" (1/1) ... [2019-12-18 17:02:28,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:28" (1/1) ... [2019-12-18 17:02:28,782 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 17:02:28,782 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 17:02:28,782 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 17:02:28,782 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 17:02:28,783 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:28" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 17:02:28,846 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 17:02:28,846 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 17:02:28,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 17:02:28,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 17:02:28,847 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 17:02:28,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 17:02:28,847 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 17:02:28,847 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 17:02:28,847 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 17:02:28,848 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 17:02:28,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 17:02:28,848 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 17:02:28,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 17:02:28,850 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 17:02:29,705 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 17:02:29,706 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 17:02:29,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:02:29 BoogieIcfgContainer [2019-12-18 17:02:29,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 17:02:29,709 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 17:02:29,709 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 17:02:29,712 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 17:02:29,713 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 05:02:27" (1/3) ... [2019-12-18 17:02:29,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35af24fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:02:29, skipping insertion in model container [2019-12-18 17:02:29,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 05:02:28" (2/3) ... [2019-12-18 17:02:29,714 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35af24fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 05:02:29, skipping insertion in model container [2019-12-18 17:02:29,715 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 05:02:29" (3/3) ... [2019-12-18 17:02:29,717 INFO L109 eAbstractionObserver]: Analyzing ICFG mix028_tso.opt.i [2019-12-18 17:02:29,745 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 17:02:29,745 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 17:02:29,759 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 17:02:29,760 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 17:02:29,822 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,823 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,823 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,825 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,827 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,827 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,827 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,828 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,829 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,830 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,831 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,832 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,833 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,834 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,835 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,836 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,837 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,838 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,838 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,838 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,839 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,861 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,862 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,868 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,868 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,868 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,872 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,873 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,873 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,874 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,875 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,876 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,878 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,879 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,880 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,881 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,888 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,889 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,890 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,890 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 17:02:29,903 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 17:02:29,918 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 17:02:29,919 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 17:02:29,919 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 17:02:29,919 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 17:02:29,919 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 17:02:29,919 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 17:02:29,919 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 17:02:29,920 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 17:02:29,937 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 205 places, 257 transitions [2019-12-18 17:02:29,939 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 205 places, 257 transitions [2019-12-18 17:02:30,051 INFO L126 PetriNetUnfolder]: 62/254 cut-off events. [2019-12-18 17:02:30,051 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:02:30,082 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 254 events. 62/254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 519 event pairs. 9/199 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-18 17:02:30,118 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 205 places, 257 transitions [2019-12-18 17:02:30,203 INFO L126 PetriNetUnfolder]: 62/254 cut-off events. [2019-12-18 17:02:30,203 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 17:02:30,217 INFO L76 FinitePrefix]: Finished finitePrefix Result has 264 conditions, 254 events. 62/254 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 519 event pairs. 9/199 useless extension candidates. Maximal degree in co-relation 224. Up to 2 conditions per place. [2019-12-18 17:02:30,251 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 26988 [2019-12-18 17:02:30,252 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 17:02:35,479 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2019-12-18 17:02:35,856 WARN L192 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 87 [2019-12-18 17:02:35,959 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-12-18 17:02:36,112 INFO L206 etLargeBlockEncoding]: Checked pairs total: 165402 [2019-12-18 17:02:36,116 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-18 17:02:36,121 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 120 places, 143 transitions [2019-12-18 17:02:40,546 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 57466 states. [2019-12-18 17:02:40,548 INFO L276 IsEmpty]: Start isEmpty. Operand 57466 states. [2019-12-18 17:02:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-18 17:02:40,555 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:40,556 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:02:40,556 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:40,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:40,561 INFO L82 PathProgramCache]: Analyzing trace with hash -953839885, now seen corresponding path program 1 times [2019-12-18 17:02:40,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:40,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944716690] [2019-12-18 17:02:40,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:02:40,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944716690] [2019-12-18 17:02:40,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:40,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 17:02:40,841 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123572088] [2019-12-18 17:02:40,847 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:02:40,847 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:40,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:02:40,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:02:40,865 INFO L87 Difference]: Start difference. First operand 57466 states. Second operand 3 states. [2019-12-18 17:02:41,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:41,913 INFO L93 Difference]: Finished difference Result 57370 states and 231250 transitions. [2019-12-18 17:02:41,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:02:41,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-18 17:02:41,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:43,820 INFO L225 Difference]: With dead ends: 57370 [2019-12-18 17:02:43,820 INFO L226 Difference]: Without dead ends: 56226 [2019-12-18 17:02:43,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:02:44,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56226 states. [2019-12-18 17:02:46,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56226 to 56226. [2019-12-18 17:02:46,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56226 states. [2019-12-18 17:02:47,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56226 states to 56226 states and 226882 transitions. [2019-12-18 17:02:47,213 INFO L78 Accepts]: Start accepts. Automaton has 56226 states and 226882 transitions. Word has length 7 [2019-12-18 17:02:47,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:47,214 INFO L462 AbstractCegarLoop]: Abstraction has 56226 states and 226882 transitions. [2019-12-18 17:02:47,214 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:02:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand 56226 states and 226882 transitions. [2019-12-18 17:02:47,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:02:47,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:47,226 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:02:47,227 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:47,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:47,228 INFO L82 PathProgramCache]: Analyzing trace with hash 749632042, now seen corresponding path program 1 times [2019-12-18 17:02:47,228 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:47,228 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474387331] [2019-12-18 17:02:47,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:47,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:47,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:02:47,399 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474387331] [2019-12-18 17:02:47,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:47,400 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:02:47,400 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454647234] [2019-12-18 17:02:47,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:02:47,402 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:47,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:02:47,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:02:47,403 INFO L87 Difference]: Start difference. First operand 56226 states and 226882 transitions. Second operand 4 states. [2019-12-18 17:02:50,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:50,326 INFO L93 Difference]: Finished difference Result 90514 states and 350820 transitions. [2019-12-18 17:02:50,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:02:50,326 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 17:02:50,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:50,777 INFO L225 Difference]: With dead ends: 90514 [2019-12-18 17:02:50,778 INFO L226 Difference]: Without dead ends: 90500 [2019-12-18 17:02:50,779 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:02:52,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90500 states. [2019-12-18 17:02:54,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90500 to 87886. [2019-12-18 17:02:54,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87886 states. [2019-12-18 17:02:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87886 states to 87886 states and 342542 transitions. [2019-12-18 17:02:54,744 INFO L78 Accepts]: Start accepts. Automaton has 87886 states and 342542 transitions. Word has length 13 [2019-12-18 17:02:54,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:54,744 INFO L462 AbstractCegarLoop]: Abstraction has 87886 states and 342542 transitions. [2019-12-18 17:02:54,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:02:54,744 INFO L276 IsEmpty]: Start isEmpty. Operand 87886 states and 342542 transitions. [2019-12-18 17:02:54,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 17:02:54,746 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:54,746 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:02:54,746 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:54,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:54,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1969493490, now seen corresponding path program 1 times [2019-12-18 17:02:54,746 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:54,747 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955859420] [2019-12-18 17:02:54,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:54,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:02:54,796 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955859420] [2019-12-18 17:02:54,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:54,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:02:54,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397423815] [2019-12-18 17:02:54,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:02:54,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:54,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:02:54,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:02:54,798 INFO L87 Difference]: Start difference. First operand 87886 states and 342542 transitions. Second operand 3 states. [2019-12-18 17:02:54,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:54,971 INFO L93 Difference]: Finished difference Result 48011 states and 163167 transitions. [2019-12-18 17:02:54,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:02:54,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 17:02:54,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:55,080 INFO L225 Difference]: With dead ends: 48011 [2019-12-18 17:02:55,081 INFO L226 Difference]: Without dead ends: 48011 [2019-12-18 17:02:55,081 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:02:58,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48011 states. [2019-12-18 17:02:59,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48011 to 48011. [2019-12-18 17:02:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48011 states. [2019-12-18 17:02:59,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48011 states to 48011 states and 163167 transitions. [2019-12-18 17:02:59,401 INFO L78 Accepts]: Start accepts. Automaton has 48011 states and 163167 transitions. Word has length 13 [2019-12-18 17:02:59,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:59,401 INFO L462 AbstractCegarLoop]: Abstraction has 48011 states and 163167 transitions. [2019-12-18 17:02:59,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:02:59,402 INFO L276 IsEmpty]: Start isEmpty. Operand 48011 states and 163167 transitions. [2019-12-18 17:02:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 17:02:59,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:59,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:02:59,404 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:59,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:59,404 INFO L82 PathProgramCache]: Analyzing trace with hash 802741009, now seen corresponding path program 1 times [2019-12-18 17:02:59,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:59,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341572256] [2019-12-18 17:02:59,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:02:59,460 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:02:59,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341572256] [2019-12-18 17:02:59,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:02:59,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:02:59,464 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679764238] [2019-12-18 17:02:59,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:02:59,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:02:59,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:02:59,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:02:59,466 INFO L87 Difference]: Start difference. First operand 48011 states and 163167 transitions. Second operand 4 states. [2019-12-18 17:02:59,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:02:59,510 INFO L93 Difference]: Finished difference Result 5081 states and 12972 transitions. [2019-12-18 17:02:59,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:02:59,511 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 17:02:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:02:59,849 INFO L225 Difference]: With dead ends: 5081 [2019-12-18 17:02:59,849 INFO L226 Difference]: Without dead ends: 5081 [2019-12-18 17:02:59,850 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:02:59,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5081 states. [2019-12-18 17:02:59,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5081 to 5081. [2019-12-18 17:02:59,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5081 states. [2019-12-18 17:02:59,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5081 states to 5081 states and 12972 transitions. [2019-12-18 17:02:59,938 INFO L78 Accepts]: Start accepts. Automaton has 5081 states and 12972 transitions. Word has length 14 [2019-12-18 17:02:59,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:02:59,939 INFO L462 AbstractCegarLoop]: Abstraction has 5081 states and 12972 transitions. [2019-12-18 17:02:59,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:02:59,939 INFO L276 IsEmpty]: Start isEmpty. Operand 5081 states and 12972 transitions. [2019-12-18 17:02:59,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 17:02:59,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:02:59,944 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:02:59,944 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:02:59,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:02:59,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1593078696, now seen corresponding path program 1 times [2019-12-18 17:02:59,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:02:59,946 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518050780] [2019-12-18 17:02:59,946 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:02:59,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:00,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:00,074 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518050780] [2019-12-18 17:03:00,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:00,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 17:03:00,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683302528] [2019-12-18 17:03:00,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:03:00,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:00,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:03:00,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:03:00,076 INFO L87 Difference]: Start difference. First operand 5081 states and 12972 transitions. Second operand 5 states. [2019-12-18 17:03:00,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:00,108 INFO L93 Difference]: Finished difference Result 1979 states and 5224 transitions. [2019-12-18 17:03:00,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 17:03:00,109 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 17:03:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:00,113 INFO L225 Difference]: With dead ends: 1979 [2019-12-18 17:03:00,113 INFO L226 Difference]: Without dead ends: 1979 [2019-12-18 17:03:00,113 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:03:00,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1979 states. [2019-12-18 17:03:00,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1979 to 1881. [2019-12-18 17:03:00,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1881 states. [2019-12-18 17:03:00,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1881 states to 1881 states and 4993 transitions. [2019-12-18 17:03:00,145 INFO L78 Accepts]: Start accepts. Automaton has 1881 states and 4993 transitions. Word has length 26 [2019-12-18 17:03:00,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:00,146 INFO L462 AbstractCegarLoop]: Abstraction has 1881 states and 4993 transitions. [2019-12-18 17:03:00,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:03:00,146 INFO L276 IsEmpty]: Start isEmpty. Operand 1881 states and 4993 transitions. [2019-12-18 17:03:00,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 17:03:00,156 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:00,156 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:00,156 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:00,157 INFO L82 PathProgramCache]: Analyzing trace with hash 76160980, now seen corresponding path program 1 times [2019-12-18 17:03:00,157 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:00,157 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108722081] [2019-12-18 17:03:00,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:00,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:00,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108722081] [2019-12-18 17:03:00,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:00,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:03:00,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503463630] [2019-12-18 17:03:00,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 17:03:00,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:00,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 17:03:00,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:03:00,292 INFO L87 Difference]: Start difference. First operand 1881 states and 4993 transitions. Second operand 5 states. [2019-12-18 17:03:00,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:00,822 INFO L93 Difference]: Finished difference Result 2818 states and 7401 transitions. [2019-12-18 17:03:00,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:03:00,823 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 71 [2019-12-18 17:03:00,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:00,827 INFO L225 Difference]: With dead ends: 2818 [2019-12-18 17:03:00,827 INFO L226 Difference]: Without dead ends: 2818 [2019-12-18 17:03:00,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:03:00,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2818 states. [2019-12-18 17:03:00,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2818 to 2057. [2019-12-18 17:03:00,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2057 states. [2019-12-18 17:03:00,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2057 states to 2057 states and 5485 transitions. [2019-12-18 17:03:00,858 INFO L78 Accepts]: Start accepts. Automaton has 2057 states and 5485 transitions. Word has length 71 [2019-12-18 17:03:00,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:00,858 INFO L462 AbstractCegarLoop]: Abstraction has 2057 states and 5485 transitions. [2019-12-18 17:03:00,858 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 17:03:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 2057 states and 5485 transitions. [2019-12-18 17:03:00,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 17:03:00,864 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:00,865 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:00,865 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:00,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:00,865 INFO L82 PathProgramCache]: Analyzing trace with hash -789175518, now seen corresponding path program 2 times [2019-12-18 17:03:00,865 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:00,866 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440142744] [2019-12-18 17:03:00,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:01,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:01,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440142744] [2019-12-18 17:03:01,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:01,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:03:01,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333425711] [2019-12-18 17:03:01,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:03:01,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:01,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:03:01,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:03:01,024 INFO L87 Difference]: Start difference. First operand 2057 states and 5485 transitions. Second operand 7 states. [2019-12-18 17:03:01,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:01,651 INFO L93 Difference]: Finished difference Result 2346 states and 6185 transitions. [2019-12-18 17:03:01,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:03:01,651 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 71 [2019-12-18 17:03:01,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:01,655 INFO L225 Difference]: With dead ends: 2346 [2019-12-18 17:03:01,656 INFO L226 Difference]: Without dead ends: 2346 [2019-12-18 17:03:01,656 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:03:01,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2019-12-18 17:03:01,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2127. [2019-12-18 17:03:01,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2127 states. [2019-12-18 17:03:01,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2127 states to 2127 states and 5650 transitions. [2019-12-18 17:03:01,697 INFO L78 Accepts]: Start accepts. Automaton has 2127 states and 5650 transitions. Word has length 71 [2019-12-18 17:03:01,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:01,697 INFO L462 AbstractCegarLoop]: Abstraction has 2127 states and 5650 transitions. [2019-12-18 17:03:01,698 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:03:01,698 INFO L276 IsEmpty]: Start isEmpty. Operand 2127 states and 5650 transitions. [2019-12-18 17:03:01,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-12-18 17:03:01,705 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:01,705 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:01,705 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:01,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:01,706 INFO L82 PathProgramCache]: Analyzing trace with hash 920625250, now seen corresponding path program 3 times [2019-12-18 17:03:01,706 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:01,706 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799075450] [2019-12-18 17:03:01,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:01,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:01,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:01,862 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799075450] [2019-12-18 17:03:01,862 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:01,862 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:03:01,862 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299940020] [2019-12-18 17:03:01,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:03:01,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:01,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:03:01,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:03:01,865 INFO L87 Difference]: Start difference. First operand 2127 states and 5650 transitions. Second operand 6 states. [2019-12-18 17:03:02,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:02,392 INFO L93 Difference]: Finished difference Result 3285 states and 8595 transitions. [2019-12-18 17:03:02,393 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:03:02,393 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 71 [2019-12-18 17:03:02,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:02,397 INFO L225 Difference]: With dead ends: 3285 [2019-12-18 17:03:02,397 INFO L226 Difference]: Without dead ends: 3285 [2019-12-18 17:03:02,398 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:03:02,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3285 states. [2019-12-18 17:03:02,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3285 to 2411. [2019-12-18 17:03:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2411 states. [2019-12-18 17:03:02,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 6298 transitions. [2019-12-18 17:03:02,426 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 6298 transitions. Word has length 71 [2019-12-18 17:03:02,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:02,426 INFO L462 AbstractCegarLoop]: Abstraction has 2411 states and 6298 transitions. [2019-12-18 17:03:02,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:03:02,427 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 6298 transitions. [2019-12-18 17:03:02,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 17:03:02,433 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:02,434 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:02,434 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:02,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:02,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1439498402, now seen corresponding path program 1 times [2019-12-18 17:03:02,434 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:02,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014840619] [2019-12-18 17:03:02,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:02,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:02,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:02,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014840619] [2019-12-18 17:03:02,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:02,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:03:02,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235501937] [2019-12-18 17:03:02,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:03:02,563 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:02,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:03:02,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:03:02,563 INFO L87 Difference]: Start difference. First operand 2411 states and 6298 transitions. Second operand 7 states. [2019-12-18 17:03:03,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:03,411 INFO L93 Difference]: Finished difference Result 4056 states and 10526 transitions. [2019-12-18 17:03:03,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:03:03,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-12-18 17:03:03,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:03,417 INFO L225 Difference]: With dead ends: 4056 [2019-12-18 17:03:03,417 INFO L226 Difference]: Without dead ends: 4056 [2019-12-18 17:03:03,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:03:03,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4056 states. [2019-12-18 17:03:03,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4056 to 2423. [2019-12-18 17:03:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2423 states. [2019-12-18 17:03:03,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 6326 transitions. [2019-12-18 17:03:03,450 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 6326 transitions. Word has length 72 [2019-12-18 17:03:03,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:03,451 INFO L462 AbstractCegarLoop]: Abstraction has 2423 states and 6326 transitions. [2019-12-18 17:03:03,451 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:03:03,451 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 6326 transitions. [2019-12-18 17:03:03,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 17:03:03,456 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:03,456 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:03,457 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:03,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:03,457 INFO L82 PathProgramCache]: Analyzing trace with hash 362991256, now seen corresponding path program 2 times [2019-12-18 17:03:03,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:03,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013053372] [2019-12-18 17:03:03,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:03,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:03,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:03,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013053372] [2019-12-18 17:03:03,585 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:03,585 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:03:03,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54850084] [2019-12-18 17:03:03,586 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:03:03,586 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:03,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:03:03,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:03:03,587 INFO L87 Difference]: Start difference. First operand 2423 states and 6326 transitions. Second operand 7 states. [2019-12-18 17:03:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:04,446 INFO L93 Difference]: Finished difference Result 4529 states and 11696 transitions. [2019-12-18 17:03:04,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 17:03:04,446 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-12-18 17:03:04,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:04,453 INFO L225 Difference]: With dead ends: 4529 [2019-12-18 17:03:04,453 INFO L226 Difference]: Without dead ends: 4529 [2019-12-18 17:03:04,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:03:04,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4529 states. [2019-12-18 17:03:04,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4529 to 2513. [2019-12-18 17:03:04,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2513 states. [2019-12-18 17:03:04,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2513 states to 2513 states and 6593 transitions. [2019-12-18 17:03:04,501 INFO L78 Accepts]: Start accepts. Automaton has 2513 states and 6593 transitions. Word has length 72 [2019-12-18 17:03:04,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:04,501 INFO L462 AbstractCegarLoop]: Abstraction has 2513 states and 6593 transitions. [2019-12-18 17:03:04,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:03:04,501 INFO L276 IsEmpty]: Start isEmpty. Operand 2513 states and 6593 transitions. [2019-12-18 17:03:04,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 17:03:04,506 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:04,506 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:04,507 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:04,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:04,507 INFO L82 PathProgramCache]: Analyzing trace with hash -697994534, now seen corresponding path program 3 times [2019-12-18 17:03:04,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:04,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681709814] [2019-12-18 17:03:04,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:04,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:04,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-18 17:03:04,607 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681709814] [2019-12-18 17:03:04,607 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:04,607 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:03:04,607 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270073355] [2019-12-18 17:03:04,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:03:04,608 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:04,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:03:04,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:03:04,609 INFO L87 Difference]: Start difference. First operand 2513 states and 6593 transitions. Second operand 7 states. [2019-12-18 17:03:05,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:05,205 INFO L93 Difference]: Finished difference Result 4357 states and 11298 transitions. [2019-12-18 17:03:05,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-18 17:03:05,205 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-12-18 17:03:05,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:05,214 INFO L225 Difference]: With dead ends: 4357 [2019-12-18 17:03:05,214 INFO L226 Difference]: Without dead ends: 4357 [2019-12-18 17:03:05,215 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-12-18 17:03:05,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4357 states. [2019-12-18 17:03:05,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4357 to 2495. [2019-12-18 17:03:05,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2019-12-18 17:03:05,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 6548 transitions. [2019-12-18 17:03:05,265 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 6548 transitions. Word has length 72 [2019-12-18 17:03:05,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:05,267 INFO L462 AbstractCegarLoop]: Abstraction has 2495 states and 6548 transitions. [2019-12-18 17:03:05,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:03:05,267 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 6548 transitions. [2019-12-18 17:03:05,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 17:03:05,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:05,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:05,272 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:05,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:05,273 INFO L82 PathProgramCache]: Analyzing trace with hash -2080066259, now seen corresponding path program 1 times [2019-12-18 17:03:05,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:05,273 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943174164] [2019-12-18 17:03:05,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:05,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:05,376 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:05,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943174164] [2019-12-18 17:03:05,377 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:05,377 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:03:05,377 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412746858] [2019-12-18 17:03:05,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:03:05,378 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:05,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:03:05,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:03:05,378 INFO L87 Difference]: Start difference. First operand 2495 states and 6548 transitions. Second operand 6 states. [2019-12-18 17:03:05,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:05,911 INFO L93 Difference]: Finished difference Result 3310 states and 8595 transitions. [2019-12-18 17:03:05,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 17:03:05,912 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 72 [2019-12-18 17:03:05,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:05,917 INFO L225 Difference]: With dead ends: 3310 [2019-12-18 17:03:05,917 INFO L226 Difference]: Without dead ends: 3310 [2019-12-18 17:03:05,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:03:05,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3310 states. [2019-12-18 17:03:05,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3310 to 2691. [2019-12-18 17:03:05,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2691 states. [2019-12-18 17:03:05,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2691 states to 2691 states and 7052 transitions. [2019-12-18 17:03:05,963 INFO L78 Accepts]: Start accepts. Automaton has 2691 states and 7052 transitions. Word has length 72 [2019-12-18 17:03:05,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:05,963 INFO L462 AbstractCegarLoop]: Abstraction has 2691 states and 7052 transitions. [2019-12-18 17:03:05,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:03:05,964 INFO L276 IsEmpty]: Start isEmpty. Operand 2691 states and 7052 transitions. [2019-12-18 17:03:05,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-18 17:03:05,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:05,969 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:05,969 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:05,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:05,970 INFO L82 PathProgramCache]: Analyzing trace with hash -1499063086, now seen corresponding path program 1 times [2019-12-18 17:03:05,970 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:05,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894207875] [2019-12-18 17:03:05,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:05,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:06,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:06,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894207875] [2019-12-18 17:03:06,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:06,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:03:06,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493384696] [2019-12-18 17:03:06,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:03:06,105 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:06,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:03:06,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:03:06,108 INFO L87 Difference]: Start difference. First operand 2691 states and 7052 transitions. Second operand 7 states. [2019-12-18 17:03:06,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:06,731 INFO L93 Difference]: Finished difference Result 3423 states and 8847 transitions. [2019-12-18 17:03:06,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:03:06,732 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-12-18 17:03:06,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:06,736 INFO L225 Difference]: With dead ends: 3423 [2019-12-18 17:03:06,736 INFO L226 Difference]: Without dead ends: 3423 [2019-12-18 17:03:06,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 8 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:03:06,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3423 states. [2019-12-18 17:03:06,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3423 to 2523. [2019-12-18 17:03:06,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2523 states. [2019-12-18 17:03:06,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2523 states to 2523 states and 6614 transitions. [2019-12-18 17:03:06,777 INFO L78 Accepts]: Start accepts. Automaton has 2523 states and 6614 transitions. Word has length 72 [2019-12-18 17:03:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:06,778 INFO L462 AbstractCegarLoop]: Abstraction has 2523 states and 6614 transitions. [2019-12-18 17:03:06,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:03:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2523 states and 6614 transitions. [2019-12-18 17:03:06,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 17:03:06,782 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:06,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:06,782 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:06,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:06,783 INFO L82 PathProgramCache]: Analyzing trace with hash -298102113, now seen corresponding path program 1 times [2019-12-18 17:03:06,783 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:06,783 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569446281] [2019-12-18 17:03:06,783 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:06,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:06,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569446281] [2019-12-18 17:03:06,845 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:06,845 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:03:06,845 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642614931] [2019-12-18 17:03:06,846 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:03:06,846 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:06,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:03:06,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:06,846 INFO L87 Difference]: Start difference. First operand 2523 states and 6614 transitions. Second operand 3 states. [2019-12-18 17:03:06,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:06,862 INFO L93 Difference]: Finished difference Result 2291 states and 5860 transitions. [2019-12-18 17:03:06,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:03:06,863 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-18 17:03:06,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:06,866 INFO L225 Difference]: With dead ends: 2291 [2019-12-18 17:03:06,866 INFO L226 Difference]: Without dead ends: 2291 [2019-12-18 17:03:06,867 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:06,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2019-12-18 17:03:06,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2291. [2019-12-18 17:03:06,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2291 states. [2019-12-18 17:03:06,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2291 states to 2291 states and 5860 transitions. [2019-12-18 17:03:06,899 INFO L78 Accepts]: Start accepts. Automaton has 2291 states and 5860 transitions. Word has length 73 [2019-12-18 17:03:06,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:06,899 INFO L462 AbstractCegarLoop]: Abstraction has 2291 states and 5860 transitions. [2019-12-18 17:03:06,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:03:06,899 INFO L276 IsEmpty]: Start isEmpty. Operand 2291 states and 5860 transitions. [2019-12-18 17:03:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 17:03:06,903 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:06,903 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:06,904 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:06,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:06,904 INFO L82 PathProgramCache]: Analyzing trace with hash -393402248, now seen corresponding path program 1 times [2019-12-18 17:03:06,904 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:06,904 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624471755] [2019-12-18 17:03:06,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:06,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:06,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:06,981 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624471755] [2019-12-18 17:03:06,981 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:06,981 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 17:03:06,981 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283169097] [2019-12-18 17:03:06,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 17:03:06,982 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:06,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 17:03:06,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:06,982 INFO L87 Difference]: Start difference. First operand 2291 states and 5860 transitions. Second operand 3 states. [2019-12-18 17:03:07,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:07,018 INFO L93 Difference]: Finished difference Result 2290 states and 5858 transitions. [2019-12-18 17:03:07,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 17:03:07,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-12-18 17:03:07,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:07,022 INFO L225 Difference]: With dead ends: 2290 [2019-12-18 17:03:07,022 INFO L226 Difference]: Without dead ends: 2290 [2019-12-18 17:03:07,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 17:03:07,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2290 states. [2019-12-18 17:03:07,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2290 to 2025. [2019-12-18 17:03:07,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2025 states. [2019-12-18 17:03:07,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2025 states to 2025 states and 5244 transitions. [2019-12-18 17:03:07,056 INFO L78 Accepts]: Start accepts. Automaton has 2025 states and 5244 transitions. Word has length 73 [2019-12-18 17:03:07,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:07,057 INFO L462 AbstractCegarLoop]: Abstraction has 2025 states and 5244 transitions. [2019-12-18 17:03:07,057 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 17:03:07,057 INFO L276 IsEmpty]: Start isEmpty. Operand 2025 states and 5244 transitions. [2019-12-18 17:03:07,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 17:03:07,061 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:07,061 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:07,062 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:07,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:07,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1480966909, now seen corresponding path program 1 times [2019-12-18 17:03:07,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:07,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528789309] [2019-12-18 17:03:07,062 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:07,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:07,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528789309] [2019-12-18 17:03:07,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:07,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:03:07,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355536988] [2019-12-18 17:03:07,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:03:07,296 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:07,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:03:07,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:03:07,296 INFO L87 Difference]: Start difference. First operand 2025 states and 5244 transitions. Second operand 10 states. [2019-12-18 17:03:08,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:08,616 INFO L93 Difference]: Finished difference Result 3937 states and 10260 transitions. [2019-12-18 17:03:08,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 17:03:08,617 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-12-18 17:03:08,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:08,622 INFO L225 Difference]: With dead ends: 3937 [2019-12-18 17:03:08,623 INFO L226 Difference]: Without dead ends: 3937 [2019-12-18 17:03:08,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2019-12-18 17:03:08,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2019-12-18 17:03:08,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 2753. [2019-12-18 17:03:08,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2753 states. [2019-12-18 17:03:08,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2753 states to 2753 states and 7272 transitions. [2019-12-18 17:03:08,656 INFO L78 Accepts]: Start accepts. Automaton has 2753 states and 7272 transitions. Word has length 73 [2019-12-18 17:03:08,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:08,657 INFO L462 AbstractCegarLoop]: Abstraction has 2753 states and 7272 transitions. [2019-12-18 17:03:08,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:03:08,657 INFO L276 IsEmpty]: Start isEmpty. Operand 2753 states and 7272 transitions. [2019-12-18 17:03:08,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 17:03:08,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:08,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:08,660 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:08,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:08,661 INFO L82 PathProgramCache]: Analyzing trace with hash 1787574207, now seen corresponding path program 2 times [2019-12-18 17:03:08,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:08,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32864795] [2019-12-18 17:03:08,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:08,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:08,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32864795] [2019-12-18 17:03:08,782 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:08,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 17:03:08,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600870332] [2019-12-18 17:03:08,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:03:08,783 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:08,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:03:08,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:03:08,783 INFO L87 Difference]: Start difference. First operand 2753 states and 7272 transitions. Second operand 7 states. [2019-12-18 17:03:09,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:09,173 INFO L93 Difference]: Finished difference Result 4748 states and 12397 transitions. [2019-12-18 17:03:09,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 17:03:09,174 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-18 17:03:09,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:09,181 INFO L225 Difference]: With dead ends: 4748 [2019-12-18 17:03:09,181 INFO L226 Difference]: Without dead ends: 4748 [2019-12-18 17:03:09,181 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 4 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:03:09,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4748 states. [2019-12-18 17:03:09,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4748 to 3269. [2019-12-18 17:03:09,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3269 states. [2019-12-18 17:03:09,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3269 states to 3269 states and 8628 transitions. [2019-12-18 17:03:09,239 INFO L78 Accepts]: Start accepts. Automaton has 3269 states and 8628 transitions. Word has length 73 [2019-12-18 17:03:09,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:09,239 INFO L462 AbstractCegarLoop]: Abstraction has 3269 states and 8628 transitions. [2019-12-18 17:03:09,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:03:09,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3269 states and 8628 transitions. [2019-12-18 17:03:09,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 17:03:09,245 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:09,245 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:09,246 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:09,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:09,246 INFO L82 PathProgramCache]: Analyzing trace with hash 109680953, now seen corresponding path program 3 times [2019-12-18 17:03:09,246 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:09,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525139815] [2019-12-18 17:03:09,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:09,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:09,408 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525139815] [2019-12-18 17:03:09,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:09,409 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 17:03:09,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421745500] [2019-12-18 17:03:09,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 17:03:09,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:09,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 17:03:09,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 17:03:09,410 INFO L87 Difference]: Start difference. First operand 3269 states and 8628 transitions. Second operand 7 states. [2019-12-18 17:03:09,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:09,728 INFO L93 Difference]: Finished difference Result 3871 states and 10173 transitions. [2019-12-18 17:03:09,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 17:03:09,728 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2019-12-18 17:03:09,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:09,734 INFO L225 Difference]: With dead ends: 3871 [2019-12-18 17:03:09,734 INFO L226 Difference]: Without dead ends: 3871 [2019-12-18 17:03:09,734 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 6 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:03:09,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3871 states. [2019-12-18 17:03:09,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3871 to 3497. [2019-12-18 17:03:09,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3497 states. [2019-12-18 17:03:09,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3497 states to 3497 states and 9202 transitions. [2019-12-18 17:03:09,775 INFO L78 Accepts]: Start accepts. Automaton has 3497 states and 9202 transitions. Word has length 73 [2019-12-18 17:03:09,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:09,775 INFO L462 AbstractCegarLoop]: Abstraction has 3497 states and 9202 transitions. [2019-12-18 17:03:09,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 17:03:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand 3497 states and 9202 transitions. [2019-12-18 17:03:09,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 17:03:09,780 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:09,780 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:09,780 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:09,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:09,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1705541091, now seen corresponding path program 4 times [2019-12-18 17:03:09,781 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:09,781 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122402093] [2019-12-18 17:03:09,781 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:09,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:10,012 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122402093] [2019-12-18 17:03:10,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:10,012 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 17:03:10,013 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680716314] [2019-12-18 17:03:10,013 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 17:03:10,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:10,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 17:03:10,014 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 17:03:10,014 INFO L87 Difference]: Start difference. First operand 3497 states and 9202 transitions. Second operand 10 states. [2019-12-18 17:03:11,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:11,021 INFO L93 Difference]: Finished difference Result 6053 states and 15712 transitions. [2019-12-18 17:03:11,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 17:03:11,021 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 73 [2019-12-18 17:03:11,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:11,031 INFO L225 Difference]: With dead ends: 6053 [2019-12-18 17:03:11,031 INFO L226 Difference]: Without dead ends: 6053 [2019-12-18 17:03:11,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=229, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:03:11,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6053 states. [2019-12-18 17:03:11,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6053 to 3323. [2019-12-18 17:03:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3323 states. [2019-12-18 17:03:11,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3323 states to 3323 states and 8713 transitions. [2019-12-18 17:03:11,129 INFO L78 Accepts]: Start accepts. Automaton has 3323 states and 8713 transitions. Word has length 73 [2019-12-18 17:03:11,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:11,130 INFO L462 AbstractCegarLoop]: Abstraction has 3323 states and 8713 transitions. [2019-12-18 17:03:11,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 17:03:11,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3323 states and 8713 transitions. [2019-12-18 17:03:11,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-12-18 17:03:11,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:11,138 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:11,138 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:11,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:11,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1431998849, now seen corresponding path program 5 times [2019-12-18 17:03:11,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:11,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920315335] [2019-12-18 17:03:11,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:11,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:11,391 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920315335] [2019-12-18 17:03:11,391 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:11,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:03:11,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247482795] [2019-12-18 17:03:11,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-18 17:03:11,392 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:11,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-18 17:03:11,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:03:11,392 INFO L87 Difference]: Start difference. First operand 3323 states and 8713 transitions. Second operand 9 states. [2019-12-18 17:03:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:12,149 INFO L93 Difference]: Finished difference Result 5062 states and 13118 transitions. [2019-12-18 17:03:12,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-18 17:03:12,150 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 73 [2019-12-18 17:03:12,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:12,157 INFO L225 Difference]: With dead ends: 5062 [2019-12-18 17:03:12,157 INFO L226 Difference]: Without dead ends: 5062 [2019-12-18 17:03:12,158 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2019-12-18 17:03:12,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5062 states. [2019-12-18 17:03:12,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5062 to 2875. [2019-12-18 17:03:12,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2875 states. [2019-12-18 17:03:12,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2875 states to 2875 states and 7549 transitions. [2019-12-18 17:03:12,220 INFO L78 Accepts]: Start accepts. Automaton has 2875 states and 7549 transitions. Word has length 73 [2019-12-18 17:03:12,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:12,221 INFO L462 AbstractCegarLoop]: Abstraction has 2875 states and 7549 transitions. [2019-12-18 17:03:12,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-18 17:03:12,221 INFO L276 IsEmpty]: Start isEmpty. Operand 2875 states and 7549 transitions. [2019-12-18 17:03:12,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 17:03:12,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:12,227 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:12,227 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:12,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:12,227 INFO L82 PathProgramCache]: Analyzing trace with hash 95378273, now seen corresponding path program 1 times [2019-12-18 17:03:12,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:12,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135600793] [2019-12-18 17:03:12,228 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:12,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:12,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135600793] [2019-12-18 17:03:12,417 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:12,417 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 17:03:12,417 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535385347] [2019-12-18 17:03:12,417 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 17:03:12,418 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:12,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 17:03:12,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 17:03:12,419 INFO L87 Difference]: Start difference. First operand 2875 states and 7549 transitions. Second operand 6 states. [2019-12-18 17:03:12,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:12,566 INFO L93 Difference]: Finished difference Result 4599 states and 11354 transitions. [2019-12-18 17:03:12,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 17:03:12,566 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-18 17:03:12,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:12,570 INFO L225 Difference]: With dead ends: 4599 [2019-12-18 17:03:12,570 INFO L226 Difference]: Without dead ends: 1951 [2019-12-18 17:03:12,570 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-18 17:03:12,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1951 states. [2019-12-18 17:03:12,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1951 to 1647. [2019-12-18 17:03:12,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1647 states. [2019-12-18 17:03:12,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1647 states to 1647 states and 3644 transitions. [2019-12-18 17:03:12,591 INFO L78 Accepts]: Start accepts. Automaton has 1647 states and 3644 transitions. Word has length 74 [2019-12-18 17:03:12,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:12,591 INFO L462 AbstractCegarLoop]: Abstraction has 1647 states and 3644 transitions. [2019-12-18 17:03:12,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 17:03:12,591 INFO L276 IsEmpty]: Start isEmpty. Operand 1647 states and 3644 transitions. [2019-12-18 17:03:12,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 17:03:12,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:12,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:12,595 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:12,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:12,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1817677093, now seen corresponding path program 2 times [2019-12-18 17:03:12,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:12,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923047010] [2019-12-18 17:03:12,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:12,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:12,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:12,681 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923047010] [2019-12-18 17:03:12,682 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:12,682 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 17:03:12,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269729416] [2019-12-18 17:03:12,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 17:03:12,683 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:12,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 17:03:12,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 17:03:12,683 INFO L87 Difference]: Start difference. First operand 1647 states and 3644 transitions. Second operand 4 states. [2019-12-18 17:03:12,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:12,709 INFO L93 Difference]: Finished difference Result 1840 states and 3986 transitions. [2019-12-18 17:03:12,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 17:03:12,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 74 [2019-12-18 17:03:12,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:12,710 INFO L225 Difference]: With dead ends: 1840 [2019-12-18 17:03:12,710 INFO L226 Difference]: Without dead ends: 271 [2019-12-18 17:03:12,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 17:03:12,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2019-12-18 17:03:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2019-12-18 17:03:12,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2019-12-18 17:03:12,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 458 transitions. [2019-12-18 17:03:12,715 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 458 transitions. Word has length 74 [2019-12-18 17:03:12,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:12,715 INFO L462 AbstractCegarLoop]: Abstraction has 271 states and 458 transitions. [2019-12-18 17:03:12,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 17:03:12,715 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 458 transitions. [2019-12-18 17:03:12,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 17:03:12,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:12,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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:12,716 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:12,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:12,717 INFO L82 PathProgramCache]: Analyzing trace with hash -398575509, now seen corresponding path program 3 times [2019-12-18 17:03:12,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:12,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729600208] [2019-12-18 17:03:12,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 17:03:12,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 17:03:12,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729600208] [2019-12-18 17:03:12,914 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 17:03:12,914 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 17:03:12,914 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221322094] [2019-12-18 17:03:12,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 17:03:12,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 17:03:12,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 17:03:12,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2019-12-18 17:03:12,915 INFO L87 Difference]: Start difference. First operand 271 states and 458 transitions. Second operand 11 states. [2019-12-18 17:03:13,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 17:03:13,283 INFO L93 Difference]: Finished difference Result 419 states and 701 transitions. [2019-12-18 17:03:13,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 17:03:13,283 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2019-12-18 17:03:13,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 17:03:13,285 INFO L225 Difference]: With dead ends: 419 [2019-12-18 17:03:13,285 INFO L226 Difference]: Without dead ends: 389 [2019-12-18 17:03:13,285 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2019-12-18 17:03:13,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2019-12-18 17:03:13,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 379. [2019-12-18 17:03:13,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 379 states. [2019-12-18 17:03:13,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 643 transitions. [2019-12-18 17:03:13,290 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 643 transitions. Word has length 74 [2019-12-18 17:03:13,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 17:03:13,290 INFO L462 AbstractCegarLoop]: Abstraction has 379 states and 643 transitions. [2019-12-18 17:03:13,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 17:03:13,290 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 643 transitions. [2019-12-18 17:03:13,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 17:03:13,291 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 17:03:13,291 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 17:03:13,291 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 17:03:13,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 17:03:13,291 INFO L82 PathProgramCache]: Analyzing trace with hash 2034928915, now seen corresponding path program 4 times [2019-12-18 17:03:13,291 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 17:03:13,292 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767359934] [2019-12-18 17:03:13,292 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 17:03:13,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:03:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 17:03:13,443 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 17:03:13,443 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 17:03:13,449 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1037] [1037] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= v_~y$r_buff1_thd1~0_137 0) (= v_~y$flush_delayed~0_201 0) (= v_~y$r_buff1_thd0~0_323 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t766~0.base_27| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t766~0.base_27|) |v_ULTIMATE.start_main_~#t766~0.offset_21| 0)) |v_#memory_int_23|) (= 0 v_~y$r_buff0_thd2~0_124) (= v_~y$w_buff1_used~0_443 0) (= 0 v_~y$r_buff1_thd3~0_282) (= 0 v_~y$r_buff0_thd3~0_461) (= v_~y$read_delayed~0_7 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t766~0.base_27|) (= (store .cse0 |v_ULTIMATE.start_main_~#t766~0.base_27| 1) |v_#valid_61|) (= 0 v_~y$w_buff0~0_180) (= v_~main$tmp_guard1~0_34 0) (< 0 |v_#StackHeapBarrier_17|) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t766~0.base_27| 4) |v_#length_25|) (= 0 v_~y$r_buff1_thd2~0_202) (= v_~y$r_buff0_thd0~0_357 0) (= v_~y$r_buff0_thd1~0_62 0) (= v_~__unbuffered_p2_EBX~0_22 0) (= |v_ULTIMATE.start_main_~#t766~0.offset_21| 0) (= v_~y~0_276 0) (= v_~z~0_23 0) (= v_~weak$$choice2~0_236 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$w_buff1~0_183 0) (= |v_#NULL.offset_5| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t766~0.base_27|) 0) (= v_~y$mem_tmp~0_174 0) (= v_~main$tmp_guard0~0_26 0) (= 0 v_~__unbuffered_cnt~0_86) (= 0 v_~__unbuffered_p2_EAX~0_30) (= v_~x~0_36 0) (= v_~y$w_buff0_used~0_864 0) (= 0 |v_#NULL.base_5|) (= 0 v_~weak$$choice0~0_159))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_24|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t766~0.base=|v_ULTIMATE.start_main_~#t766~0.base_27|, #NULL.offset=|v_#NULL.offset_5|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_27|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_46|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_65|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_45|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_31|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_30|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_25|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_52|, ~y$mem_tmp~0=v_~y$mem_tmp~0_174, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_282, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_62, ~y$flush_delayed~0=v_~y$flush_delayed~0_201, #length=|v_#length_25|, ULTIMATE.start_main_#t~nondet48=|v_ULTIMATE.start_main_#t~nondet48_53|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_30, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~nondet47=|v_ULTIMATE.start_main_#t~nondet47_53|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_45|, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_76|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_122|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_29|, ~weak$$choice0~0=v_~weak$$choice0~0_159, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_44|, ULTIMATE.start_main_~#t767~0.offset=|v_ULTIMATE.start_main_~#t767~0.offset_16|, ~y$w_buff1~0=v_~y$w_buff1~0_183, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ULTIMATE.start_main_~#t766~0.offset=|v_ULTIMATE.start_main_~#t766~0.offset_21|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_323, ~x~0=v_~x~0_36, ULTIMATE.start_main_~#t768~0.offset=|v_ULTIMATE.start_main_~#t768~0.offset_15|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_864, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_65|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_34, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_53|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_29|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_55|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_75|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_38|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_137, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_46|, ULTIMATE.start_main_~#t768~0.base=|v_ULTIMATE.start_main_~#t768~0.base_18|, ~y$w_buff0~0=v_~y$w_buff0~0_180, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_461, ~y~0=v_~y~0_276, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_25|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_36|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_39|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_26, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_58|, #NULL.base=|v_#NULL.base_5|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_84|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_27|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_202, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_35|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_43|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_21|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_357, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ULTIMATE.start_main_~#t767~0.base=|v_ULTIMATE.start_main_~#t767~0.base_19|, ~z~0=v_~z~0_23, ~weak$$choice2~0=v_~weak$$choice2~0_236, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_443} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t766~0.base, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite52, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_#t~nondet48, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet47, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ULTIMATE.start_main_~#t767~0.offset, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t766~0.offset, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t768~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t768~0.base, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ~y~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t767~0.base, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 17:03:13,450 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L818-1-->L820: Formula: (and (= |v_#valid_33| (store |v_#valid_34| |v_ULTIMATE.start_main_~#t767~0.base_11| 1)) (= |v_ULTIMATE.start_main_~#t767~0.offset_11| 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t767~0.base_11| 4)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t767~0.base_11|) (= 0 (select |v_#valid_34| |v_ULTIMATE.start_main_~#t767~0.base_11|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t767~0.base_11| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t767~0.base_11|) |v_ULTIMATE.start_main_~#t767~0.offset_11| 1)) |v_#memory_int_15|) (not (= |v_ULTIMATE.start_main_~#t767~0.base_11| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t767~0.offset=|v_ULTIMATE.start_main_~#t767~0.offset_11|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_17|, ULTIMATE.start_main_~#t767~0.base=|v_ULTIMATE.start_main_~#t767~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t767~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t767~0.base] because there is no mapped edge [2019-12-18 17:03:13,451 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L820-1-->L822: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t768~0.base_12|)) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t768~0.base_12| 1)) (= |v_ULTIMATE.start_main_~#t768~0.offset_10| 0) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t768~0.base_12|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t768~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t768~0.base_12|) |v_ULTIMATE.start_main_~#t768~0.offset_10| 2)) |v_#memory_int_13|) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t768~0.base_12|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t768~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t768~0.base=|v_ULTIMATE.start_main_~#t768~0.base_12|, ULTIMATE.start_main_~#t768~0.offset=|v_ULTIMATE.start_main_~#t768~0.offset_10|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t768~0.base, ULTIMATE.start_main_~#t768~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-18 17:03:13,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [948] [948] L4-->L780: Formula: (and (= 1 v_~y$r_buff0_thd3~0_204) (= v_~weak$$choice2~0_87 v_~y$flush_delayed~0_53) (= |v_P2Thread1of1ForFork1_#t~nondet10_46| v_~weak$$choice2~0_87) (= v_~y$r_buff0_thd2~0_62 v_~y$r_buff1_thd2~0_57) (not (= v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_8 0)) (= |v_P2Thread1of1ForFork1_#t~nondet9_46| v_~weak$$choice0~0_41) (= v_~y$r_buff0_thd3~0_205 v_~y$r_buff1_thd3~0_107) (= v_~y~0_105 v_~y$mem_tmp~0_43) (= v_~y$r_buff0_thd0~0_153 v_~y$r_buff1_thd0~0_106) (= v_~y$r_buff0_thd1~0_24 v_~y$r_buff1_thd1~0_24)) InVars {P2Thread1of1ForFork1_#t~nondet10=|v_P2Thread1of1ForFork1_#t~nondet10_46|, P2Thread1of1ForFork1_#t~nondet9=|v_P2Thread1of1ForFork1_#t~nondet9_46|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_205, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_153, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y~0=v_~y~0_105, P2Thread1of1ForFork1___VERIFIER_assert_~expression=v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_8} OutVars{P2Thread1of1ForFork1_#t~nondet10=|v_P2Thread1of1ForFork1_#t~nondet10_45|, P2Thread1of1ForFork1_#t~nondet9=|v_P2Thread1of1ForFork1_#t~nondet9_45|, P2Thread1of1ForFork1___VERIFIER_assert_~expression=v_P2Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_57, ~weak$$choice0~0=v_~weak$$choice0~0_41, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_24, ~y$mem_tmp~0=v_~y$mem_tmp~0_43, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_107, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_204, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_153, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_62, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_24, ~y$flush_delayed~0=v_~y$flush_delayed~0_53, ~y~0=v_~y~0_105, ~weak$$choice2~0=v_~weak$$choice2~0_87, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_106} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~nondet10, P2Thread1of1ForFork1_#t~nondet9, ~y$r_buff0_thd3~0, ~y$flush_delayed~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 17:03:13,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [955] [955] L780-2-->L780-5: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd3~0_In-910441930 256) 0)) (.cse0 (= |P2Thread1of1ForFork1_#t~ite11_Out-910441930| |P2Thread1of1ForFork1_#t~ite12_Out-910441930|)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-910441930 256)))) (or (and .cse0 (= |P2Thread1of1ForFork1_#t~ite11_Out-910441930| ~y$w_buff1~0_In-910441930) (or .cse1 .cse2)) (and (not .cse2) (= ~y$w_buff0~0_In-910441930 |P2Thread1of1ForFork1_#t~ite11_Out-910441930|) .cse0 (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-910441930, ~y$w_buff1~0=~y$w_buff1~0_In-910441930, ~y$w_buff0~0=~y$w_buff0~0_In-910441930, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-910441930} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-910441930, ~y$w_buff1~0=~y$w_buff1~0_In-910441930, P2Thread1of1ForFork1_#t~ite11=|P2Thread1of1ForFork1_#t~ite11_Out-910441930|, ~y$w_buff0~0=~y$w_buff0~0_In-910441930, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-910441930, P2Thread1of1ForFork1_#t~ite12=|P2Thread1of1ForFork1_#t~ite12_Out-910441930|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite11, P2Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 17:03:13,463 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L785-->L786: Formula: (and (not (= (mod v_~weak$$choice2~0_81 256) 0)) (= v_~y$r_buff0_thd3~0_181 v_~y$r_buff0_thd3~0_180)) InVars {~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_181, ~weak$$choice2~0=v_~weak$$choice2~0_81} OutVars{P2Thread1of1ForFork1_#t~ite25=|v_P2Thread1of1ForFork1_#t~ite25_13|, P2Thread1of1ForFork1_#t~ite26=|v_P2Thread1of1ForFork1_#t~ite26_12|, P2Thread1of1ForFork1_#t~ite27=|v_P2Thread1of1ForFork1_#t~ite27_10|, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_180, ~weak$$choice2~0=v_~weak$$choice2~0_81} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite25, P2Thread1of1ForFork1_#t~ite26, P2Thread1of1ForFork1_#t~ite27, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 17:03:13,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [956] [956] L788-->L788-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-1798519105 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-1798519105 |P2Thread1of1ForFork1_#t~ite31_Out-1798519105|)) (and .cse0 (= ~y~0_In-1798519105 |P2Thread1of1ForFork1_#t~ite31_Out-1798519105|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1798519105, ~y$flush_delayed~0=~y$flush_delayed~0_In-1798519105, ~y~0=~y~0_In-1798519105} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1798519105, P2Thread1of1ForFork1_#t~ite31=|P2Thread1of1ForFork1_#t~ite31_Out-1798519105|, ~y$flush_delayed~0=~y$flush_delayed~0_In-1798519105, ~y~0=~y~0_In-1798519105} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite31] because there is no mapped edge [2019-12-18 17:03:13,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] P0ENTRY-->P0EXIT: Formula: (and (= v_~z~0_19 1) (= (+ v_~__unbuffered_cnt~0_71 1) v_~__unbuffered_cnt~0_70) (= |v_P0Thread1of1ForFork2_#res.base_11| 0) (= 0 |v_P0Thread1of1ForFork2_#res.offset_11|) (= v_~x~0_21 1) (= v_P0Thread1of1ForFork2_~arg.base_13 |v_P0Thread1of1ForFork2_#in~arg.base_13|) (= |v_P0Thread1of1ForFork2_#in~arg.offset_13| v_P0Thread1of1ForFork2_~arg.offset_13)) InVars {P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|} OutVars{P0Thread1of1ForFork2_#in~arg.offset=|v_P0Thread1of1ForFork2_#in~arg.offset_13|, P0Thread1of1ForFork2_~arg.offset=v_P0Thread1of1ForFork2_~arg.offset_13, P0Thread1of1ForFork2_#res.offset=|v_P0Thread1of1ForFork2_#res.offset_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_70, P0Thread1of1ForFork2_#in~arg.base=|v_P0Thread1of1ForFork2_#in~arg.base_13|, P0Thread1of1ForFork2_#res.base=|v_P0Thread1of1ForFork2_#res.base_11|, ~z~0=v_~z~0_19, ~x~0=v_~x~0_21, P0Thread1of1ForFork2_~arg.base=v_P0Thread1of1ForFork2_~arg.base_13} AuxVars[] AssignedVars[P0Thread1of1ForFork2_~arg.offset, P0Thread1of1ForFork2_#res.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork2_#res.base, ~z~0, ~x~0, P0Thread1of1ForFork2_~arg.base] because there is no mapped edge [2019-12-18 17:03:13,467 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [965] [965] L796-->L796-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1173999394 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd3~0_In-1173999394 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out-1173999394| 0) (not .cse0) (not .cse1)) (and (= ~y$w_buff0_used~0_In-1173999394 |P2Thread1of1ForFork1_#t~ite34_Out-1173999394|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1173999394, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1173999394} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1173999394, P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1173999394|, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1173999394} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-18 17:03:13,468 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [967] [967] L750-2-->L750-5: Formula: (let ((.cse1 (= |P1Thread1of1ForFork0_#t~ite4_Out2036349772| |P1Thread1of1ForFork0_#t~ite3_Out2036349772|)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In2036349772 256))) (.cse2 (= (mod ~y$r_buff1_thd2~0_In2036349772 256) 0))) (or (and (not .cse0) .cse1 (not .cse2) (= ~y$w_buff1~0_In2036349772 |P1Thread1of1ForFork0_#t~ite3_Out2036349772|)) (and (= |P1Thread1of1ForFork0_#t~ite3_Out2036349772| ~y~0_In2036349772) .cse1 (or .cse0 .cse2)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2036349772, ~y$w_buff1~0=~y$w_buff1~0_In2036349772, ~y~0=~y~0_In2036349772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2036349772} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In2036349772, ~y$w_buff1~0=~y$w_buff1~0_In2036349772, P1Thread1of1ForFork0_#t~ite3=|P1Thread1of1ForFork0_#t~ite3_Out2036349772|, ~y~0=~y~0_In2036349772, P1Thread1of1ForFork0_#t~ite4=|P1Thread1of1ForFork0_#t~ite4_Out2036349772|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2036349772} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite3, P1Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 17:03:13,469 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [982] [982] L751-->L751-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1082336141 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1082336141 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork0_#t~ite5_Out-1082336141|) (not .cse1)) (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1082336141 |P1Thread1of1ForFork0_#t~ite5_Out-1082336141|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1082336141, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1082336141} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1082336141, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1082336141, P1Thread1of1ForFork0_#t~ite5=|P1Thread1of1ForFork0_#t~ite5_Out-1082336141|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 17:03:13,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [983] [983] L752-->L752-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-1486160975 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-1486160975 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd2~0_In-1486160975 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1486160975 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite6_Out-1486160975|)) (and (= ~y$w_buff1_used~0_In-1486160975 |P1Thread1of1ForFork0_#t~ite6_Out-1486160975|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1486160975, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1486160975, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1486160975, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1486160975} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1486160975, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1486160975, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1486160975, P1Thread1of1ForFork0_#t~ite6=|P1Thread1of1ForFork0_#t~ite6_Out-1486160975|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1486160975} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 17:03:13,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [966] [966] L753-->L753-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In866048873 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In866048873 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite7_Out866048873| ~y$r_buff0_thd2~0_In866048873)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork0_#t~ite7_Out866048873| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In866048873, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In866048873} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In866048873, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In866048873, P1Thread1of1ForFork0_#t~ite7=|P1Thread1of1ForFork0_#t~ite7_Out866048873|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 17:03:13,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [984] [984] L754-->L754-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd2~0_In-63312333 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-63312333 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-63312333 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-63312333 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork0_#t~ite8_Out-63312333| ~y$r_buff1_thd2~0_In-63312333)) (and (= |P1Thread1of1ForFork0_#t~ite8_Out-63312333| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-63312333, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-63312333, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-63312333, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-63312333} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-63312333, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-63312333, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-63312333, P1Thread1of1ForFork0_#t~ite8=|P1Thread1of1ForFork0_#t~ite8_Out-63312333|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-63312333} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 17:03:13,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [992] [992] L754-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd2~0_75 |v_P1Thread1of1ForFork0_#t~ite8_28|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_42 1) v_~__unbuffered_cnt~0_41)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_42, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_28|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_75, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_41, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#t~ite8=|v_P1Thread1of1ForFork0_#t~ite8_27|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#t~ite8, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 17:03:13,473 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [958] [958] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-799760244 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In-799760244 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-799760244 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd3~0_In-799760244 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork1_#t~ite35_Out-799760244|)) (and (or .cse1 .cse0) (= ~y$w_buff1_used~0_In-799760244 |P2Thread1of1ForFork1_#t~ite35_Out-799760244|) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-799760244, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-799760244, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-799760244, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-799760244} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-799760244|, ~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-799760244, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-799760244, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-799760244, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-799760244} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-18 17:03:13,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [962] [962] L798-->L799: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In396068705 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In396068705 256)))) (or (and (= ~y$r_buff0_thd3~0_In396068705 ~y$r_buff0_thd3~0_Out396068705) (or .cse0 .cse1)) (and (= 0 ~y$r_buff0_thd3~0_Out396068705) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In396068705, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In396068705} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out396068705|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In396068705, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out396068705} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-18 17:03:13,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [963] [963] L799-->L799-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In1989418414 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In1989418414 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1989418414 256))) (.cse1 (= (mod ~y$r_buff1_thd3~0_In1989418414 256) 0))) (or (and (= ~y$r_buff1_thd3~0_In1989418414 |P2Thread1of1ForFork1_#t~ite37_Out1989418414|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out1989418414|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1989418414, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1989418414, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1989418414, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1989418414} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1989418414, P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1989418414|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1989418414, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1989418414, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1989418414} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 17:03:13,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= |v_P2Thread1of1ForFork1_#t~ite37_34| v_~y$r_buff1_thd3~0_143) (= (+ v_~__unbuffered_cnt~0_64 1) v_~__unbuffered_cnt~0_63)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_64} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_143, P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_33|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_63, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-18 17:03:13,474 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [930] [930] L822-1-->L828: Formula: (and (= 3 v_~__unbuffered_cnt~0_20) (= v_~main$tmp_guard0~0_9 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 17:03:13,475 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] L828-2-->L828-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In2036758467 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In2036758467 256)))) (or (and (= ~y~0_In2036758467 |ULTIMATE.start_main_#t~ite41_Out2036758467|) (or .cse0 .cse1)) (and (= ~y$w_buff1~0_In2036758467 |ULTIMATE.start_main_#t~ite41_Out2036758467|) (not .cse0) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In2036758467, ~y~0=~y~0_In2036758467, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2036758467, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2036758467} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out2036758467|, ~y$w_buff1~0=~y$w_buff1~0_In2036758467, ~y~0=~y~0_In2036758467, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In2036758467, ~y$w_buff1_used~0=~y$w_buff1_used~0_In2036758467} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-18 17:03:13,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [922] [922] L828-4-->L829: Formula: (= v_~y~0_57 |v_ULTIMATE.start_main_#t~ite41_9|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_9|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_8|, ~y~0=v_~y~0_57, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 17:03:13,476 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [977] [977] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1719807460 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd0~0_In-1719807460 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out-1719807460| 0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1719807460 |ULTIMATE.start_main_#t~ite43_Out-1719807460|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1719807460, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1719807460} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1719807460, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1719807460, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-1719807460|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-18 17:03:13,477 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [979] [979] L830-->L830-2: Formula: (let ((.cse3 (= (mod ~y$r_buff0_thd0~0_In869132902 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In869132902 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In869132902 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In869132902 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out869132902| ~y$w_buff1_used~0_In869132902) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite44_Out869132902| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In869132902, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In869132902, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In869132902, ~y$w_buff1_used~0=~y$w_buff1_used~0_In869132902} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In869132902, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In869132902, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In869132902, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out869132902|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In869132902} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 17:03:13,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [981] [981] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2072147960 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In2072147960 256) 0))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out2072147960| 0)) (and (= |ULTIMATE.start_main_#t~ite45_Out2072147960| ~y$r_buff0_thd0~0_In2072147960) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2072147960, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2072147960} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In2072147960, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In2072147960, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2072147960|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 17:03:13,478 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L832-->L832-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In298189772 256))) (.cse2 (= (mod ~y$r_buff0_thd0~0_In298189772 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In298189772 256))) (.cse0 (= (mod ~y$r_buff1_thd0~0_In298189772 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite46_Out298189772| 0)) (and (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In298189772 |ULTIMATE.start_main_#t~ite46_Out298189772|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In298189772, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In298189772, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In298189772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In298189772} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In298189772, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In298189772, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out298189772|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In298189772, ~y$w_buff1_used~0=~y$w_buff1_used~0_In298189772} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 17:03:13,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [975] [975] L847-->L847-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In295655253 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite69_Out295655253| ~y$mem_tmp~0_In295655253)) (and .cse0 (= |ULTIMATE.start_main_#t~ite69_Out295655253| ~y~0_In295655253)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In295655253, ~y$flush_delayed~0=~y$flush_delayed~0_In295655253, ~y~0=~y~0_In295655253} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In295655253, ~y$flush_delayed~0=~y$flush_delayed~0_In295655253, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out295655253|, ~y~0=~y~0_In295655253} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-18 17:03:13,490 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L847-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y~0_265 |v_ULTIMATE.start_main_#t~ite69_41|) (= v_~y$flush_delayed~0_194 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= (mod v_~main$tmp_guard1~0_27 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|)) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_41|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~y$flush_delayed~0=v_~y$flush_delayed~0_194, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_27, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_40|, ~y~0=v_~y~0_265, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ULTIMATE.start_main_#t~ite69, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 17:03:13,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 05:03:13 BasicIcfg [2019-12-18 17:03:13,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 17:03:13,609 INFO L168 Benchmark]: Toolchain (without parser) took 45778.17 ms. Allocated memory was 144.7 MB in the beginning and 1.7 GB in the end (delta: 1.6 GB). Free memory was 99.5 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 392.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:03:13,609 INFO L168 Benchmark]: CDTParser took 0.72 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 17:03:13,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 823.51 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 99.2 MB in the beginning and 155.3 MB in the end (delta: -56.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-18 17:03:13,611 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.08 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 151.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:03:13,612 INFO L168 Benchmark]: Boogie Preprocessor took 45.30 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 148.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 17:03:13,612 INFO L168 Benchmark]: RCFGBuilder took 925.45 ms. Allocated memory is still 202.4 MB. Free memory was 148.6 MB in the beginning and 90.8 MB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 7.1 GB. [2019-12-18 17:03:13,613 INFO L168 Benchmark]: TraceAbstraction took 43898.33 ms. Allocated memory was 202.4 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 90.1 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 325.3 MB. Max. memory is 7.1 GB. [2019-12-18 17:03:13,622 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.72 ms. Allocated memory is still 144.7 MB. Free memory was 119.8 MB in the beginning and 119.6 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 823.51 ms. Allocated memory was 144.7 MB in the beginning and 202.4 MB in the end (delta: 57.7 MB). Free memory was 99.2 MB in the beginning and 155.3 MB in the end (delta: -56.0 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 80.08 ms. Allocated memory is still 202.4 MB. Free memory was 154.6 MB in the beginning and 151.3 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 45.30 ms. Allocated memory is still 202.4 MB. Free memory was 151.3 MB in the beginning and 148.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 925.45 ms. Allocated memory is still 202.4 MB. Free memory was 148.6 MB in the beginning and 90.8 MB in the end (delta: 57.8 MB). Peak memory consumption was 57.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 43898.33 ms. Allocated memory was 202.4 MB in the beginning and 1.7 GB in the end (delta: 1.5 GB). Free memory was 90.1 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 325.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.1s, 205 ProgramPointsBefore, 120 ProgramPointsAfterwards, 257 TransitionsBefore, 143 TransitionsAfterwards, 26988 CoEnabledTransitionPairs, 8 FixpointIterations, 32 TrivialSequentialCompositions, 39 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 56 ConcurrentYvCompositions, 33 ChoiceCompositions, 9380 VarBasedMoverChecksPositive, 296 VarBasedMoverChecksNegative, 65 SemBasedMoverChecksPositive, 320 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 165402 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t766, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t767, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L822] FCALL, FORK 0 pthread_create(&t768, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L764] 3 y$w_buff1 = y$w_buff0 [L765] 3 y$w_buff0 = 2 [L766] 3 y$w_buff1_used = y$w_buff0_used [L767] 3 y$w_buff0_used = (_Bool)1 [L780] EXPR 3 !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L780] 3 y = !y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff1) [L781] EXPR 3 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L781] 3 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : y$w_buff0)) [L782] EXPR 3 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L782] 3 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff1 : y$w_buff1)) [L783] EXPR 3 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used)) [L784] EXPR 3 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L784] 3 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L786] EXPR 3 weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L786] 3 y$r_buff1_thd3 = weak$$choice2 ? y$r_buff1_thd3 : (!y$w_buff0_used || !y$r_buff0_thd3 && !y$w_buff1_used || !y$r_buff0_thd3 && !y$r_buff1_thd3 ? y$r_buff1_thd3 : (y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L787] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=2, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y = y$flush_delayed ? y$mem_tmp : y [L789] 3 y$flush_delayed = (_Bool)0 [L792] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 2 x = 2 [L747] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L795] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L750] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L750] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L751] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L752] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L753] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L796] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L797] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L828] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L829] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L830] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L831] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L832] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L835] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L836] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L837] 0 y$flush_delayed = weak$$choice2 [L838] 0 y$mem_tmp = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L839] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L840] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L840] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L841] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L841] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L842] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L842] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L843] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L843] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L844] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L844] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L845] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L845] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L846] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 196 locations, 2 error locations. Result: UNSAFE, OverallTime: 43.5s, OverallIterations: 24, TraceHistogramMax: 1, AutomataDifference: 16.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4681 SDtfs, 5062 SDslu, 12443 SDs, 0 SdLazy, 7193 SolverSat, 386 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 299 GetRequests, 96 SyntacticMatches, 39 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=87886occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 12.4s AutomataMinimizationTime, 23 MinimizatonAttempts, 20129 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1453 NumberOfCodeBlocks, 1453 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 1356 ConstructedInterpolants, 0 QuantifiedInterpolants, 285574 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 23 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...