/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:43:06,461 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:43:06,464 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:43:06,483 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:43:06,483 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:43:06,485 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:43:06,487 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:43:06,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:43:06,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:43:06,503 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:43:06,505 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:43:06,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:43:06,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:43:06,509 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:43:06,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:43:06,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:43:06,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:43:06,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:43:06,517 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:43:06,522 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:43:06,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:43:06,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:43:06,526 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:43:06,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:43:06,530 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:43:06,530 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:43:06,530 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:43:06,532 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:43:06,533 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:43:06,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:43:06,534 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:43:06,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:43:06,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:43:06,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:43:06,539 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:43:06,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:43:06,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:43:06,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:43:06,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:43:06,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:43:06,544 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:43:06,545 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:43:06,576 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:43:06,576 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:43:06,577 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:43:06,577 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:43:06,578 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:43:06,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:43:06,578 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:43:06,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:43:06,578 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:43:06,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:43:06,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:43:06,583 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:43:06,583 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:43:06,583 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:43:06,584 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:43:06,584 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:43:06,584 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:43:06,584 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:43:06,584 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:43:06,585 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:43:06,585 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:43:06,585 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:43:06,585 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:43:06,586 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:43:06,589 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:43:06,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:43:06,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:43:06,590 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:43:06,590 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:43:06,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:43:06,854 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:43:06,868 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:43:06,872 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:43:06,873 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:43:06,874 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:43:06,875 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.opt.i [2019-12-26 23:43:06,947 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20e494b67/888633818101450cb56c8c922347ebc1/FLAG0039157d5 [2019-12-26 23:43:07,555 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:43:07,556 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.opt.i [2019-12-26 23:43:07,578 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20e494b67/888633818101450cb56c8c922347ebc1/FLAG0039157d5 [2019-12-26 23:43:07,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/20e494b67/888633818101450cb56c8c922347ebc1 [2019-12-26 23:43:07,880 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:43:07,882 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:43:07,883 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:43:07,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:43:07,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:43:07,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:43:07" (1/1) ... [2019-12-26 23:43:07,891 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f84663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:07, skipping insertion in model container [2019-12-26 23:43:07,892 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:43:07" (1/1) ... [2019-12-26 23:43:07,899 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:43:07,960 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:43:08,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:43:08,546 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:43:08,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:43:08,686 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:43:08,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:08 WrapperNode [2019-12-26 23:43:08,686 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:43:08,687 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:43:08,687 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:43:08,687 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:43:08,696 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:08" (1/1) ... [2019-12-26 23:43:08,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:08" (1/1) ... [2019-12-26 23:43:08,747 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:43:08,748 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:43:08,748 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:43:08,748 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:43:08,757 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:08" (1/1) ... [2019-12-26 23:43:08,757 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:08" (1/1) ... [2019-12-26 23:43:08,762 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:08" (1/1) ... [2019-12-26 23:43:08,763 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:08" (1/1) ... [2019-12-26 23:43:08,773 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:08" (1/1) ... [2019-12-26 23:43:08,777 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:08" (1/1) ... [2019-12-26 23:43:08,781 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:08" (1/1) ... [2019-12-26 23:43:08,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:43:08,787 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:43:08,787 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:43:08,787 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:43:08,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:43:08,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:43:08,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:43:08,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:43:08,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:43:08,873 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:43:08,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:43:08,874 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:43:08,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:43:08,875 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:43:08,875 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:43:08,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:43:08,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:43:08,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:43:08,878 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:43:09,594 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:43:09,594 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:43:09,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:43:09 BoogieIcfgContainer [2019-12-26 23:43:09,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:43:09,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:43:09,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:43:09,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:43:09,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:43:07" (1/3) ... [2019-12-26 23:43:09,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38cf26b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:43:09, skipping insertion in model container [2019-12-26 23:43:09,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:43:08" (2/3) ... [2019-12-26 23:43:09,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38cf26b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:43:09, skipping insertion in model container [2019-12-26 23:43:09,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:43:09" (3/3) ... [2019-12-26 23:43:09,607 INFO L109 eAbstractionObserver]: Analyzing ICFG safe012_pso.opt.i [2019-12-26 23:43:09,618 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:43:09,619 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:43:09,630 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:43:09,631 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:43:09,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,675 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,676 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,726 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,727 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,727 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,728 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,728 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,734 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,735 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,743 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,744 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,744 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,748 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,749 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,749 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,750 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,754 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,755 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:43:09,774 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:43:09,795 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:43:09,795 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:43:09,795 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:43:09,796 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:43:09,796 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:43:09,796 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:43:09,796 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:43:09,796 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:43:09,813 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-26 23:43:09,815 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-26 23:43:09,938 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-26 23:43:09,938 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:43:09,953 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 23:43:09,976 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-26 23:43:10,027 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-26 23:43:10,027 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:43:10,036 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-26 23:43:10,056 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-26 23:43:10,057 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:43:13,807 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 29 [2019-12-26 23:43:15,597 WARN L192 SmtUtils]: Spent 260.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-26 23:43:15,723 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 23:43:15,882 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64821 [2019-12-26 23:43:15,882 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-26 23:43:15,886 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 81 places, 89 transitions [2019-12-26 23:43:25,738 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 80192 states. [2019-12-26 23:43:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 80192 states. [2019-12-26 23:43:25,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-26 23:43:25,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:25,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-26 23:43:25,749 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:25,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:25,754 INFO L82 PathProgramCache]: Analyzing trace with hash 801165869, now seen corresponding path program 1 times [2019-12-26 23:43:25,762 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:25,763 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584113066] [2019-12-26 23:43:25,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:25,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:26,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:43:26,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584113066] [2019-12-26 23:43:26,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:26,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:43:26,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808375164] [2019-12-26 23:43:26,044 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:43:26,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:26,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:43:26,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:43:26,063 INFO L87 Difference]: Start difference. First operand 80192 states. Second operand 3 states. [2019-12-26 23:43:27,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:27,544 INFO L93 Difference]: Finished difference Result 79136 states and 341584 transitions. [2019-12-26 23:43:27,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:43:27,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-26 23:43:27,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:28,108 INFO L225 Difference]: With dead ends: 79136 [2019-12-26 23:43:28,108 INFO L226 Difference]: Without dead ends: 74600 [2019-12-26 23:43:28,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:43:33,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74600 states. [2019-12-26 23:43:35,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74600 to 74600. [2019-12-26 23:43:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74600 states. [2019-12-26 23:43:38,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74600 states to 74600 states and 321550 transitions. [2019-12-26 23:43:38,384 INFO L78 Accepts]: Start accepts. Automaton has 74600 states and 321550 transitions. Word has length 5 [2019-12-26 23:43:38,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:38,384 INFO L462 AbstractCegarLoop]: Abstraction has 74600 states and 321550 transitions. [2019-12-26 23:43:38,384 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:43:38,385 INFO L276 IsEmpty]: Start isEmpty. Operand 74600 states and 321550 transitions. [2019-12-26 23:43:38,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:43:38,394 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:38,394 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:38,395 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:38,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:38,395 INFO L82 PathProgramCache]: Analyzing trace with hash 144866957, now seen corresponding path program 1 times [2019-12-26 23:43:38,395 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:38,396 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449872704] [2019-12-26 23:43:38,396 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:38,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:38,559 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:43:38,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449872704] [2019-12-26 23:43:38,559 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:38,560 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:43:38,560 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812694022] [2019-12-26 23:43:38,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:43:38,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:38,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:43:38,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:43:38,563 INFO L87 Difference]: Start difference. First operand 74600 states and 321550 transitions. Second operand 4 states. [2019-12-26 23:43:39,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:39,488 INFO L93 Difference]: Finished difference Result 114840 states and 473340 transitions. [2019-12-26 23:43:39,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:43:39,488 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:43:39,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:43,609 INFO L225 Difference]: With dead ends: 114840 [2019-12-26 23:43:43,610 INFO L226 Difference]: Without dead ends: 114749 [2019-12-26 23:43:43,611 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:43:46,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114749 states. [2019-12-26 23:43:48,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114749 to 106549. [2019-12-26 23:43:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106549 states. [2019-12-26 23:43:49,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106549 states to 106549 states and 443513 transitions. [2019-12-26 23:43:49,704 INFO L78 Accepts]: Start accepts. Automaton has 106549 states and 443513 transitions. Word has length 13 [2019-12-26 23:43:49,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:43:49,705 INFO L462 AbstractCegarLoop]: Abstraction has 106549 states and 443513 transitions. [2019-12-26 23:43:49,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:43:49,705 INFO L276 IsEmpty]: Start isEmpty. Operand 106549 states and 443513 transitions. [2019-12-26 23:43:49,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:43:49,709 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:43:49,709 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:43:49,709 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:43:49,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:43:49,709 INFO L82 PathProgramCache]: Analyzing trace with hash 483707300, now seen corresponding path program 1 times [2019-12-26 23:43:49,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:43:49,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847818614] [2019-12-26 23:43:49,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:43:49,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:43:49,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:43:49,808 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847818614] [2019-12-26 23:43:49,809 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:43:49,809 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:43:49,809 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861581461] [2019-12-26 23:43:49,809 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:43:49,810 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:43:49,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:43:49,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:43:49,810 INFO L87 Difference]: Start difference. First operand 106549 states and 443513 transitions. Second operand 4 states. [2019-12-26 23:43:55,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:43:55,137 INFO L93 Difference]: Finished difference Result 148763 states and 604775 transitions. [2019-12-26 23:43:55,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:43:55,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-26 23:43:55,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:43:55,751 INFO L225 Difference]: With dead ends: 148763 [2019-12-26 23:43:55,752 INFO L226 Difference]: Without dead ends: 148659 [2019-12-26 23:43:55,752 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:43:59,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148659 states. [2019-12-26 23:44:01,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148659 to 126910. [2019-12-26 23:44:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126910 states. [2019-12-26 23:44:02,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126910 states to 126910 states and 524476 transitions. [2019-12-26 23:44:02,337 INFO L78 Accepts]: Start accepts. Automaton has 126910 states and 524476 transitions. Word has length 13 [2019-12-26 23:44:02,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:02,337 INFO L462 AbstractCegarLoop]: Abstraction has 126910 states and 524476 transitions. [2019-12-26 23:44:02,337 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:44:02,338 INFO L276 IsEmpty]: Start isEmpty. Operand 126910 states and 524476 transitions. [2019-12-26 23:44:02,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-26 23:44:02,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:02,341 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:02,341 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:44:02,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:02,342 INFO L82 PathProgramCache]: Analyzing trace with hash 145051196, now seen corresponding path program 1 times [2019-12-26 23:44:02,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:02,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579566244] [2019-12-26 23:44:02,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:02,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:44:02,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579566244] [2019-12-26 23:44:02,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:02,433 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:44:02,437 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076086458] [2019-12-26 23:44:02,438 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:44:02,438 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:02,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:44:02,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:44:02,439 INFO L87 Difference]: Start difference. First operand 126910 states and 524476 transitions. Second operand 5 states. [2019-12-26 23:44:08,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:08,515 INFO L93 Difference]: Finished difference Result 172949 states and 700308 transitions. [2019-12-26 23:44:08,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:44:08,516 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-26 23:44:08,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:09,011 INFO L225 Difference]: With dead ends: 172949 [2019-12-26 23:44:09,011 INFO L226 Difference]: Without dead ends: 172813 [2019-12-26 23:44:09,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:44:12,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172813 states. [2019-12-26 23:44:15,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172813 to 134187. [2019-12-26 23:44:15,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134187 states. [2019-12-26 23:44:16,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134187 states to 134187 states and 553595 transitions. [2019-12-26 23:44:16,514 INFO L78 Accepts]: Start accepts. Automaton has 134187 states and 553595 transitions. Word has length 14 [2019-12-26 23:44:16,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:16,515 INFO L462 AbstractCegarLoop]: Abstraction has 134187 states and 553595 transitions. [2019-12-26 23:44:16,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:44:16,515 INFO L276 IsEmpty]: Start isEmpty. Operand 134187 states and 553595 transitions. [2019-12-26 23:44:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-26 23:44:16,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:16,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:16,538 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:44:16,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:16,538 INFO L82 PathProgramCache]: Analyzing trace with hash -448648622, now seen corresponding path program 1 times [2019-12-26 23:44:16,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:16,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484863536] [2019-12-26 23:44:16,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:16,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:16,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:44:16,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484863536] [2019-12-26 23:44:16,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:16,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:44:16,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187450445] [2019-12-26 23:44:16,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:44:16,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:16,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:44:16,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:44:16,612 INFO L87 Difference]: Start difference. First operand 134187 states and 553595 transitions. Second operand 3 states. [2019-12-26 23:44:17,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:17,230 INFO L93 Difference]: Finished difference Result 133799 states and 552073 transitions. [2019-12-26 23:44:17,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:44:17,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-26 23:44:17,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:17,591 INFO L225 Difference]: With dead ends: 133799 [2019-12-26 23:44:17,591 INFO L226 Difference]: Without dead ends: 133799 [2019-12-26 23:44:17,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:44:26,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133799 states. [2019-12-26 23:44:28,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133799 to 133799. [2019-12-26 23:44:28,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133799 states. [2019-12-26 23:44:29,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133799 states to 133799 states and 552073 transitions. [2019-12-26 23:44:29,107 INFO L78 Accepts]: Start accepts. Automaton has 133799 states and 552073 transitions. Word has length 18 [2019-12-26 23:44:29,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:29,107 INFO L462 AbstractCegarLoop]: Abstraction has 133799 states and 552073 transitions. [2019-12-26 23:44:29,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:44:29,107 INFO L276 IsEmpty]: Start isEmpty. Operand 133799 states and 552073 transitions. [2019-12-26 23:44:29,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:44:29,128 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:29,128 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:29,128 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:44:29,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:29,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1144737546, now seen corresponding path program 1 times [2019-12-26 23:44:29,129 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:29,129 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023276081] [2019-12-26 23:44:29,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:29,175 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:44:29,175 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023276081] [2019-12-26 23:44:29,175 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:29,175 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:44:29,176 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683224615] [2019-12-26 23:44:29,176 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:44:29,176 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:29,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:44:29,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:44:29,177 INFO L87 Difference]: Start difference. First operand 133799 states and 552073 transitions. Second operand 4 states. [2019-12-26 23:44:31,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:31,448 INFO L93 Difference]: Finished difference Result 243998 states and 1008264 transitions. [2019-12-26 23:44:31,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:44:31,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-26 23:44:31,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:31,832 INFO L225 Difference]: With dead ends: 243998 [2019-12-26 23:44:31,833 INFO L226 Difference]: Without dead ends: 133380 [2019-12-26 23:44:31,833 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:44:41,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133380 states. [2019-12-26 23:44:43,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133380 to 132604. [2019-12-26 23:44:43,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132604 states. [2019-12-26 23:44:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132604 states to 132604 states and 541797 transitions. [2019-12-26 23:44:44,292 INFO L78 Accepts]: Start accepts. Automaton has 132604 states and 541797 transitions. Word has length 19 [2019-12-26 23:44:44,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:44,293 INFO L462 AbstractCegarLoop]: Abstraction has 132604 states and 541797 transitions. [2019-12-26 23:44:44,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:44:44,293 INFO L276 IsEmpty]: Start isEmpty. Operand 132604 states and 541797 transitions. [2019-12-26 23:44:44,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-26 23:44:44,307 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:44,307 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:44:44,307 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:44:44,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:44,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1997587133, now seen corresponding path program 1 times [2019-12-26 23:44:44,308 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:44:44,308 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941524128] [2019-12-26 23:44:44,308 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:44:44,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:44:44,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:44:44,392 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941524128] [2019-12-26 23:44:44,392 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:44:44,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:44:44,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059755891] [2019-12-26 23:44:44,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:44:44,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:44:44,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:44:44,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:44:44,394 INFO L87 Difference]: Start difference. First operand 132604 states and 541797 transitions. Second operand 5 states. [2019-12-26 23:44:46,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:44:46,657 INFO L93 Difference]: Finished difference Result 182821 states and 731119 transitions. [2019-12-26 23:44:46,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 23:44:46,658 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-26 23:44:46,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:44:47,198 INFO L225 Difference]: With dead ends: 182821 [2019-12-26 23:44:47,198 INFO L226 Difference]: Without dead ends: 181141 [2019-12-26 23:44:47,199 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:44:56,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181141 states. [2019-12-26 23:44:58,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181141 to 137168. [2019-12-26 23:44:58,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137168 states. [2019-12-26 23:44:59,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137168 states to 137168 states and 559766 transitions. [2019-12-26 23:44:59,326 INFO L78 Accepts]: Start accepts. Automaton has 137168 states and 559766 transitions. Word has length 19 [2019-12-26 23:44:59,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:44:59,326 INFO L462 AbstractCegarLoop]: Abstraction has 137168 states and 559766 transitions. [2019-12-26 23:44:59,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:44:59,327 INFO L276 IsEmpty]: Start isEmpty. Operand 137168 states and 559766 transitions. [2019-12-26 23:44:59,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-26 23:44:59,346 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:44:59,347 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] [2019-12-26 23:44:59,347 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:44:59,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:44:59,347 INFO L82 PathProgramCache]: Analyzing trace with hash 826616842, now seen corresponding path program 1 times [2019-12-26 23:44:59,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:00,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538217125] [2019-12-26 23:45:00,263 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:00,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:00,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538217125] [2019-12-26 23:45:00,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:00,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:45:00,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545190680] [2019-12-26 23:45:00,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:45:00,337 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:00,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:45:00,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:45:00,338 INFO L87 Difference]: Start difference. First operand 137168 states and 559766 transitions. Second operand 4 states. [2019-12-26 23:45:01,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:01,620 INFO L93 Difference]: Finished difference Result 208641 states and 859416 transitions. [2019-12-26 23:45:01,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:45:01,620 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2019-12-26 23:45:01,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:07,823 INFO L225 Difference]: With dead ends: 208641 [2019-12-26 23:45:07,823 INFO L226 Difference]: Without dead ends: 95129 [2019-12-26 23:45:07,823 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:10,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95129 states. [2019-12-26 23:45:11,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95129 to 88607. [2019-12-26 23:45:11,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88607 states. [2019-12-26 23:45:12,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88607 states to 88607 states and 363903 transitions. [2019-12-26 23:45:12,527 INFO L78 Accepts]: Start accepts. Automaton has 88607 states and 363903 transitions. Word has length 20 [2019-12-26 23:45:12,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:12,527 INFO L462 AbstractCegarLoop]: Abstraction has 88607 states and 363903 transitions. [2019-12-26 23:45:12,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:45:12,527 INFO L276 IsEmpty]: Start isEmpty. Operand 88607 states and 363903 transitions. [2019-12-26 23:45:12,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-26 23:45:12,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:12,545 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] [2019-12-26 23:45:12,545 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:12,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:12,545 INFO L82 PathProgramCache]: Analyzing trace with hash 1336681809, now seen corresponding path program 1 times [2019-12-26 23:45:12,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:12,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265713383] [2019-12-26 23:45:12,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:12,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:12,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:12,621 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265713383] [2019-12-26 23:45:12,621 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:12,621 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:12,621 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [141214884] [2019-12-26 23:45:12,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:45:12,622 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:12,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:45:12,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:45:12,623 INFO L87 Difference]: Start difference. First operand 88607 states and 363903 transitions. Second operand 4 states. [2019-12-26 23:45:12,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:12,742 INFO L93 Difference]: Finished difference Result 21271 states and 74639 transitions. [2019-12-26 23:45:12,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:45:12,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2019-12-26 23:45:12,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:12,776 INFO L225 Difference]: With dead ends: 21271 [2019-12-26 23:45:12,776 INFO L226 Difference]: Without dead ends: 17306 [2019-12-26 23:45:12,776 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:12,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17306 states. [2019-12-26 23:45:13,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17306 to 17305. [2019-12-26 23:45:13,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17305 states. [2019-12-26 23:45:13,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17305 states to 17305 states and 58494 transitions. [2019-12-26 23:45:13,102 INFO L78 Accepts]: Start accepts. Automaton has 17305 states and 58494 transitions. Word has length 21 [2019-12-26 23:45:13,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:13,103 INFO L462 AbstractCegarLoop]: Abstraction has 17305 states and 58494 transitions. [2019-12-26 23:45:13,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:45:13,103 INFO L276 IsEmpty]: Start isEmpty. Operand 17305 states and 58494 transitions. [2019-12-26 23:45:13,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:45:13,107 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:13,107 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] [2019-12-26 23:45:13,107 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:13,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:13,107 INFO L82 PathProgramCache]: Analyzing trace with hash 458918585, now seen corresponding path program 1 times [2019-12-26 23:45:13,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:13,108 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434862575] [2019-12-26 23:45:13,108 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:13,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:13,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:13,188 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434862575] [2019-12-26 23:45:13,188 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:13,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:45:13,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150456660] [2019-12-26 23:45:13,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:45:13,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:13,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:45:13,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:13,189 INFO L87 Difference]: Start difference. First operand 17305 states and 58494 transitions. Second operand 6 states. [2019-12-26 23:45:13,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:13,627 INFO L93 Difference]: Finished difference Result 17791 states and 59044 transitions. [2019-12-26 23:45:13,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:45:13,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 23:45:13,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:13,656 INFO L225 Difference]: With dead ends: 17791 [2019-12-26 23:45:13,656 INFO L226 Difference]: Without dead ends: 17166 [2019-12-26 23:45:13,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:45:13,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17166 states. [2019-12-26 23:45:13,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17166 to 16399. [2019-12-26 23:45:13,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16399 states. [2019-12-26 23:45:13,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16399 states to 16399 states and 55725 transitions. [2019-12-26 23:45:13,956 INFO L78 Accepts]: Start accepts. Automaton has 16399 states and 55725 transitions. Word has length 22 [2019-12-26 23:45:13,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:13,957 INFO L462 AbstractCegarLoop]: Abstraction has 16399 states and 55725 transitions. [2019-12-26 23:45:13,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:45:13,957 INFO L276 IsEmpty]: Start isEmpty. Operand 16399 states and 55725 transitions. [2019-12-26 23:45:13,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 23:45:13,963 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:13,963 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:13,964 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:13,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:13,964 INFO L82 PathProgramCache]: Analyzing trace with hash -103947124, now seen corresponding path program 1 times [2019-12-26 23:45:13,964 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:13,965 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163382110] [2019-12-26 23:45:13,965 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:13,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:14,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:14,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163382110] [2019-12-26 23:45:14,037 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:14,037 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:45:14,037 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265870669] [2019-12-26 23:45:14,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:45:14,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:14,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:45:14,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:14,039 INFO L87 Difference]: Start difference. First operand 16399 states and 55725 transitions. Second operand 6 states. [2019-12-26 23:45:14,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:14,972 INFO L93 Difference]: Finished difference Result 17183 states and 57318 transitions. [2019-12-26 23:45:14,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:45:14,972 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-26 23:45:14,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:15,002 INFO L225 Difference]: With dead ends: 17183 [2019-12-26 23:45:15,002 INFO L226 Difference]: Without dead ends: 16450 [2019-12-26 23:45:15,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:45:15,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16450 states. [2019-12-26 23:45:15,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16450 to 16248. [2019-12-26 23:45:15,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16248 states. [2019-12-26 23:45:15,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16248 states to 16248 states and 55257 transitions. [2019-12-26 23:45:15,318 INFO L78 Accepts]: Start accepts. Automaton has 16248 states and 55257 transitions. Word has length 28 [2019-12-26 23:45:15,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:15,318 INFO L462 AbstractCegarLoop]: Abstraction has 16248 states and 55257 transitions. [2019-12-26 23:45:15,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:45:15,318 INFO L276 IsEmpty]: Start isEmpty. Operand 16248 states and 55257 transitions. [2019-12-26 23:45:15,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-26 23:45:15,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:15,328 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:15,328 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:15,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:15,329 INFO L82 PathProgramCache]: Analyzing trace with hash -633230079, now seen corresponding path program 1 times [2019-12-26 23:45:15,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:15,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252533983] [2019-12-26 23:45:15,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:15,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:15,410 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252533983] [2019-12-26 23:45:15,410 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:15,410 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:45:15,410 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042581608] [2019-12-26 23:45:15,411 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:15,411 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:15,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:15,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:15,411 INFO L87 Difference]: Start difference. First operand 16248 states and 55257 transitions. Second operand 5 states. [2019-12-26 23:45:15,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:16,000 INFO L93 Difference]: Finished difference Result 27826 states and 92334 transitions. [2019-12-26 23:45:16,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:45:16,000 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-12-26 23:45:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:16,045 INFO L225 Difference]: With dead ends: 27826 [2019-12-26 23:45:16,045 INFO L226 Difference]: Without dead ends: 27826 [2019-12-26 23:45:16,045 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:16,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27826 states. [2019-12-26 23:45:16,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27826 to 23465. [2019-12-26 23:45:16,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23465 states. [2019-12-26 23:45:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23465 states to 23465 states and 78220 transitions. [2019-12-26 23:45:16,475 INFO L78 Accepts]: Start accepts. Automaton has 23465 states and 78220 transitions. Word has length 30 [2019-12-26 23:45:16,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:16,475 INFO L462 AbstractCegarLoop]: Abstraction has 23465 states and 78220 transitions. [2019-12-26 23:45:16,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:16,475 INFO L276 IsEmpty]: Start isEmpty. Operand 23465 states and 78220 transitions. [2019-12-26 23:45:16,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-26 23:45:16,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:16,490 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:16,490 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:16,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:16,491 INFO L82 PathProgramCache]: Analyzing trace with hash -966417507, now seen corresponding path program 1 times [2019-12-26 23:45:16,491 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:16,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431815731] [2019-12-26 23:45:16,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:16,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:16,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:16,572 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431815731] [2019-12-26 23:45:16,572 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:16,572 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:45:16,573 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772321871] [2019-12-26 23:45:16,573 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:45:16,573 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:16,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:45:16,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:45:16,574 INFO L87 Difference]: Start difference. First operand 23465 states and 78220 transitions. Second operand 5 states. [2019-12-26 23:45:16,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:16,665 INFO L93 Difference]: Finished difference Result 10290 states and 31539 transitions. [2019-12-26 23:45:16,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:45:16,665 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2019-12-26 23:45:16,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:16,682 INFO L225 Difference]: With dead ends: 10290 [2019-12-26 23:45:16,682 INFO L226 Difference]: Without dead ends: 8619 [2019-12-26 23:45:16,682 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:45:16,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8619 states. [2019-12-26 23:45:17,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8619 to 8559. [2019-12-26 23:45:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8559 states. [2019-12-26 23:45:17,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8559 states to 8559 states and 25997 transitions. [2019-12-26 23:45:17,103 INFO L78 Accepts]: Start accepts. Automaton has 8559 states and 25997 transitions. Word has length 31 [2019-12-26 23:45:17,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:17,103 INFO L462 AbstractCegarLoop]: Abstraction has 8559 states and 25997 transitions. [2019-12-26 23:45:17,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:45:17,103 INFO L276 IsEmpty]: Start isEmpty. Operand 8559 states and 25997 transitions. [2019-12-26 23:45:17,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:45:17,115 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:17,116 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] [2019-12-26 23:45:17,116 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:17,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:17,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1415290960, now seen corresponding path program 1 times [2019-12-26 23:45:17,116 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:17,117 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600344904] [2019-12-26 23:45:17,117 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:17,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:17,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:17,225 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600344904] [2019-12-26 23:45:17,226 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:17,226 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:45:17,226 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304355139] [2019-12-26 23:45:17,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:45:17,228 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:17,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:45:17,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:45:17,228 INFO L87 Difference]: Start difference. First operand 8559 states and 25997 transitions. Second operand 7 states. [2019-12-26 23:45:17,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:17,557 INFO L93 Difference]: Finished difference Result 8671 states and 26198 transitions. [2019-12-26 23:45:17,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:45:17,558 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-26 23:45:17,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:17,571 INFO L225 Difference]: With dead ends: 8671 [2019-12-26 23:45:17,571 INFO L226 Difference]: Without dead ends: 8103 [2019-12-26 23:45:17,571 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:45:17,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8103 states. [2019-12-26 23:45:17,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8103 to 8103. [2019-12-26 23:45:17,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8103 states. [2019-12-26 23:45:17,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8103 states to 8103 states and 25081 transitions. [2019-12-26 23:45:17,683 INFO L78 Accepts]: Start accepts. Automaton has 8103 states and 25081 transitions. Word has length 40 [2019-12-26 23:45:17,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:17,683 INFO L462 AbstractCegarLoop]: Abstraction has 8103 states and 25081 transitions. [2019-12-26 23:45:17,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:45:17,684 INFO L276 IsEmpty]: Start isEmpty. Operand 8103 states and 25081 transitions. [2019-12-26 23:45:17,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:45:17,693 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:17,693 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] [2019-12-26 23:45:17,693 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:17,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:17,693 INFO L82 PathProgramCache]: Analyzing trace with hash 949732641, now seen corresponding path program 1 times [2019-12-26 23:45:17,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:17,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988911861] [2019-12-26 23:45:17,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:17,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:17,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988911861] [2019-12-26 23:45:17,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:17,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:45:17,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849613932] [2019-12-26 23:45:17,792 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:45:17,792 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:17,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:45:17,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:17,793 INFO L87 Difference]: Start difference. First operand 8103 states and 25081 transitions. Second operand 6 states. [2019-12-26 23:45:18,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:18,495 INFO L93 Difference]: Finished difference Result 16190 states and 49721 transitions. [2019-12-26 23:45:18,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:45:18,496 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-26 23:45:18,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:18,519 INFO L225 Difference]: With dead ends: 16190 [2019-12-26 23:45:18,520 INFO L226 Difference]: Without dead ends: 16190 [2019-12-26 23:45:18,520 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:45:18,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16190 states. [2019-12-26 23:45:18,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16190 to 10367. [2019-12-26 23:45:18,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10367 states. [2019-12-26 23:45:18,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10367 states to 10367 states and 32128 transitions. [2019-12-26 23:45:18,709 INFO L78 Accepts]: Start accepts. Automaton has 10367 states and 32128 transitions. Word has length 40 [2019-12-26 23:45:18,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:18,709 INFO L462 AbstractCegarLoop]: Abstraction has 10367 states and 32128 transitions. [2019-12-26 23:45:18,709 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:45:18,709 INFO L276 IsEmpty]: Start isEmpty. Operand 10367 states and 32128 transitions. [2019-12-26 23:45:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-26 23:45:18,722 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:18,722 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] [2019-12-26 23:45:18,722 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:18,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:18,723 INFO L82 PathProgramCache]: Analyzing trace with hash -664415049, now seen corresponding path program 2 times [2019-12-26 23:45:18,723 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:18,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519107095] [2019-12-26 23:45:18,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:18,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:18,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:18,766 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519107095] [2019-12-26 23:45:18,766 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:18,766 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:45:18,766 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143671493] [2019-12-26 23:45:18,767 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:18,767 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:18,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:18,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:18,767 INFO L87 Difference]: Start difference. First operand 10367 states and 32128 transitions. Second operand 3 states. [2019-12-26 23:45:18,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:18,803 INFO L93 Difference]: Finished difference Result 7547 states and 22906 transitions. [2019-12-26 23:45:18,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:18,804 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-12-26 23:45:18,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:18,816 INFO L225 Difference]: With dead ends: 7547 [2019-12-26 23:45:18,817 INFO L226 Difference]: Without dead ends: 7547 [2019-12-26 23:45:18,817 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:18,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7547 states. [2019-12-26 23:45:18,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7547 to 7527. [2019-12-26 23:45:18,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7527 states. [2019-12-26 23:45:18,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7527 states to 7527 states and 22852 transitions. [2019-12-26 23:45:18,930 INFO L78 Accepts]: Start accepts. Automaton has 7527 states and 22852 transitions. Word has length 40 [2019-12-26 23:45:18,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:18,930 INFO L462 AbstractCegarLoop]: Abstraction has 7527 states and 22852 transitions. [2019-12-26 23:45:18,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:18,931 INFO L276 IsEmpty]: Start isEmpty. Operand 7527 states and 22852 transitions. [2019-12-26 23:45:18,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:45:18,938 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:18,938 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] [2019-12-26 23:45:18,938 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:18,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:18,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1595396635, now seen corresponding path program 1 times [2019-12-26 23:45:18,939 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:18,939 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628388284] [2019-12-26 23:45:18,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:19,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:19,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628388284] [2019-12-26 23:45:19,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:19,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:45:19,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662263533] [2019-12-26 23:45:19,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:45:19,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:19,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:45:19,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:19,025 INFO L87 Difference]: Start difference. First operand 7527 states and 22852 transitions. Second operand 6 states. [2019-12-26 23:45:19,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:19,672 INFO L93 Difference]: Finished difference Result 9826 states and 29170 transitions. [2019-12-26 23:45:19,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-26 23:45:19,673 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-26 23:45:19,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:19,687 INFO L225 Difference]: With dead ends: 9826 [2019-12-26 23:45:19,687 INFO L226 Difference]: Without dead ends: 9826 [2019-12-26 23:45:19,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-26 23:45:19,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9826 states. [2019-12-26 23:45:19,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9826 to 7819. [2019-12-26 23:45:19,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7819 states. [2019-12-26 23:45:19,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7819 states to 7819 states and 23720 transitions. [2019-12-26 23:45:19,804 INFO L78 Accepts]: Start accepts. Automaton has 7819 states and 23720 transitions. Word has length 41 [2019-12-26 23:45:19,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:19,805 INFO L462 AbstractCegarLoop]: Abstraction has 7819 states and 23720 transitions. [2019-12-26 23:45:19,805 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:45:19,805 INFO L276 IsEmpty]: Start isEmpty. Operand 7819 states and 23720 transitions. [2019-12-26 23:45:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-26 23:45:19,813 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:19,813 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] [2019-12-26 23:45:19,813 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:19,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:19,813 INFO L82 PathProgramCache]: Analyzing trace with hash -211129485, now seen corresponding path program 2 times [2019-12-26 23:45:19,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:19,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219128916] [2019-12-26 23:45:19,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:19,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:19,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:19,868 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219128916] [2019-12-26 23:45:19,868 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:19,868 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:45:19,868 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613516441] [2019-12-26 23:45:19,869 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:19,869 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:19,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:19,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:19,869 INFO L87 Difference]: Start difference. First operand 7819 states and 23720 transitions. Second operand 3 states. [2019-12-26 23:45:19,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:19,909 INFO L93 Difference]: Finished difference Result 7750 states and 23473 transitions. [2019-12-26 23:45:19,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:19,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-26 23:45:19,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:19,922 INFO L225 Difference]: With dead ends: 7750 [2019-12-26 23:45:19,922 INFO L226 Difference]: Without dead ends: 7750 [2019-12-26 23:45:19,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:19,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7750 states. [2019-12-26 23:45:20,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7750 to 6896. [2019-12-26 23:45:20,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6896 states. [2019-12-26 23:45:20,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6896 states to 6896 states and 21054 transitions. [2019-12-26 23:45:20,184 INFO L78 Accepts]: Start accepts. Automaton has 6896 states and 21054 transitions. Word has length 41 [2019-12-26 23:45:20,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:20,185 INFO L462 AbstractCegarLoop]: Abstraction has 6896 states and 21054 transitions. [2019-12-26 23:45:20,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:20,185 INFO L276 IsEmpty]: Start isEmpty. Operand 6896 states and 21054 transitions. [2019-12-26 23:45:20,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 23:45:20,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:20,199 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:45:20,200 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:20,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:20,200 INFO L82 PathProgramCache]: Analyzing trace with hash -598466109, now seen corresponding path program 1 times [2019-12-26 23:45:20,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:20,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050058850] [2019-12-26 23:45:20,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:20,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:20,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:20,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050058850] [2019-12-26 23:45:20,336 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:20,336 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:45:20,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975992123] [2019-12-26 23:45:20,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:45:20,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:20,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:45:20,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:45:20,338 INFO L87 Difference]: Start difference. First operand 6896 states and 21054 transitions. Second operand 6 states. [2019-12-26 23:45:20,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:20,459 INFO L93 Difference]: Finished difference Result 6086 states and 19041 transitions. [2019-12-26 23:45:20,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 23:45:20,459 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-26 23:45:20,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:20,475 INFO L225 Difference]: With dead ends: 6086 [2019-12-26 23:45:20,475 INFO L226 Difference]: Without dead ends: 5998 [2019-12-26 23:45:20,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:45:20,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5998 states. [2019-12-26 23:45:20,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5998 to 5998. [2019-12-26 23:45:20,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5998 states. [2019-12-26 23:45:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5998 states to 5998 states and 18833 transitions. [2019-12-26 23:45:20,666 INFO L78 Accepts]: Start accepts. Automaton has 5998 states and 18833 transitions. Word has length 42 [2019-12-26 23:45:20,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:20,667 INFO L462 AbstractCegarLoop]: Abstraction has 5998 states and 18833 transitions. [2019-12-26 23:45:20,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:45:20,667 INFO L276 IsEmpty]: Start isEmpty. Operand 5998 states and 18833 transitions. [2019-12-26 23:45:20,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:45:20,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:20,677 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] [2019-12-26 23:45:20,677 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:20,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:20,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1916857338, now seen corresponding path program 1 times [2019-12-26 23:45:20,677 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:20,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687722343] [2019-12-26 23:45:20,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:20,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:20,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687722343] [2019-12-26 23:45:20,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:20,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:45:20,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951135037] [2019-12-26 23:45:20,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:45:20,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:20,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:45:20,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:20,720 INFO L87 Difference]: Start difference. First operand 5998 states and 18833 transitions. Second operand 3 states. [2019-12-26 23:45:20,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:20,794 INFO L93 Difference]: Finished difference Result 8134 states and 24962 transitions. [2019-12-26 23:45:20,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:45:20,795 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-12-26 23:45:20,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:20,809 INFO L225 Difference]: With dead ends: 8134 [2019-12-26 23:45:20,809 INFO L226 Difference]: Without dead ends: 8134 [2019-12-26 23:45:20,809 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:45:20,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8134 states. [2019-12-26 23:45:20,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8134 to 6604. [2019-12-26 23:45:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6604 states. [2019-12-26 23:45:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6604 states to 6604 states and 20625 transitions. [2019-12-26 23:45:20,970 INFO L78 Accepts]: Start accepts. Automaton has 6604 states and 20625 transitions. Word has length 56 [2019-12-26 23:45:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:20,971 INFO L462 AbstractCegarLoop]: Abstraction has 6604 states and 20625 transitions. [2019-12-26 23:45:20,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:45:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 6604 states and 20625 transitions. [2019-12-26 23:45:20,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:45:20,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:20,980 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] [2019-12-26 23:45:20,981 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:20,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:20,981 INFO L82 PathProgramCache]: Analyzing trace with hash -261820410, now seen corresponding path program 1 times [2019-12-26 23:45:20,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:20,982 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709457788] [2019-12-26 23:45:20,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:21,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:45:21,212 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709457788] [2019-12-26 23:45:21,212 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:21,212 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:45:21,212 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198621589] [2019-12-26 23:45:21,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:45:21,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:21,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:45:21,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:45:21,214 INFO L87 Difference]: Start difference. First operand 6604 states and 20625 transitions. Second operand 11 states. [2019-12-26 23:45:22,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:22,108 INFO L93 Difference]: Finished difference Result 12920 states and 39528 transitions. [2019-12-26 23:45:22,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-26 23:45:22,108 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 56 [2019-12-26 23:45:22,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:22,121 INFO L225 Difference]: With dead ends: 12920 [2019-12-26 23:45:22,122 INFO L226 Difference]: Without dead ends: 8714 [2019-12-26 23:45:22,122 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=200, Invalid=856, Unknown=0, NotChecked=0, Total=1056 [2019-12-26 23:45:22,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8714 states. [2019-12-26 23:45:22,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8714 to 7816. [2019-12-26 23:45:22,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7816 states. [2019-12-26 23:45:22,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7816 states to 7816 states and 23720 transitions. [2019-12-26 23:45:22,238 INFO L78 Accepts]: Start accepts. Automaton has 7816 states and 23720 transitions. Word has length 56 [2019-12-26 23:45:22,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:22,239 INFO L462 AbstractCegarLoop]: Abstraction has 7816 states and 23720 transitions. [2019-12-26 23:45:22,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:45:22,239 INFO L276 IsEmpty]: Start isEmpty. Operand 7816 states and 23720 transitions. [2019-12-26 23:45:22,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:45:22,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:22,249 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] [2019-12-26 23:45:22,249 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:22,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:22,249 INFO L82 PathProgramCache]: Analyzing trace with hash -899860532, now seen corresponding path program 2 times [2019-12-26 23:45:22,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:22,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946135767] [2019-12-26 23:45:22,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:22,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:45:22,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-26 23:45:22,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946135767] [2019-12-26 23:45:22,461 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:45:22,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:45:22,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173923483] [2019-12-26 23:45:22,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:45:22,461 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:45:22,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:45:22,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:45:22,462 INFO L87 Difference]: Start difference. First operand 7816 states and 23720 transitions. Second operand 12 states. [2019-12-26 23:45:23,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:45:23,180 INFO L93 Difference]: Finished difference Result 9102 states and 26907 transitions. [2019-12-26 23:45:23,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-26 23:45:23,180 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 56 [2019-12-26 23:45:23,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:45:23,195 INFO L225 Difference]: With dead ends: 9102 [2019-12-26 23:45:23,195 INFO L226 Difference]: Without dead ends: 8298 [2019-12-26 23:45:23,196 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=697, Unknown=0, NotChecked=0, Total=870 [2019-12-26 23:45:23,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8298 states. [2019-12-26 23:45:23,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8298 to 7544. [2019-12-26 23:45:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7544 states. [2019-12-26 23:45:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7544 states to 7544 states and 22976 transitions. [2019-12-26 23:45:23,367 INFO L78 Accepts]: Start accepts. Automaton has 7544 states and 22976 transitions. Word has length 56 [2019-12-26 23:45:23,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:45:23,367 INFO L462 AbstractCegarLoop]: Abstraction has 7544 states and 22976 transitions. [2019-12-26 23:45:23,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:45:23,367 INFO L276 IsEmpty]: Start isEmpty. Operand 7544 states and 22976 transitions. [2019-12-26 23:45:23,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-26 23:45:23,378 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:45:23,379 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] [2019-12-26 23:45:23,379 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:45:23,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:45:23,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1827744688, now seen corresponding path program 3 times [2019-12-26 23:45:23,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:45:23,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189288395] [2019-12-26 23:45:23,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:45:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:45:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:45:23,523 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:45:23,524 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:45:23,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~x$r_buff1_thd1~0_405 0) (= v_~z~0_42 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2058~0.base_25|) 0) (= v_~y~0_203 0) (= 0 v_~x$w_buff1~0_314) (= 0 v_~x$r_buff0_thd3~0_141) (= v_~x$flush_delayed~0_58 0) (= v_~__unbuffered_p0_EBX~0_60 0) (= v_~x$mem_tmp~0_35 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2058~0.base_25| 4)) (= 0 v_~__unbuffered_p2_EAX~0_39) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_cnt~0_96) (= 0 v_~x$w_buff0_used~0_913) (= v_~x$r_buff0_thd0~0_157 0) (= 0 |v_#NULL.base_4|) (= v_~main$tmp_guard1~0_38 0) (= 0 v_~x$read_delayed~0_7) (= 0 v_~x$w_buff1_used~0_606) (= 0 v_~weak$$choice0~0_33) (= 0 v_~x$r_buff0_thd2~0_302) (= 0 v_~x$r_buff1_thd2~0_251) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2058~0.base_25|) (= v_~x$r_buff1_thd0~0_275 0) (= 0 v_~x$w_buff0~0_388) (= |v_#NULL.offset_4| 0) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2058~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2058~0.base_25|) |v_ULTIMATE.start_main_~#t2058~0.offset_19| 0)) |v_#memory_int_23|) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~x$r_buff1_thd3~0_254) (= |v_ULTIMATE.start_main_~#t2058~0.offset_19| 0) (= v_~main$tmp_guard0~0_48 0) (= 0 v_~x~0_230) (= v_~weak$$choice2~0_176 0) (= v_~x$r_buff0_thd1~0_365 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t2058~0.base_25| 1)) (= 0 v_~__unbuffered_p0_EAX~0_54))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_388, ~x$flush_delayed~0=v_~x$flush_delayed~0_58, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_405, ULTIMATE.start_main_~#t2059~0.offset=|v_ULTIMATE.start_main_~#t2059~0.offset_19|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_141, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_40|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_34|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_54, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_157, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_60, ~x$w_buff1~0=v_~x$w_buff1~0_314, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_606, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_251, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_33, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_96, ~x~0=v_~x~0_230, ULTIMATE.start_main_~#t2058~0.base=|v_ULTIMATE.start_main_~#t2058~0.base_25|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_365, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_71|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_254, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_38, ~x$mem_tmp~0=v_~x$mem_tmp~0_35, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_59|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_60|, ULTIMATE.start_main_~#t2058~0.offset=|v_ULTIMATE.start_main_~#t2058~0.offset_19|, ~y~0=v_~y~0_203, ULTIMATE.start_main_~#t2060~0.offset=|v_ULTIMATE.start_main_~#t2060~0.offset_14|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_21|, ULTIMATE.start_main_~#t2059~0.base=|v_ULTIMATE.start_main_~#t2059~0.base_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_48, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_275, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_302, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_913, ULTIMATE.start_main_~#t2060~0.base=|v_ULTIMATE.start_main_~#t2060~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_60|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_24|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_42, ~weak$$choice2~0=v_~weak$$choice2~0_176, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ULTIMATE.start_main_~#t2059~0.offset, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2058~0.base, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2058~0.offset, ~y~0, ULTIMATE.start_main_~#t2060~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2059~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t2060~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-26 23:45:23,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L818-1-->L820: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2059~0.base_10| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2059~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t2059~0.base_10|)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2059~0.base_10|) 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2059~0.base_10| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2059~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2059~0.base_10|) |v_ULTIMATE.start_main_~#t2059~0.offset_9| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t2059~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t2059~0.base=|v_ULTIMATE.start_main_~#t2059~0.base_10|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2059~0.offset=|v_ULTIMATE.start_main_~#t2059~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2059~0.base, #length, ULTIMATE.start_main_~#t2059~0.offset] because there is no mapped edge [2019-12-26 23:45:23,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L820-1-->L822: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2060~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2060~0.base_11|) |v_ULTIMATE.start_main_~#t2060~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t2060~0.base_11| 0)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2060~0.base_11| 4) |v_#length_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2060~0.base_11|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2060~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2060~0.offset_10|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2060~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2060~0.base=|v_ULTIMATE.start_main_~#t2060~0.base_11|, ULTIMATE.start_main_~#t2060~0.offset=|v_ULTIMATE.start_main_~#t2060~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2060~0.base, ULTIMATE.start_main_~#t2060~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-26 23:45:23,532 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] P1ENTRY-->L5-3: Formula: (and (= v_~x$w_buff1_used~0_56 v_~x$w_buff0_used~0_106) (= v_P1Thread1of1ForFork0_~arg.offset_7 |v_P1Thread1of1ForFork0_#in~arg.offset_7|) (= v_P1Thread1of1ForFork0_~arg.base_7 |v_P1Thread1of1ForFork0_#in~arg.base_7|) (= v_~x$w_buff0~0_21 v_~x$w_buff1~0_15) (= 1 v_~x$w_buff0_used~0_105) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|) (= 0 (mod v_~x$w_buff1_used~0_56 256)) (= 1 v_~x$w_buff0~0_20)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_21, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_106} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_20, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_9, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_7, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_7, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_7|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_7|, ~x$w_buff1~0=v_~x$w_buff1~0_15, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_7|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_56, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_105} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-26 23:45:23,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L795-2-->L795-4: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff1_used~0_In646669883 256))) (.cse1 (= (mod ~x$r_buff1_thd3~0_In646669883 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out646669883| ~x$w_buff1~0_In646669883) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out646669883| ~x~0_In646669883)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In646669883, ~x$w_buff1_used~0=~x$w_buff1_used~0_In646669883, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In646669883, ~x~0=~x~0_In646669883} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out646669883|, ~x$w_buff1~0=~x$w_buff1~0_In646669883, ~x$w_buff1_used~0=~x$w_buff1_used~0_In646669883, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In646669883, ~x~0=~x~0_In646669883} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-26 23:45:23,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L795-4-->L796: Formula: (= v_~x~0_21 |v_P2Thread1of1ForFork1_#t~ite32_10|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_10|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_9|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_13|, ~x~0=v_~x~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-26 23:45:23,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In-1456456221 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1456456221 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out-1456456221|) (not .cse1)) (and (= ~x$w_buff0_used~0_In-1456456221 |P2Thread1of1ForFork1_#t~ite34_Out-1456456221|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1456456221, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1456456221} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out-1456456221|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1456456221, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1456456221} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-26 23:45:23,543 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1074328383 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1074328383 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1074328383|)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-1074328383| ~x$w_buff0_used~0_In-1074328383)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1074328383, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1074328383} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1074328383, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1074328383|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1074328383} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-26 23:45:23,545 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff1_used~0_In-705561955 256))) (.cse0 (= (mod ~x$r_buff1_thd2~0_In-705561955 256) 0)) (.cse3 (= (mod ~x$w_buff0_used~0_In-705561955 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-705561955 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out-705561955| ~x$w_buff1_used~0_In-705561955) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out-705561955|) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-705561955, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-705561955, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-705561955, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-705561955} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-705561955, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-705561955, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-705561955, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out-705561955|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-705561955} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-26 23:45:23,551 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-443065237 256)))) (or (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite8_In-443065237| |P0Thread1of1ForFork2_#t~ite8_Out-443065237|) (= ~x$w_buff0~0_In-443065237 |P0Thread1of1ForFork2_#t~ite9_Out-443065237|)) (and (= ~x$w_buff0~0_In-443065237 |P0Thread1of1ForFork2_#t~ite8_Out-443065237|) (= |P0Thread1of1ForFork2_#t~ite9_Out-443065237| |P0Thread1of1ForFork2_#t~ite8_Out-443065237|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-443065237 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-443065237 256)) .cse1) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-443065237 256))) (= 0 (mod ~x$w_buff0_used~0_In-443065237 256)))) .cse0))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-443065237, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-443065237, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-443065237|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-443065237, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-443065237, ~weak$$choice2~0=~weak$$choice2~0_In-443065237, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-443065237} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-443065237, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-443065237, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-443065237|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-443065237, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-443065237|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-443065237, ~weak$$choice2~0=~weak$$choice2~0_In-443065237, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-443065237} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 23:45:23,556 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L742-->L742-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In761379700 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork2_#t~ite15_Out761379700| |P0Thread1of1ForFork2_#t~ite14_Out761379700|) (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In761379700 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In761379700 256)) (and (= (mod ~x$w_buff1_used~0_In761379700 256) 0) .cse1) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In761379700 256) 0)))) (= ~x$w_buff0_used~0_In761379700 |P0Thread1of1ForFork2_#t~ite14_Out761379700|)) (and (not .cse0) (= ~x$w_buff0_used~0_In761379700 |P0Thread1of1ForFork2_#t~ite15_Out761379700|) (= |P0Thread1of1ForFork2_#t~ite14_In761379700| |P0Thread1of1ForFork2_#t~ite14_Out761379700|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In761379700, ~x$w_buff1_used~0=~x$w_buff1_used~0_In761379700, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In761379700, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In761379700|, ~weak$$choice2~0=~weak$$choice2~0_In761379700, ~x$w_buff0_used~0=~x$w_buff0_used~0_In761379700} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In761379700, ~x$w_buff1_used~0=~x$w_buff1_used~0_In761379700, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out761379700|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In761379700, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out761379700|, ~weak$$choice2~0=~weak$$choice2~0_In761379700, ~x$w_buff0_used~0=~x$w_buff0_used~0_In761379700} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 23:45:23,558 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1832889970 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite18_Out1832889970| ~x$w_buff1_used~0_In1832889970) (= |P0Thread1of1ForFork2_#t~ite17_In1832889970| |P0Thread1of1ForFork2_#t~ite17_Out1832889970|) (not .cse0)) (and .cse0 (= |P0Thread1of1ForFork2_#t~ite17_Out1832889970| |P0Thread1of1ForFork2_#t~ite18_Out1832889970|) (= |P0Thread1of1ForFork2_#t~ite17_Out1832889970| ~x$w_buff1_used~0_In1832889970) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In1832889970 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In1832889970 256)) (and (= (mod ~x$w_buff1_used~0_In1832889970 256) 0) .cse1) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In1832889970 256) 0))))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1832889970, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In1832889970|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1832889970, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1832889970, ~weak$$choice2~0=~weak$$choice2~0_In1832889970, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1832889970} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1832889970, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out1832889970|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out1832889970|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1832889970, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1832889970, ~weak$$choice2~0=~weak$$choice2~0_In1832889970, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1832889970} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-26 23:45:23,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_112 v_~x$r_buff0_thd1~0_111) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_12|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_111, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_17|, ~weak$$choice2~0=v_~weak$$choice2~0_39, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-26 23:45:23,559 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L745-->L745-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In1097692729 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_Out1097692729| ~x$r_buff1_thd1~0_In1097692729) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In1097692729 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In1097692729 256)) (and .cse0 (= (mod ~x$r_buff1_thd1~0_In1097692729 256) 0)) (and (= (mod ~x$w_buff1_used~0_In1097692729 256) 0) .cse0))) .cse1 (= |P0Thread1of1ForFork2_#t~ite23_Out1097692729| |P0Thread1of1ForFork2_#t~ite24_Out1097692729|)) (and (= |P0Thread1of1ForFork2_#t~ite24_Out1097692729| ~x$r_buff1_thd1~0_In1097692729) (not .cse1) (= |P0Thread1of1ForFork2_#t~ite23_In1097692729| |P0Thread1of1ForFork2_#t~ite23_Out1097692729|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1097692729, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1097692729, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1097692729, ~weak$$choice2~0=~weak$$choice2~0_In1097692729, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In1097692729|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1097692729} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1097692729, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1097692729, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1097692729, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out1097692729|, ~weak$$choice2~0=~weak$$choice2~0_In1097692729, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out1097692729|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1097692729} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-26 23:45:23,561 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L797-->L797-2: Formula: (let ((.cse2 (= (mod ~x$w_buff0_used~0_In-1036455622 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd3~0_In-1036455622 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In-1036455622 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In-1036455622 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite35_Out-1036455622| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite35_Out-1036455622| ~x$w_buff1_used~0_In-1036455622) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1036455622, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1036455622, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1036455622, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1036455622} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1036455622|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1036455622, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1036455622, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1036455622, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1036455622} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-26 23:45:23,563 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In727942875 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In727942875 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd3~0_In727942875 |P2Thread1of1ForFork1_#t~ite36_Out727942875|)) (and (= 0 |P2Thread1of1ForFork1_#t~ite36_Out727942875|) (not .cse0) (not .cse1)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In727942875, ~x$w_buff0_used~0=~x$w_buff0_used~0_In727942875} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out727942875|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In727942875, ~x$w_buff0_used~0=~x$w_buff0_used~0_In727942875} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-26 23:45:23,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1260858448 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In1260858448 256) 0)) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In1260858448 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1260858448 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork1_#t~ite37_Out1260858448| ~x$r_buff1_thd3~0_In1260858448)) (and (= |P2Thread1of1ForFork1_#t~ite37_Out1260858448| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1260858448, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1260858448, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1260858448, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1260858448} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out1260858448|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1260858448, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1260858448, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1260858448, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1260858448} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-26 23:45:23,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= v_~x$r_buff1_thd3~0_52 |v_P2Thread1of1ForFork1_#t~ite37_30|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_53 1) v_~__unbuffered_cnt~0_52)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_29|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_52, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_52, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-26 23:45:23,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L778-->L779: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1169323300 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1169323300 256) 0))) (or (and (= 0 ~x$r_buff0_thd2~0_Out1169323300) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In1169323300 ~x$r_buff0_thd2~0_Out1169323300) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1169323300, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1169323300} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out1169323300|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out1169323300, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1169323300} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-26 23:45:23,564 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-1838594371 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1838594371 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1838594371 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In-1838594371 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite31_Out-1838594371| ~x$r_buff1_thd2~0_In-1838594371) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite31_Out-1838594371|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1838594371, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1838594371, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1838594371, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1838594371} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out-1838594371|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1838594371, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1838594371, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1838594371, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1838594371} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 23:45:23,565 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L779-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_59 1) v_~__unbuffered_cnt~0_58) (= v_~x$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork0_#t~ite31_30|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_59} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_29|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_50, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_58, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-26 23:45:23,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L747-->L755: Formula: (and (= v_~x$flush_delayed~0_16 0) (= v_~__unbuffered_cnt~0_30 (+ v_~__unbuffered_cnt~0_31 1)) (not (= (mod v_~x$flush_delayed~0_17 256) 0)) (= v_~x~0_35 v_~x$mem_tmp~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_17, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_31, ~x$mem_tmp~0=v_~x$mem_tmp~0_10} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_15|, ~x$flush_delayed~0=v_~x$flush_delayed~0_16, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_30, ~x$mem_tmp~0=v_~x$mem_tmp~0_10, ~x~0=v_~x~0_35} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-26 23:45:23,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L826-->L828-2: Formula: (and (not (= (mod v_~main$tmp_guard0~0_8 256) 0)) (or (= (mod v_~x$r_buff0_thd0~0_27 256) 0) (= (mod v_~x$w_buff0_used~0_180 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_27, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_180} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 23:45:23,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L828-2-->L828-4: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In543079109 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In543079109 256)))) (or (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite41_Out543079109| ~x$w_buff1~0_In543079109)) (and (= ~x~0_In543079109 |ULTIMATE.start_main_#t~ite41_Out543079109|) (or .cse1 .cse0)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In543079109, ~x$w_buff1_used~0=~x$w_buff1_used~0_In543079109, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In543079109, ~x~0=~x~0_In543079109} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out543079109|, ~x$w_buff1~0=~x$w_buff1~0_In543079109, ~x$w_buff1_used~0=~x$w_buff1_used~0_In543079109, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In543079109, ~x~0=~x~0_In543079109} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-26 23:45:23,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L828-4-->L829: Formula: (= v_~x~0_26 |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|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|, ~x~0=v_~x~0_26} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-26 23:45:23,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In976461467 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In976461467 256)))) (or (and (= |ULTIMATE.start_main_#t~ite43_Out976461467| ~x$w_buff0_used~0_In976461467) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite43_Out976461467|) (not .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In976461467, ~x$w_buff0_used~0=~x$w_buff0_used~0_In976461467} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In976461467, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out976461467|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In976461467} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-26 23:45:23,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L830-->L830-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1618551557 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1618551557 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1618551557 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1618551557 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite44_Out1618551557| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$w_buff1_used~0_In1618551557 |ULTIMATE.start_main_#t~ite44_Out1618551557|)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1618551557, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1618551557, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1618551557, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1618551557} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1618551557, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1618551557, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1618551557, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1618551557|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1618551557} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 23:45:23,572 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L831-->L831-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In174259972 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In174259972 256)))) (or (and (or .cse0 .cse1) (= ~x$r_buff0_thd0~0_In174259972 |ULTIMATE.start_main_#t~ite45_Out174259972|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite45_Out174259972| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In174259972, ~x$w_buff0_used~0=~x$w_buff0_used~0_In174259972} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In174259972, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out174259972|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In174259972} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 23:45:23,573 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L832-->L832-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In1078913074 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In1078913074 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In1078913074 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1078913074 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out1078913074|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~x$r_buff1_thd0~0_In1078913074 |ULTIMATE.start_main_#t~ite46_Out1078913074|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1078913074, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1078913074, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1078913074, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1078913074} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1078913074, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1078913074|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1078913074, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1078913074, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1078913074} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-26 23:45:23,574 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= v_~__unbuffered_p0_EBX~0_48 0) (= 1 v_~__unbuffered_p2_EAX~0_27) (= v_~x$r_buff1_thd0~0_255 |v_ULTIMATE.start_main_#t~ite46_48|) (= (mod v_~main$tmp_guard1~0_23 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 1 v_~__unbuffered_p0_EAX~0_42) (= v_~main$tmp_guard1~0_23 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_42, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_48, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_23, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_27, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_255, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:45:23,710 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:45:23 BasicIcfg [2019-12-26 23:45:23,710 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:45:23,715 INFO L168 Benchmark]: Toolchain (without parser) took 135830.47 ms. Allocated memory was 146.3 MB in the beginning and 3.9 GB in the end (delta: 3.8 GB). Free memory was 101.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.5 GB. Max. memory is 7.1 GB. [2019-12-26 23:45:23,716 INFO L168 Benchmark]: CDTParser took 1.40 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 23:45:23,716 INFO L168 Benchmark]: CACSL2BoogieTranslator took 803.24 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 100.7 MB in the beginning and 158.3 MB in the end (delta: -57.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-26 23:45:23,717 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.42 ms. Allocated memory is still 204.5 MB. Free memory was 158.3 MB in the beginning and 155.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:45:23,718 INFO L168 Benchmark]: Boogie Preprocessor took 38.79 ms. Allocated memory is still 204.5 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-26 23:45:23,719 INFO L168 Benchmark]: RCFGBuilder took 809.04 ms. Allocated memory is still 204.5 MB. Free memory was 153.1 MB in the beginning and 106.6 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-12-26 23:45:23,719 INFO L168 Benchmark]: TraceAbstraction took 134113.25 ms. Allocated memory was 204.5 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 105.9 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. [2019-12-26 23:45:23,730 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.40 ms. Allocated memory is still 146.3 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 803.24 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 100.7 MB in the beginning and 158.3 MB in the end (delta: -57.6 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.42 ms. Allocated memory is still 204.5 MB. Free memory was 158.3 MB in the beginning and 155.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.79 ms. Allocated memory is still 204.5 MB. Free memory was 155.7 MB in the beginning and 153.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 809.04 ms. Allocated memory is still 204.5 MB. Free memory was 153.1 MB in the beginning and 106.6 MB in the end (delta: 46.5 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 134113.25 ms. Allocated memory was 204.5 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 105.9 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.4 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 164 ProgramPointsBefore, 81 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 27 ChoiceCompositions, 6883 VarBasedMoverChecksPositive, 281 VarBasedMoverChecksNegative, 110 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 64821 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2058, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2059, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2060, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L732] 1 __unbuffered_p0_EAX = z [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 133.7s, OverallIterations: 23, TraceHistogramMax: 1, AutomataDifference: 39.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3069 SDtfs, 4461 SDslu, 7791 SDs, 0 SdLazy, 4154 SolverSat, 218 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 189 GetRequests, 27 SyntacticMatches, 14 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137168occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 74.4s AutomataMinimizationTime, 22 MinimizatonAttempts, 137123 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 721 NumberOfCodeBlocks, 721 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 643 ConstructedInterpolants, 0 QuantifiedInterpolants, 76410 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 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...