/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix036_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 16:51:16,635 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 16:51:16,638 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 16:51:16,650 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 16:51:16,650 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 16:51:16,651 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 16:51:16,652 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 16:51:16,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 16:51:16,656 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 16:51:16,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 16:51:16,658 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 16:51:16,659 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 16:51:16,659 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 16:51:16,660 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 16:51:16,661 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 16:51:16,662 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 16:51:16,663 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 16:51:16,664 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 16:51:16,665 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 16:51:16,667 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 16:51:16,668 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 16:51:16,669 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 16:51:16,670 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 16:51:16,671 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 16:51:16,673 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 16:51:16,674 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 16:51:16,674 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 16:51:16,675 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 16:51:16,675 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 16:51:16,676 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 16:51:16,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 16:51:16,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 16:51:16,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 16:51:16,678 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 16:51:16,679 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 16:51:16,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 16:51:16,680 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 16:51:16,680 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 16:51:16,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 16:51:16,681 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 16:51:16,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 16:51:16,683 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 16:51:16,697 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 16:51:16,697 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 16:51:16,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 16:51:16,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 16:51:16,698 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 16:51:16,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 16:51:16,699 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 16:51:16,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 16:51:16,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 16:51:16,700 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 16:51:16,700 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 16:51:16,700 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 16:51:16,700 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 16:51:16,700 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 16:51:16,701 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 16:51:16,701 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 16:51:16,701 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 16:51:16,701 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 16:51:16,701 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 16:51:16,701 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 16:51:16,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 16:51:16,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:51:16,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 16:51:16,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 16:51:16,703 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 16:51:16,703 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 16:51:16,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 16:51:16,703 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 16:51:16,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 16:51:16,704 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 16:51:16,704 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 16:51:16,987 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 16:51:17,000 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 16:51:17,004 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 16:51:17,005 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 16:51:17,006 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 16:51:17,007 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix036_rmo.opt.i [2019-12-27 16:51:17,088 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7c05c37/9cf2acd45ca047abbb7253d4e37d1d97/FLAG97e64ae37 [2019-12-27 16:51:17,651 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 16:51:17,653 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix036_rmo.opt.i [2019-12-27 16:51:17,675 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7c05c37/9cf2acd45ca047abbb7253d4e37d1d97/FLAG97e64ae37 [2019-12-27 16:51:17,958 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d7c05c37/9cf2acd45ca047abbb7253d4e37d1d97 [2019-12-27 16:51:17,968 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 16:51:17,970 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 16:51:17,971 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 16:51:17,971 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 16:51:17,974 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 16:51:17,975 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:51:17" (1/1) ... [2019-12-27 16:51:17,978 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cd32435 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:51:17, skipping insertion in model container [2019-12-27 16:51:17,978 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 04:51:17" (1/1) ... [2019-12-27 16:51:17,986 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 16:51:18,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 16:51:18,614 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:51:18,628 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 16:51:18,719 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 16:51:18,799 INFO L208 MainTranslator]: Completed translation [2019-12-27 16:51:18,800 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:51:18 WrapperNode [2019-12-27 16:51:18,800 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 16:51:18,801 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 16:51:18,801 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 16:51:18,801 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 16:51:18,811 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:51:18" (1/1) ... [2019-12-27 16:51:18,832 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:51:18" (1/1) ... [2019-12-27 16:51:18,877 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 16:51:18,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 16:51:18,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 16:51:18,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 16:51:18,886 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:51:18" (1/1) ... [2019-12-27 16:51:18,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:51:18" (1/1) ... [2019-12-27 16:51:18,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:51:18" (1/1) ... [2019-12-27 16:51:18,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:51:18" (1/1) ... [2019-12-27 16:51:18,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:51:18" (1/1) ... [2019-12-27 16:51:18,907 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:51:18" (1/1) ... [2019-12-27 16:51:18,911 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:51:18" (1/1) ... [2019-12-27 16:51:18,916 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 16:51:18,916 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 16:51:18,916 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 16:51:18,916 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 16:51:18,917 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:51:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 16:51:18,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 16:51:18,975 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 16:51:18,975 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 16:51:18,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 16:51:18,976 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 16:51:18,976 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 16:51:18,977 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 16:51:18,977 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 16:51:18,979 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 16:51:18,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 16:51:18,980 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-27 16:51:18,980 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-27 16:51:18,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 16:51:18,981 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 16:51:18,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 16:51:18,985 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 16:51:19,713 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 16:51:19,713 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 16:51:19,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:51:19 BoogieIcfgContainer [2019-12-27 16:51:19,715 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 16:51:19,717 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 16:51:19,718 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 16:51:19,722 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 16:51:19,723 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 04:51:17" (1/3) ... [2019-12-27 16:51:19,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69364be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:51:19, skipping insertion in model container [2019-12-27 16:51:19,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 04:51:18" (2/3) ... [2019-12-27 16:51:19,726 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69364be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 04:51:19, skipping insertion in model container [2019-12-27 16:51:19,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 04:51:19" (3/3) ... [2019-12-27 16:51:19,729 INFO L109 eAbstractionObserver]: Analyzing ICFG mix036_rmo.opt.i [2019-12-27 16:51:19,740 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 16:51:19,741 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 16:51:19,753 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 16:51:19,754 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 16:51:19,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,801 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,801 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,803 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,804 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,804 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,804 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,805 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,806 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,807 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,816 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,817 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,818 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,819 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,820 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,821 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,822 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,823 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,824 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,825 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,826 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,828 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,828 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,828 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,829 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,829 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,853 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,854 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,854 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,854 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,855 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,856 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,857 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,858 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,859 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,862 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,863 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,863 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,863 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,863 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,863 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,864 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,864 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,864 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,864 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,867 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,867 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,867 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,869 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,870 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,871 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,871 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,872 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,873 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,873 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,874 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,876 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,876 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,877 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,877 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,877 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,878 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 16:51:19,892 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-27 16:51:19,910 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 16:51:19,910 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 16:51:19,910 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 16:51:19,910 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 16:51:19,911 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 16:51:19,911 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 16:51:19,911 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 16:51:19,911 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 16:51:19,928 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 183 places, 211 transitions [2019-12-27 16:51:19,930 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-27 16:51:20,052 INFO L132 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-27 16:51:20,052 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:51:20,069 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 41/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 16:51:20,096 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 183 places, 211 transitions [2019-12-27 16:51:20,192 INFO L132 PetriNetUnfolder]: 41/207 cut-off events. [2019-12-27 16:51:20,192 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 16:51:20,202 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 207 events. 41/207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 449 event pairs. 0/164 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-27 16:51:20,228 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-27 16:51:20,229 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 16:51:25,735 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 16:51:26,118 WARN L192 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 101 [2019-12-27 16:51:26,261 WARN L192 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-12-27 16:51:26,285 INFO L206 etLargeBlockEncoding]: Checked pairs total: 74129 [2019-12-27 16:51:26,285 INFO L214 etLargeBlockEncoding]: Total number of compositions: 127 [2019-12-27 16:51:26,289 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 95 transitions [2019-12-27 16:51:56,062 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160086 states. [2019-12-27 16:51:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 160086 states. [2019-12-27 16:51:56,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-27 16:51:56,070 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:51:56,071 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:51:56,071 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:51:56,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:51:56,076 INFO L82 PathProgramCache]: Analyzing trace with hash -74872892, now seen corresponding path program 1 times [2019-12-27 16:51:56,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:51:56,086 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239039079] [2019-12-27 16:51:56,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:51:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:51:56,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:51:56,381 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239039079] [2019-12-27 16:51:56,382 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:51:56,383 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 16:51:56,383 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [986249774] [2019-12-27 16:51:56,384 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:51:56,388 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:51:56,403 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 8 states and 7 transitions. [2019-12-27 16:51:56,404 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:51:56,408 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:51:56,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:51:56,409 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:51:56,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:51:56,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:51:56,425 INFO L87 Difference]: Start difference. First operand 160086 states. Second operand 3 states. [2019-12-27 16:52:00,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:52:00,317 INFO L93 Difference]: Finished difference Result 158186 states and 763682 transitions. [2019-12-27 16:52:00,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:52:00,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-27 16:52:00,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:52:04,912 INFO L225 Difference]: With dead ends: 158186 [2019-12-27 16:52:04,912 INFO L226 Difference]: Without dead ends: 149138 [2019-12-27 16:52:04,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:52:10,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149138 states. [2019-12-27 16:52:14,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149138 to 149138. [2019-12-27 16:52:14,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149138 states. [2019-12-27 16:52:21,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149138 states to 149138 states and 719092 transitions. [2019-12-27 16:52:21,555 INFO L78 Accepts]: Start accepts. Automaton has 149138 states and 719092 transitions. Word has length 7 [2019-12-27 16:52:21,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:52:21,556 INFO L462 AbstractCegarLoop]: Abstraction has 149138 states and 719092 transitions. [2019-12-27 16:52:21,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:52:21,556 INFO L276 IsEmpty]: Start isEmpty. Operand 149138 states and 719092 transitions. [2019-12-27 16:52:21,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:52:21,567 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:52:21,567 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:52:21,567 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:52:21,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:52:21,568 INFO L82 PathProgramCache]: Analyzing trace with hash 117436716, now seen corresponding path program 1 times [2019-12-27 16:52:21,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:52:21,569 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133389239] [2019-12-27 16:52:21,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:52:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:52:21,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:52:21,680 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133389239] [2019-12-27 16:52:21,680 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:52:21,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:52:21,681 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1224860590] [2019-12-27 16:52:21,681 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:52:21,683 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:52:21,689 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 16:52:21,690 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:52:21,690 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:52:21,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:52:21,692 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:52:21,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:52:21,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:52:21,693 INFO L87 Difference]: Start difference. First operand 149138 states and 719092 transitions. Second operand 3 states. [2019-12-27 16:52:22,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:52:22,322 INFO L93 Difference]: Finished difference Result 94514 states and 411493 transitions. [2019-12-27 16:52:22,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:52:22,323 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 16:52:22,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:52:22,622 INFO L225 Difference]: With dead ends: 94514 [2019-12-27 16:52:22,622 INFO L226 Difference]: Without dead ends: 94514 [2019-12-27 16:52:22,623 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:52:31,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94514 states. [2019-12-27 16:52:33,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94514 to 94514. [2019-12-27 16:52:33,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94514 states. [2019-12-27 16:52:34,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94514 states to 94514 states and 411493 transitions. [2019-12-27 16:52:34,047 INFO L78 Accepts]: Start accepts. Automaton has 94514 states and 411493 transitions. Word has length 15 [2019-12-27 16:52:34,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:52:34,047 INFO L462 AbstractCegarLoop]: Abstraction has 94514 states and 411493 transitions. [2019-12-27 16:52:34,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:52:34,047 INFO L276 IsEmpty]: Start isEmpty. Operand 94514 states and 411493 transitions. [2019-12-27 16:52:34,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 16:52:34,050 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:52:34,050 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:52:34,051 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:52:34,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:52:34,051 INFO L82 PathProgramCache]: Analyzing trace with hash 860387736, now seen corresponding path program 1 times [2019-12-27 16:52:34,051 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:52:34,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88777267] [2019-12-27 16:52:34,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:52:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:52:34,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:52:34,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88777267] [2019-12-27 16:52:34,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:52:34,124 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:52:34,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1980787160] [2019-12-27 16:52:34,125 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:52:34,127 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:52:34,129 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 16 states and 15 transitions. [2019-12-27 16:52:34,129 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:52:34,129 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:52:34,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:52:34,130 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:52:34,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:52:34,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:52:34,130 INFO L87 Difference]: Start difference. First operand 94514 states and 411493 transitions. Second operand 4 states. [2019-12-27 16:52:35,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:52:35,135 INFO L93 Difference]: Finished difference Result 147815 states and 617388 transitions. [2019-12-27 16:52:35,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:52:35,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-27 16:52:35,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:52:36,941 INFO L225 Difference]: With dead ends: 147815 [2019-12-27 16:52:36,941 INFO L226 Difference]: Without dead ends: 147703 [2019-12-27 16:52:36,942 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-27 16:52:41,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147703 states. [2019-12-27 16:52:49,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147703 to 135599. [2019-12-27 16:52:49,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135599 states. [2019-12-27 16:52:50,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135599 states to 135599 states and 571971 transitions. [2019-12-27 16:52:50,441 INFO L78 Accepts]: Start accepts. Automaton has 135599 states and 571971 transitions. Word has length 15 [2019-12-27 16:52:50,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:52:50,442 INFO L462 AbstractCegarLoop]: Abstraction has 135599 states and 571971 transitions. [2019-12-27 16:52:50,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:52:50,442 INFO L276 IsEmpty]: Start isEmpty. Operand 135599 states and 571971 transitions. [2019-12-27 16:52:50,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:52:50,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:52:50,446 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:52:50,446 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:52:50,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:52:50,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1758547198, now seen corresponding path program 1 times [2019-12-27 16:52:50,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:52:50,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920981187] [2019-12-27 16:52:50,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:52:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:52:50,517 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:52:50,517 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [920981187] [2019-12-27 16:52:50,517 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:52:50,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:52:50,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1365580246] [2019-12-27 16:52:50,518 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:52:50,520 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:52:50,522 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 23 states and 28 transitions. [2019-12-27 16:52:50,522 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:52:50,524 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:52:50,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:52:50,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:52:50,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:52:50,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:52:50,525 INFO L87 Difference]: Start difference. First operand 135599 states and 571971 transitions. Second operand 4 states. [2019-12-27 16:52:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:52:50,696 INFO L93 Difference]: Finished difference Result 37047 states and 132608 transitions. [2019-12-27 16:52:50,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:52:50,697 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 16:52:50,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:52:50,782 INFO L225 Difference]: With dead ends: 37047 [2019-12-27 16:52:50,783 INFO L226 Difference]: Without dead ends: 37047 [2019-12-27 16:52:50,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:52:51,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37047 states. [2019-12-27 16:52:51,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37047 to 37047. [2019-12-27 16:52:51,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37047 states. [2019-12-27 16:52:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37047 states to 37047 states and 132608 transitions. [2019-12-27 16:52:51,582 INFO L78 Accepts]: Start accepts. Automaton has 37047 states and 132608 transitions. Word has length 16 [2019-12-27 16:52:51,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:52:51,582 INFO L462 AbstractCegarLoop]: Abstraction has 37047 states and 132608 transitions. [2019-12-27 16:52:51,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:52:51,582 INFO L276 IsEmpty]: Start isEmpty. Operand 37047 states and 132608 transitions. [2019-12-27 16:52:51,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:52:51,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:52:51,586 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:52:51,586 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:52:51,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:52:51,586 INFO L82 PathProgramCache]: Analyzing trace with hash -293201311, now seen corresponding path program 1 times [2019-12-27 16:52:51,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:52:51,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766652785] [2019-12-27 16:52:51,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:52:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:52:51,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:52:51,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766652785] [2019-12-27 16:52:51,649 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:52:51,649 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:52:51,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [992216044] [2019-12-27 16:52:51,650 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:52:51,652 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:52:51,656 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 16:52:51,656 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:52:51,698 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:52:51,698 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:52:51,699 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:52:51,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:52:51,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:52:51,700 INFO L87 Difference]: Start difference. First operand 37047 states and 132608 transitions. Second operand 5 states. [2019-12-27 16:52:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:52:54,489 INFO L93 Difference]: Finished difference Result 48238 states and 170644 transitions. [2019-12-27 16:52:54,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:52:54,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 16:52:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:52:54,585 INFO L225 Difference]: With dead ends: 48238 [2019-12-27 16:52:54,585 INFO L226 Difference]: Without dead ends: 48227 [2019-12-27 16:52:54,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:52:54,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48227 states. [2019-12-27 16:52:55,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48227 to 42563. [2019-12-27 16:52:55,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42563 states. [2019-12-27 16:52:55,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42563 states to 42563 states and 151744 transitions. [2019-12-27 16:52:55,396 INFO L78 Accepts]: Start accepts. Automaton has 42563 states and 151744 transitions. Word has length 16 [2019-12-27 16:52:55,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:52:55,397 INFO L462 AbstractCegarLoop]: Abstraction has 42563 states and 151744 transitions. [2019-12-27 16:52:55,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:52:55,397 INFO L276 IsEmpty]: Start isEmpty. Operand 42563 states and 151744 transitions. [2019-12-27 16:52:55,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 16:52:55,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:52:55,400 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:52:55,400 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:52:55,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:52:55,400 INFO L82 PathProgramCache]: Analyzing trace with hash -293081279, now seen corresponding path program 1 times [2019-12-27 16:52:55,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:52:55,401 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310283783] [2019-12-27 16:52:55,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:52:55,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:52:55,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:52:55,459 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310283783] [2019-12-27 16:52:55,459 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:52:55,459 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:52:55,462 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [363014164] [2019-12-27 16:52:55,462 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:52:55,464 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:52:55,470 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 52 transitions. [2019-12-27 16:52:55,470 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:52:55,495 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:52:55,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:52:55,497 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:52:55,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:52:55,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:52:55,497 INFO L87 Difference]: Start difference. First operand 42563 states and 151744 transitions. Second operand 5 states. [2019-12-27 16:52:55,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:52:55,964 INFO L93 Difference]: Finished difference Result 52709 states and 186086 transitions. [2019-12-27 16:52:55,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:52:55,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 16:52:55,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:52:56,546 INFO L225 Difference]: With dead ends: 52709 [2019-12-27 16:52:56,546 INFO L226 Difference]: Without dead ends: 52698 [2019-12-27 16:52:56,547 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 16:52:56,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52698 states. [2019-12-27 16:52:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52698 to 42470. [2019-12-27 16:52:57,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42470 states. [2019-12-27 16:52:57,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42470 states to 42470 states and 151203 transitions. [2019-12-27 16:52:57,357 INFO L78 Accepts]: Start accepts. Automaton has 42470 states and 151203 transitions. Word has length 16 [2019-12-27 16:52:57,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:52:57,357 INFO L462 AbstractCegarLoop]: Abstraction has 42470 states and 151203 transitions. [2019-12-27 16:52:57,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:52:57,357 INFO L276 IsEmpty]: Start isEmpty. Operand 42470 states and 151203 transitions. [2019-12-27 16:52:57,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 16:52:57,374 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:52:57,374 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:52:57,374 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:52:57,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:52:57,374 INFO L82 PathProgramCache]: Analyzing trace with hash 127408811, now seen corresponding path program 1 times [2019-12-27 16:52:57,375 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:52:57,375 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589825754] [2019-12-27 16:52:57,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:52:57,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:52:57,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:52:57,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589825754] [2019-12-27 16:52:57,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:52:57,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:52:57,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [532471215] [2019-12-27 16:52:57,490 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:52:57,493 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:52:57,502 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 58 transitions. [2019-12-27 16:52:57,502 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:52:57,503 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:52:57,503 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:52:57,503 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:52:57,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:52:57,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:52:57,504 INFO L87 Difference]: Start difference. First operand 42470 states and 151203 transitions. Second operand 5 states. [2019-12-27 16:52:58,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:52:58,162 INFO L93 Difference]: Finished difference Result 61996 states and 217115 transitions. [2019-12-27 16:52:58,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:52:58,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 16:52:58,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:52:58,708 INFO L225 Difference]: With dead ends: 61996 [2019-12-27 16:52:58,709 INFO L226 Difference]: Without dead ends: 61973 [2019-12-27 16:52:58,709 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:52:58,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61973 states. [2019-12-27 16:52:59,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61973 to 45286. [2019-12-27 16:52:59,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45286 states. [2019-12-27 16:52:59,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45286 states to 45286 states and 161233 transitions. [2019-12-27 16:52:59,583 INFO L78 Accepts]: Start accepts. Automaton has 45286 states and 161233 transitions. Word has length 24 [2019-12-27 16:52:59,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:52:59,583 INFO L462 AbstractCegarLoop]: Abstraction has 45286 states and 161233 transitions. [2019-12-27 16:52:59,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:52:59,584 INFO L276 IsEmpty]: Start isEmpty. Operand 45286 states and 161233 transitions. [2019-12-27 16:52:59,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-27 16:52:59,596 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:52:59,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:52:59,596 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:52:59,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:52:59,597 INFO L82 PathProgramCache]: Analyzing trace with hash 127528843, now seen corresponding path program 1 times [2019-12-27 16:52:59,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:52:59,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440918795] [2019-12-27 16:52:59,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:52:59,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:52:59,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:52:59,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440918795] [2019-12-27 16:52:59,689 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:52:59,689 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:52:59,689 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1960066378] [2019-12-27 16:52:59,689 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:52:59,693 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:52:59,702 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 42 states and 58 transitions. [2019-12-27 16:52:59,702 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:52:59,703 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:52:59,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:52:59,703 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:52:59,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:52:59,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:52:59,704 INFO L87 Difference]: Start difference. First operand 45286 states and 161233 transitions. Second operand 5 states. [2019-12-27 16:53:00,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:53:00,700 INFO L93 Difference]: Finished difference Result 63893 states and 223312 transitions. [2019-12-27 16:53:00,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 16:53:00,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-27 16:53:00,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:53:00,850 INFO L225 Difference]: With dead ends: 63893 [2019-12-27 16:53:00,851 INFO L226 Difference]: Without dead ends: 63870 [2019-12-27 16:53:00,851 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:53:01,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63870 states. [2019-12-27 16:53:01,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63870 to 41796. [2019-12-27 16:53:01,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41796 states. [2019-12-27 16:53:01,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41796 states to 41796 states and 148592 transitions. [2019-12-27 16:53:01,753 INFO L78 Accepts]: Start accepts. Automaton has 41796 states and 148592 transitions. Word has length 24 [2019-12-27 16:53:01,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:53:01,753 INFO L462 AbstractCegarLoop]: Abstraction has 41796 states and 148592 transitions. [2019-12-27 16:53:01,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:53:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 41796 states and 148592 transitions. [2019-12-27 16:53:01,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 16:53:01,774 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:53:01,774 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-27 16:53:01,774 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:53:01,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:53:01,774 INFO L82 PathProgramCache]: Analyzing trace with hash -2134071175, now seen corresponding path program 1 times [2019-12-27 16:53:01,775 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:53:01,775 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552027567] [2019-12-27 16:53:01,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:53:01,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:53:01,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:53:01,870 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552027567] [2019-12-27 16:53:01,870 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:53:01,870 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 16:53:01,870 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1990870997] [2019-12-27 16:53:01,870 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:53:01,876 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:53:01,884 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 35 states and 40 transitions. [2019-12-27 16:53:01,884 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:53:01,885 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:53:01,885 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:53:01,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:53:01,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:53:01,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:53:01,886 INFO L87 Difference]: Start difference. First operand 41796 states and 148592 transitions. Second operand 5 states. [2019-12-27 16:53:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:53:02,021 INFO L93 Difference]: Finished difference Result 21524 states and 77465 transitions. [2019-12-27 16:53:02,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:53:02,021 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 16:53:02,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:53:02,061 INFO L225 Difference]: With dead ends: 21524 [2019-12-27 16:53:02,061 INFO L226 Difference]: Without dead ends: 21524 [2019-12-27 16:53:02,061 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:53:02,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21524 states. [2019-12-27 16:53:02,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21524 to 21220. [2019-12-27 16:53:02,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21220 states. [2019-12-27 16:53:02,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21220 states to 21220 states and 76433 transitions. [2019-12-27 16:53:02,675 INFO L78 Accepts]: Start accepts. Automaton has 21220 states and 76433 transitions. Word has length 28 [2019-12-27 16:53:02,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:53:02,676 INFO L462 AbstractCegarLoop]: Abstraction has 21220 states and 76433 transitions. [2019-12-27 16:53:02,676 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:53:02,676 INFO L276 IsEmpty]: Start isEmpty. Operand 21220 states and 76433 transitions. [2019-12-27 16:53:02,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 16:53:02,713 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:53:02,713 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:53:02,714 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:53:02,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:53:02,714 INFO L82 PathProgramCache]: Analyzing trace with hash -16126003, now seen corresponding path program 1 times [2019-12-27 16:53:02,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:53:02,715 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881678795] [2019-12-27 16:53:02,715 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:53:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:53:02,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:53:02,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881678795] [2019-12-27 16:53:02,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:53:02,791 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:53:02,791 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1080824441] [2019-12-27 16:53:02,792 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:53:02,801 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:53:02,830 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 104 transitions. [2019-12-27 16:53:02,831 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:53:02,832 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 16:53:02,832 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:53:02,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:53:02,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:53:02,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:53:02,833 INFO L87 Difference]: Start difference. First operand 21220 states and 76433 transitions. Second operand 4 states. [2019-12-27 16:53:02,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:53:02,972 INFO L93 Difference]: Finished difference Result 34004 states and 122814 transitions. [2019-12-27 16:53:02,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 16:53:02,973 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-27 16:53:02,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:53:03,008 INFO L225 Difference]: With dead ends: 34004 [2019-12-27 16:53:03,008 INFO L226 Difference]: Without dead ends: 18095 [2019-12-27 16:53:03,008 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-27 16:53:03,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18095 states. [2019-12-27 16:53:03,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18095 to 17989. [2019-12-27 16:53:03,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17989 states. [2019-12-27 16:53:03,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17989 states to 17989 states and 64168 transitions. [2019-12-27 16:53:03,327 INFO L78 Accepts]: Start accepts. Automaton has 17989 states and 64168 transitions. Word has length 42 [2019-12-27 16:53:03,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:53:03,327 INFO L462 AbstractCegarLoop]: Abstraction has 17989 states and 64168 transitions. [2019-12-27 16:53:03,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:53:03,327 INFO L276 IsEmpty]: Start isEmpty. Operand 17989 states and 64168 transitions. [2019-12-27 16:53:03,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 16:53:03,357 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:53:03,357 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-27 16:53:03,357 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:53:03,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:53:03,357 INFO L82 PathProgramCache]: Analyzing trace with hash 932410289, now seen corresponding path program 2 times [2019-12-27 16:53:03,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:53:03,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183123676] [2019-12-27 16:53:03,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:53:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:53:03,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:53:03,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183123676] [2019-12-27 16:53:03,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:53:03,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:53:03,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [639570039] [2019-12-27 16:53:03,425 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:53:03,434 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:53:03,471 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 91 states and 146 transitions. [2019-12-27 16:53:03,471 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:53:03,485 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:53:03,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 16:53:03,487 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:53:03,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 16:53:03,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:53:03,488 INFO L87 Difference]: Start difference. First operand 17989 states and 64168 transitions. Second operand 5 states. [2019-12-27 16:53:03,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:53:03,957 INFO L93 Difference]: Finished difference Result 35124 states and 121062 transitions. [2019-12-27 16:53:03,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:53:03,957 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-27 16:53:03,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:53:04,009 INFO L225 Difference]: With dead ends: 35124 [2019-12-27 16:53:04,010 INFO L226 Difference]: Without dead ends: 27569 [2019-12-27 16:53:04,010 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:53:04,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27569 states. [2019-12-27 16:53:04,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27569 to 18207. [2019-12-27 16:53:04,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18207 states. [2019-12-27 16:53:04,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18207 states to 18207 states and 64042 transitions. [2019-12-27 16:53:04,550 INFO L78 Accepts]: Start accepts. Automaton has 18207 states and 64042 transitions. Word has length 42 [2019-12-27 16:53:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:53:04,550 INFO L462 AbstractCegarLoop]: Abstraction has 18207 states and 64042 transitions. [2019-12-27 16:53:04,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 16:53:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand 18207 states and 64042 transitions. [2019-12-27 16:53:04,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 16:53:04,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:53:04,574 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:53:04,575 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:53:04,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:53:04,575 INFO L82 PathProgramCache]: Analyzing trace with hash 10474927, now seen corresponding path program 3 times [2019-12-27 16:53:04,576 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:53:04,576 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463506209] [2019-12-27 16:53:04,576 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:53:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:53:04,647 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:53:04,647 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463506209] [2019-12-27 16:53:04,647 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:53:04,647 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 16:53:04,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [145108202] [2019-12-27 16:53:04,648 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:53:04,657 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:53:04,709 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 107 states and 187 transitions. [2019-12-27 16:53:04,709 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:53:04,726 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:53:04,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:53:04,727 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:53:04,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:53:04,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:53:04,728 INFO L87 Difference]: Start difference. First operand 18207 states and 64042 transitions. Second operand 7 states. [2019-12-27 16:53:05,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:53:05,137 INFO L93 Difference]: Finished difference Result 17572 states and 62345 transitions. [2019-12-27 16:53:05,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 16:53:05,137 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 42 [2019-12-27 16:53:05,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:53:05,177 INFO L225 Difference]: With dead ends: 17572 [2019-12-27 16:53:05,177 INFO L226 Difference]: Without dead ends: 13913 [2019-12-27 16:53:05,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:53:05,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13913 states. [2019-12-27 16:53:05,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13913 to 12959. [2019-12-27 16:53:05,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12959 states. [2019-12-27 16:53:05,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12959 states to 12959 states and 47493 transitions. [2019-12-27 16:53:05,524 INFO L78 Accepts]: Start accepts. Automaton has 12959 states and 47493 transitions. Word has length 42 [2019-12-27 16:53:05,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:53:05,525 INFO L462 AbstractCegarLoop]: Abstraction has 12959 states and 47493 transitions. [2019-12-27 16:53:05,525 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:53:05,525 INFO L276 IsEmpty]: Start isEmpty. Operand 12959 states and 47493 transitions. [2019-12-27 16:53:05,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:53:05,543 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:53:05,543 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:53:05,544 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:53:05,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:53:05,544 INFO L82 PathProgramCache]: Analyzing trace with hash -888538317, now seen corresponding path program 1 times [2019-12-27 16:53:05,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:53:05,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964940990] [2019-12-27 16:53:05,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:53:05,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:53:05,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:53:05,619 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964940990] [2019-12-27 16:53:05,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:53:05,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 16:53:05,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [391697410] [2019-12-27 16:53:05,620 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:53:05,638 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:53:06,029 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 255 states and 520 transitions. [2019-12-27 16:53:06,029 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:53:06,102 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 16:53:06,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 16:53:06,103 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:53:06,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 16:53:06,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 16:53:06,103 INFO L87 Difference]: Start difference. First operand 12959 states and 47493 transitions. Second operand 7 states. [2019-12-27 16:53:06,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:53:06,424 INFO L93 Difference]: Finished difference Result 22958 states and 82866 transitions. [2019-12-27 16:53:06,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 16:53:06,424 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-27 16:53:06,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:53:06,437 INFO L225 Difference]: With dead ends: 22958 [2019-12-27 16:53:06,437 INFO L226 Difference]: Without dead ends: 6552 [2019-12-27 16:53:06,437 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:53:06,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6552 states. [2019-12-27 16:53:06,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6552 to 4031. [2019-12-27 16:53:06,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4031 states. [2019-12-27 16:53:06,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4031 states to 4031 states and 13323 transitions. [2019-12-27 16:53:06,531 INFO L78 Accepts]: Start accepts. Automaton has 4031 states and 13323 transitions. Word has length 57 [2019-12-27 16:53:06,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:53:06,531 INFO L462 AbstractCegarLoop]: Abstraction has 4031 states and 13323 transitions. [2019-12-27 16:53:06,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 16:53:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 4031 states and 13323 transitions. [2019-12-27 16:53:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:53:06,536 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:53:06,536 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:53:06,536 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:53:06,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:53:06,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1824422047, now seen corresponding path program 2 times [2019-12-27 16:53:06,537 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:53:06,537 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432340897] [2019-12-27 16:53:06,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:53:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:53:06,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:53:06,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432340897] [2019-12-27 16:53:06,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:53:06,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:53:06,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1541098016] [2019-12-27 16:53:06,624 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:53:06,642 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:53:06,765 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 283 transitions. [2019-12-27 16:53:06,765 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:53:06,814 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 16:53:06,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 16:53:06,815 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:53:06,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 16:53:06,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 16:53:06,815 INFO L87 Difference]: Start difference. First operand 4031 states and 13323 transitions. Second operand 9 states. [2019-12-27 16:53:07,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:53:07,793 INFO L93 Difference]: Finished difference Result 12565 states and 40040 transitions. [2019-12-27 16:53:07,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:53:07,794 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-27 16:53:07,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:53:07,809 INFO L225 Difference]: With dead ends: 12565 [2019-12-27 16:53:07,809 INFO L226 Difference]: Without dead ends: 9208 [2019-12-27 16:53:07,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2019-12-27 16:53:07,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9208 states. [2019-12-27 16:53:07,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9208 to 5208. [2019-12-27 16:53:07,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5208 states. [2019-12-27 16:53:07,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5208 states to 5208 states and 17102 transitions. [2019-12-27 16:53:07,921 INFO L78 Accepts]: Start accepts. Automaton has 5208 states and 17102 transitions. Word has length 57 [2019-12-27 16:53:07,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:53:07,921 INFO L462 AbstractCegarLoop]: Abstraction has 5208 states and 17102 transitions. [2019-12-27 16:53:07,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 16:53:07,921 INFO L276 IsEmpty]: Start isEmpty. Operand 5208 states and 17102 transitions. [2019-12-27 16:53:07,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:53:07,928 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:53:07,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:53:07,929 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:53:07,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:53:07,929 INFO L82 PathProgramCache]: Analyzing trace with hash 1398547123, now seen corresponding path program 3 times [2019-12-27 16:53:07,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:53:07,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131902081] [2019-12-27 16:53:07,930 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:53:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:53:08,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:53:08,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131902081] [2019-12-27 16:53:08,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:53:08,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 16:53:08,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [812739963] [2019-12-27 16:53:08,020 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:53:08,038 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:53:08,283 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 165 states and 284 transitions. [2019-12-27 16:53:08,284 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:53:08,415 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 16:53:08,416 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:53:08,416 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:53:08,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:53:08,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:53:08,417 INFO L87 Difference]: Start difference. First operand 5208 states and 17102 transitions. Second operand 10 states. [2019-12-27 16:53:08,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:53:08,786 INFO L93 Difference]: Finished difference Result 9670 states and 31030 transitions. [2019-12-27 16:53:08,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 16:53:08,787 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-12-27 16:53:08,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:53:08,801 INFO L225 Difference]: With dead ends: 9670 [2019-12-27 16:53:08,801 INFO L226 Difference]: Without dead ends: 7088 [2019-12-27 16:53:08,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 4 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:53:08,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2019-12-27 16:53:08,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 6224. [2019-12-27 16:53:08,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6224 states. [2019-12-27 16:53:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6224 states to 6224 states and 20237 transitions. [2019-12-27 16:53:08,941 INFO L78 Accepts]: Start accepts. Automaton has 6224 states and 20237 transitions. Word has length 57 [2019-12-27 16:53:08,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:53:08,942 INFO L462 AbstractCegarLoop]: Abstraction has 6224 states and 20237 transitions. [2019-12-27 16:53:08,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:53:08,942 INFO L276 IsEmpty]: Start isEmpty. Operand 6224 states and 20237 transitions. [2019-12-27 16:53:08,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:53:08,949 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:53:08,949 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:53:08,949 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:53:08,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:53:08,950 INFO L82 PathProgramCache]: Analyzing trace with hash -182184551, now seen corresponding path program 4 times [2019-12-27 16:53:08,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:53:08,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680038570] [2019-12-27 16:53:08,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:53:08,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:53:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:53:09,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680038570] [2019-12-27 16:53:09,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:53:09,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:53:09,075 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [799926751] [2019-12-27 16:53:09,076 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:53:09,105 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:53:09,295 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 190 states and 358 transitions. [2019-12-27 16:53:09,295 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:53:09,494 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 20 times. [2019-12-27 16:53:09,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 16:53:09,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:53:09,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 16:53:09,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 16:53:09,495 INFO L87 Difference]: Start difference. First operand 6224 states and 20237 transitions. Second operand 10 states. [2019-12-27 16:53:11,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:53:11,417 INFO L93 Difference]: Finished difference Result 45824 states and 151598 transitions. [2019-12-27 16:53:11,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-27 16:53:11,418 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 57 [2019-12-27 16:53:11,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:53:11,478 INFO L225 Difference]: With dead ends: 45824 [2019-12-27 16:53:11,479 INFO L226 Difference]: Without dead ends: 36272 [2019-12-27 16:53:11,480 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 14 SyntacticMatches, 11 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 654 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=474, Invalid=1688, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 16:53:11,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36272 states. [2019-12-27 16:53:11,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36272 to 8997. [2019-12-27 16:53:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8997 states. [2019-12-27 16:53:11,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8997 states to 8997 states and 29720 transitions. [2019-12-27 16:53:11,949 INFO L78 Accepts]: Start accepts. Automaton has 8997 states and 29720 transitions. Word has length 57 [2019-12-27 16:53:11,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:53:11,950 INFO L462 AbstractCegarLoop]: Abstraction has 8997 states and 29720 transitions. [2019-12-27 16:53:11,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 16:53:11,950 INFO L276 IsEmpty]: Start isEmpty. Operand 8997 states and 29720 transitions. [2019-12-27 16:53:11,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:53:11,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:53:11,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:53:11,960 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:53:11,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:53:11,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1662360063, now seen corresponding path program 5 times [2019-12-27 16:53:11,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:53:11,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [348998123] [2019-12-27 16:53:11,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:53:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:53:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:53:12,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [348998123] [2019-12-27 16:53:12,091 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:53:12,091 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:53:12,091 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1907497907] [2019-12-27 16:53:12,091 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:53:12,163 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:53:12,406 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 351 transitions. [2019-12-27 16:53:12,406 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:53:12,836 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 33 times. [2019-12-27 16:53:12,837 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:53:12,837 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:53:12,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:53:12,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:53:12,838 INFO L87 Difference]: Start difference. First operand 8997 states and 29720 transitions. Second operand 13 states. [2019-12-27 16:53:18,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:53:18,606 INFO L93 Difference]: Finished difference Result 59720 states and 192553 transitions. [2019-12-27 16:53:18,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-12-27 16:53:18,606 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2019-12-27 16:53:18,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:53:18,690 INFO L225 Difference]: With dead ends: 59720 [2019-12-27 16:53:18,690 INFO L226 Difference]: Without dead ends: 49938 [2019-12-27 16:53:18,693 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 20 SyntacticMatches, 14 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3466 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1650, Invalid=7470, Unknown=0, NotChecked=0, Total=9120 [2019-12-27 16:53:18,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49938 states. [2019-12-27 16:53:19,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49938 to 10001. [2019-12-27 16:53:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10001 states. [2019-12-27 16:53:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10001 states to 10001 states and 32969 transitions. [2019-12-27 16:53:19,147 INFO L78 Accepts]: Start accepts. Automaton has 10001 states and 32969 transitions. Word has length 57 [2019-12-27 16:53:19,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:53:19,147 INFO L462 AbstractCegarLoop]: Abstraction has 10001 states and 32969 transitions. [2019-12-27 16:53:19,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:53:19,147 INFO L276 IsEmpty]: Start isEmpty. Operand 10001 states and 32969 transitions. [2019-12-27 16:53:19,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-27 16:53:19,158 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:53:19,158 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:53:19,158 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:53:19,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:53:19,159 INFO L82 PathProgramCache]: Analyzing trace with hash 955367681, now seen corresponding path program 6 times [2019-12-27 16:53:19,159 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:53:19,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896586371] [2019-12-27 16:53:19,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:53:19,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:53:19,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:53:19,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896586371] [2019-12-27 16:53:19,325 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:53:19,325 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:53:19,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1070353124] [2019-12-27 16:53:19,325 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:53:19,343 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:53:19,524 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 156 states and 268 transitions. [2019-12-27 16:53:19,524 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:53:19,525 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 16:53:19,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 16:53:19,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:53:19,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 16:53:19,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:53:19,527 INFO L87 Difference]: Start difference. First operand 10001 states and 32969 transitions. Second operand 3 states. [2019-12-27 16:53:19,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:53:19,590 INFO L93 Difference]: Finished difference Result 9999 states and 32964 transitions. [2019-12-27 16:53:19,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 16:53:19,591 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-27 16:53:19,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:53:19,613 INFO L225 Difference]: With dead ends: 9999 [2019-12-27 16:53:19,613 INFO L226 Difference]: Without dead ends: 9999 [2019-12-27 16:53:19,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 16:53:19,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9999 states. [2019-12-27 16:53:19,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9999 to 9999. [2019-12-27 16:53:19,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9999 states. [2019-12-27 16:53:19,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9999 states to 9999 states and 32964 transitions. [2019-12-27 16:53:19,788 INFO L78 Accepts]: Start accepts. Automaton has 9999 states and 32964 transitions. Word has length 57 [2019-12-27 16:53:19,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:53:19,789 INFO L462 AbstractCegarLoop]: Abstraction has 9999 states and 32964 transitions. [2019-12-27 16:53:19,789 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 16:53:19,789 INFO L276 IsEmpty]: Start isEmpty. Operand 9999 states and 32964 transitions. [2019-12-27 16:53:19,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-27 16:53:19,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:53:19,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:53:19,801 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:53:19,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:53:19,801 INFO L82 PathProgramCache]: Analyzing trace with hash 2044839876, now seen corresponding path program 1 times [2019-12-27 16:53:19,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:53:19,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840093124] [2019-12-27 16:53:19,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:53:19,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:53:19,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:53:19,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840093124] [2019-12-27 16:53:19,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:53:19,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 16:53:19,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [544941765] [2019-12-27 16:53:19,877 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:53:19,893 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:53:20,074 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 157 states and 269 transitions. [2019-12-27 16:53:20,074 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:53:20,082 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 16:53:20,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 16:53:20,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:53:20,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 16:53:20,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 16:53:20,083 INFO L87 Difference]: Start difference. First operand 9999 states and 32964 transitions. Second operand 4 states. [2019-12-27 16:53:20,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:53:20,308 INFO L93 Difference]: Finished difference Result 13457 states and 42818 transitions. [2019-12-27 16:53:20,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 16:53:20,309 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-12-27 16:53:20,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:53:20,330 INFO L225 Difference]: With dead ends: 13457 [2019-12-27 16:53:20,331 INFO L226 Difference]: Without dead ends: 13457 [2019-12-27 16:53:20,331 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 16:53:20,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13457 states. [2019-12-27 16:53:20,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13457 to 8894. [2019-12-27 16:53:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8894 states. [2019-12-27 16:53:20,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8894 states to 8894 states and 28405 transitions. [2019-12-27 16:53:20,498 INFO L78 Accepts]: Start accepts. Automaton has 8894 states and 28405 transitions. Word has length 58 [2019-12-27 16:53:20,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:53:20,498 INFO L462 AbstractCegarLoop]: Abstraction has 8894 states and 28405 transitions. [2019-12-27 16:53:20,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 16:53:20,498 INFO L276 IsEmpty]: Start isEmpty. Operand 8894 states and 28405 transitions. [2019-12-27 16:53:20,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 16:53:20,508 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:53:20,508 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:53:20,508 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:53:20,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:53:20,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1949196794, now seen corresponding path program 1 times [2019-12-27 16:53:20,509 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:53:20,509 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651880358] [2019-12-27 16:53:20,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:53:20,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:53:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:53:20,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651880358] [2019-12-27 16:53:20,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:53:20,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:53:20,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1480433585] [2019-12-27 16:53:20,690 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:53:20,712 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:53:20,871 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 152 states and 258 transitions. [2019-12-27 16:53:20,872 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:53:21,020 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 14 times. [2019-12-27 16:53:21,021 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 16:53:21,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:53:21,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 16:53:21,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2019-12-27 16:53:21,021 INFO L87 Difference]: Start difference. First operand 8894 states and 28405 transitions. Second operand 13 states. [2019-12-27 16:53:22,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:53:22,749 INFO L93 Difference]: Finished difference Result 14788 states and 46490 transitions. [2019-12-27 16:53:22,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 16:53:22,750 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-12-27 16:53:22,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:53:22,767 INFO L225 Difference]: With dead ends: 14788 [2019-12-27 16:53:22,767 INFO L226 Difference]: Without dead ends: 10806 [2019-12-27 16:53:22,768 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2019-12-27 16:53:22,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10806 states. [2019-12-27 16:53:22,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10806 to 9386. [2019-12-27 16:53:22,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9386 states. [2019-12-27 16:53:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9386 states to 9386 states and 29779 transitions. [2019-12-27 16:53:22,922 INFO L78 Accepts]: Start accepts. Automaton has 9386 states and 29779 transitions. Word has length 59 [2019-12-27 16:53:22,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:53:22,922 INFO L462 AbstractCegarLoop]: Abstraction has 9386 states and 29779 transitions. [2019-12-27 16:53:22,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 16:53:22,922 INFO L276 IsEmpty]: Start isEmpty. Operand 9386 states and 29779 transitions. [2019-12-27 16:53:22,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 16:53:22,932 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:53:22,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:53:22,933 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:53:22,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:53:22,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1854145516, now seen corresponding path program 2 times [2019-12-27 16:53:22,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:53:22,934 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657980546] [2019-12-27 16:53:22,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:53:22,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:53:23,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:53:23,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657980546] [2019-12-27 16:53:23,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:53:23,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:53:23,149 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [574201408] [2019-12-27 16:53:23,149 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:53:23,167 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:53:23,456 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 449 transitions. [2019-12-27 16:53:23,456 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:53:23,506 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:53:23,843 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:53:24,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:53:24,279 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 37 [2019-12-27 16:53:24,281 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 16:53:24,281 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 16:53:24,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:53:24,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 16:53:24,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-12-27 16:53:24,282 INFO L87 Difference]: Start difference. First operand 9386 states and 29779 transitions. Second operand 19 states. [2019-12-27 16:53:25,943 WARN L192 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 40 [2019-12-27 16:53:26,133 WARN L192 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 55 [2019-12-27 16:53:27,813 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2019-12-27 16:53:29,038 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-12-27 16:53:29,300 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-12-27 16:53:29,466 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 46 [2019-12-27 16:53:30,287 WARN L192 SmtUtils]: Spent 205.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-12-27 16:53:30,434 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-12-27 16:53:31,199 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-12-27 16:53:31,595 WARN L192 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 54 [2019-12-27 16:53:32,377 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 42 [2019-12-27 16:53:32,982 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 45 [2019-12-27 16:53:35,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:53:35,478 INFO L93 Difference]: Finished difference Result 41342 states and 126919 transitions. [2019-12-27 16:53:35,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-12-27 16:53:35,479 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2019-12-27 16:53:35,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:53:35,526 INFO L225 Difference]: With dead ends: 41342 [2019-12-27 16:53:35,526 INFO L226 Difference]: Without dead ends: 30671 [2019-12-27 16:53:35,528 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2335 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=1231, Invalid=6079, Unknown=0, NotChecked=0, Total=7310 [2019-12-27 16:53:35,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30671 states. [2019-12-27 16:53:35,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30671 to 10746. [2019-12-27 16:53:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10746 states. [2019-12-27 16:53:35,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10746 states to 10746 states and 34045 transitions. [2019-12-27 16:53:35,842 INFO L78 Accepts]: Start accepts. Automaton has 10746 states and 34045 transitions. Word has length 59 [2019-12-27 16:53:35,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:53:35,842 INFO L462 AbstractCegarLoop]: Abstraction has 10746 states and 34045 transitions. [2019-12-27 16:53:35,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 16:53:35,842 INFO L276 IsEmpty]: Start isEmpty. Operand 10746 states and 34045 transitions. [2019-12-27 16:53:35,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 16:53:35,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:53:35,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:53:35,855 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:53:35,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:53:35,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1277650624, now seen corresponding path program 3 times [2019-12-27 16:53:35,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:53:35,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57201657] [2019-12-27 16:53:35,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:53:35,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:53:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:53:36,020 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57201657] [2019-12-27 16:53:36,020 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:53:36,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:53:36,021 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [682335430] [2019-12-27 16:53:36,021 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:53:36,036 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:53:36,355 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 284 transitions. [2019-12-27 16:53:36,355 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:53:36,359 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 16:53:36,597 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 16:53:36,598 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 16:53:36,598 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:53:36,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 16:53:36,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 16:53:36,599 INFO L87 Difference]: Start difference. First operand 10746 states and 34045 transitions. Second operand 15 states. [2019-12-27 16:53:38,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:53:38,278 INFO L93 Difference]: Finished difference Result 15077 states and 46778 transitions. [2019-12-27 16:53:38,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 16:53:38,278 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 59 [2019-12-27 16:53:38,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:53:38,298 INFO L225 Difference]: With dead ends: 15077 [2019-12-27 16:53:38,299 INFO L226 Difference]: Without dead ends: 12313 [2019-12-27 16:53:38,299 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 12 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=107, Invalid=493, Unknown=0, NotChecked=0, Total=600 [2019-12-27 16:53:38,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12313 states. [2019-12-27 16:53:38,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12313 to 10316. [2019-12-27 16:53:38,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10316 states. [2019-12-27 16:53:38,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10316 states to 10316 states and 32757 transitions. [2019-12-27 16:53:38,471 INFO L78 Accepts]: Start accepts. Automaton has 10316 states and 32757 transitions. Word has length 59 [2019-12-27 16:53:38,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:53:38,472 INFO L462 AbstractCegarLoop]: Abstraction has 10316 states and 32757 transitions. [2019-12-27 16:53:38,472 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 16:53:38,472 INFO L276 IsEmpty]: Start isEmpty. Operand 10316 states and 32757 transitions. [2019-12-27 16:53:38,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 16:53:38,482 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:53:38,482 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:53:38,483 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:53:38,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:53:38,483 INFO L82 PathProgramCache]: Analyzing trace with hash -794252350, now seen corresponding path program 4 times [2019-12-27 16:53:38,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:53:38,484 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211644400] [2019-12-27 16:53:38,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:53:38,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:53:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:53:38,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211644400] [2019-12-27 16:53:38,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:53:38,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 16:53:38,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [613993649] [2019-12-27 16:53:38,723 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:53:38,741 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:53:38,967 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 209 states and 402 transitions. [2019-12-27 16:53:38,968 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:53:39,435 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 25 times. [2019-12-27 16:53:39,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 16:53:39,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:53:39,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 16:53:39,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-12-27 16:53:39,437 INFO L87 Difference]: Start difference. First operand 10316 states and 32757 transitions. Second operand 19 states. [2019-12-27 16:53:44,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:53:44,002 INFO L93 Difference]: Finished difference Result 23343 states and 72092 transitions. [2019-12-27 16:53:44,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2019-12-27 16:53:44,003 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 59 [2019-12-27 16:53:44,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:53:44,036 INFO L225 Difference]: With dead ends: 23343 [2019-12-27 16:53:44,037 INFO L226 Difference]: Without dead ends: 22407 [2019-12-27 16:53:44,039 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 12 SyntacticMatches, 5 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2356 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1114, Invalid=6368, Unknown=0, NotChecked=0, Total=7482 [2019-12-27 16:53:44,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22407 states. [2019-12-27 16:53:44,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22407 to 14449. [2019-12-27 16:53:44,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14449 states. [2019-12-27 16:53:44,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14449 states to 14449 states and 45725 transitions. [2019-12-27 16:53:44,327 INFO L78 Accepts]: Start accepts. Automaton has 14449 states and 45725 transitions. Word has length 59 [2019-12-27 16:53:44,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:53:44,327 INFO L462 AbstractCegarLoop]: Abstraction has 14449 states and 45725 transitions. [2019-12-27 16:53:44,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 16:53:44,327 INFO L276 IsEmpty]: Start isEmpty. Operand 14449 states and 45725 transitions. [2019-12-27 16:53:44,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 16:53:44,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:53:44,344 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:53:44,344 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:53:44,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:53:44,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1656101628, now seen corresponding path program 5 times [2019-12-27 16:53:44,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:53:44,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935020660] [2019-12-27 16:53:44,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:53:44,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:53:44,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:53:44,550 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935020660] [2019-12-27 16:53:44,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:53:44,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 16:53:44,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1063300719] [2019-12-27 16:53:44,550 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:53:44,568 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:53:44,760 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 215 states and 425 transitions. [2019-12-27 16:53:44,760 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:53:45,428 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 30 times. [2019-12-27 16:53:45,429 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-27 16:53:45,429 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:53:45,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-27 16:53:45,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-12-27 16:53:45,430 INFO L87 Difference]: Start difference. First operand 14449 states and 45725 transitions. Second operand 20 states. [2019-12-27 16:53:50,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:53:50,415 INFO L93 Difference]: Finished difference Result 24283 states and 74704 transitions. [2019-12-27 16:53:50,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2019-12-27 16:53:50,416 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 59 [2019-12-27 16:53:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:53:50,451 INFO L225 Difference]: With dead ends: 24283 [2019-12-27 16:53:50,451 INFO L226 Difference]: Without dead ends: 23973 [2019-12-27 16:53:50,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 15 SyntacticMatches, 8 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2271 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1071, Invalid=6239, Unknown=0, NotChecked=0, Total=7310 [2019-12-27 16:53:50,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23973 states. [2019-12-27 16:53:50,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23973 to 14309. [2019-12-27 16:53:50,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14309 states. [2019-12-27 16:53:50,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14309 states to 14309 states and 45295 transitions. [2019-12-27 16:53:50,749 INFO L78 Accepts]: Start accepts. Automaton has 14309 states and 45295 transitions. Word has length 59 [2019-12-27 16:53:50,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:53:50,749 INFO L462 AbstractCegarLoop]: Abstraction has 14309 states and 45295 transitions. [2019-12-27 16:53:50,749 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-27 16:53:50,749 INFO L276 IsEmpty]: Start isEmpty. Operand 14309 states and 45295 transitions. [2019-12-27 16:53:50,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 16:53:50,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:53:50,765 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:53:50,766 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:53:50,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:53:50,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1556260520, now seen corresponding path program 6 times [2019-12-27 16:53:50,767 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:53:50,767 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001987089] [2019-12-27 16:53:50,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:53:50,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 16:53:50,931 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 16:53:50,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001987089] [2019-12-27 16:53:50,932 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 16:53:50,932 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 16:53:50,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [335765730] [2019-12-27 16:53:50,932 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 16:53:50,949 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 16:53:51,253 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 175 states and 316 transitions. [2019-12-27 16:53:51,254 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 16:53:51,612 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 16:53:51,613 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-27 16:53:51,613 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 16:53:51,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-27 16:53:51,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2019-12-27 16:53:51,614 INFO L87 Difference]: Start difference. First operand 14309 states and 45295 transitions. Second operand 17 states. [2019-12-27 16:53:54,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 16:53:54,109 INFO L93 Difference]: Finished difference Result 20987 states and 64589 transitions. [2019-12-27 16:53:54,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-27 16:53:54,109 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 59 [2019-12-27 16:53:54,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 16:53:54,137 INFO L225 Difference]: With dead ends: 20987 [2019-12-27 16:53:54,138 INFO L226 Difference]: Without dead ends: 18315 [2019-12-27 16:53:54,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 14 SyntacticMatches, 4 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 445 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=374, Invalid=1696, Unknown=0, NotChecked=0, Total=2070 [2019-12-27 16:53:54,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18315 states. [2019-12-27 16:53:54,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18315 to 13123. [2019-12-27 16:53:54,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13123 states. [2019-12-27 16:53:54,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13123 states to 13123 states and 41721 transitions. [2019-12-27 16:53:54,386 INFO L78 Accepts]: Start accepts. Automaton has 13123 states and 41721 transitions. Word has length 59 [2019-12-27 16:53:54,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 16:53:54,386 INFO L462 AbstractCegarLoop]: Abstraction has 13123 states and 41721 transitions. [2019-12-27 16:53:54,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-27 16:53:54,387 INFO L276 IsEmpty]: Start isEmpty. Operand 13123 states and 41721 transitions. [2019-12-27 16:53:54,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-27 16:53:54,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 16:53:54,402 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 16:53:54,402 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 16:53:54,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 16:53:54,402 INFO L82 PathProgramCache]: Analyzing trace with hash -765256248, now seen corresponding path program 7 times [2019-12-27 16:53:54,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 16:53:54,403 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325963423] [2019-12-27 16:53:54,403 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 16:53:54,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:53:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 16:53:54,513 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 16:53:54,513 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 16:53:54,517 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [860] [860] ULTIMATE.startENTRY-->L850: Formula: (let ((.cse0 (store |v_#valid_82| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (= 0 v_~y$r_buff1_thd4~0_204) (= 0 v_~y$read_delayed_var~0.offset_8) (= v_~main$tmp_guard1~0_50 0) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t957~0.base_26| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t957~0.base_26|) |v_ULTIMATE.start_main_~#t957~0.offset_17| 0)) |v_#memory_int_27|) (= v_~a~0_15 0) (= 0 v_~y$w_buff0~0_524) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t957~0.base_26|) (= 0 v_~y$r_buff0_thd3~0_184) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff0_thd4~0_132) (= v_~y$w_buff0_used~0_906 0) (= |v_#NULL.offset_3| 0) (= v_~weak$$choice2~0_152 0) (= v_~y$r_buff1_thd0~0_180 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t957~0.base_26|)) (= 0 v_~__unbuffered_p0_EAX~0_69) (= 0 v_~y$r_buff0_thd2~0_313) (= v_~y~0_171 0) (= v_~x~0_48 0) (= |v_#length_29| (store |v_#length_30| |v_ULTIMATE.start_main_~#t957~0.base_26| 4)) (= v_~y$mem_tmp~0_33 0) (= 0 v_~__unbuffered_p1_EAX~0_59) (= 0 v_~__unbuffered_p3_EAX~0_47) (= 0 v_~__unbuffered_p3_EBX~0_47) (= 0 v_~weak$$choice0~0_21) (= |v_ULTIMATE.start_main_~#t957~0.offset_17| 0) (= 0 v_~__unbuffered_p2_EAX~0_124) (= 0 v_~y$flush_delayed~0_62) (= |v_#valid_80| (store .cse0 |v_ULTIMATE.start_main_~#t957~0.base_26| 1)) (= 0 v_~y$r_buff1_thd1~0_92) (< 0 |v_#StackHeapBarrier_20|) (= v_~y$w_buff1~0_331 0) (= v_~z~0_40 0) (= 0 |v_#NULL.base_3|) (= v_~y$r_buff0_thd0~0_125 0) (= 0 v_~y$read_delayed_var~0.base_8) (= 0 v_~y$r_buff1_thd2~0_274) (= v_~__unbuffered_cnt~0_218 0) (= v_~y$r_buff0_thd1~0_33 0) (= v_~b~0_43 0) (= 0 v_~y$r_buff1_thd3~0_153) (= v_~y$w_buff1_used~0_620 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_82|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_97|, #NULL.offset=|v_#NULL.offset_3|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_38|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_200|, ULTIMATE.start_main_~#t959~0.base=|v_ULTIMATE.start_main_~#t959~0.base_26|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_15, ~y$mem_tmp~0=v_~y$mem_tmp~0_33, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_69, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_153, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_59, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_33, ~y$flush_delayed~0=v_~y$flush_delayed~0_62, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_47, #length=|v_#length_29|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_124, ULTIMATE.start_main_~#t959~0.offset=|v_ULTIMATE.start_main_~#t959~0.offset_19|, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_28|, ULTIMATE.start_main_~#t960~0.base=|v_ULTIMATE.start_main_~#t960~0.base_24|, ULTIMATE.start_main_~#t960~0.offset=|v_ULTIMATE.start_main_~#t960~0.offset_17|, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_204, ~y$w_buff1~0=v_~y$w_buff1~0_331, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_8, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_313, ULTIMATE.start_main_~#t957~0.offset=|v_ULTIMATE.start_main_~#t957~0.offset_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_218, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_180, ~x~0=v_~x~0_48, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_8, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_906, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_50, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_40|, ULTIMATE.start_main_~#t958~0.offset=|v_ULTIMATE.start_main_~#t958~0.offset_19|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_62|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_92, ~y$w_buff0~0=v_~y$w_buff0~0_524, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_184, ULTIMATE.start_main_~#t958~0.base=|v_ULTIMATE.start_main_~#t958~0.base_25|, ~y~0=v_~y~0_171, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_47, #NULL.base=|v_#NULL.base_3|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_274, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_132, ~b~0=v_~b~0_43, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_34|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_125, #valid=|v_#valid_80|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_40, ~weak$$choice2~0=v_~weak$$choice2~0_152, ULTIMATE.start_main_~#t957~0.base=|v_ULTIMATE.start_main_~#t957~0.base_26|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_620} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t959~0.base, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_~#t959~0.offset, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t960~0.base, ULTIMATE.start_main_~#t960~0.offset, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_~#t957~0.offset, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t958~0.offset, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t958~0.base, ~y~0, ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ~b~0, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ULTIMATE.start_main_~#t957~0.base, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 16:53:54,518 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L850-1-->L852: Formula: (and (= (select |v_#valid_43| |v_ULTIMATE.start_main_~#t958~0.base_12|) 0) (not (= |v_ULTIMATE.start_main_~#t958~0.base_12| 0)) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t958~0.base_12| 4)) (= 0 |v_ULTIMATE.start_main_~#t958~0.offset_11|) (= |v_#valid_42| (store |v_#valid_43| |v_ULTIMATE.start_main_~#t958~0.base_12| 1)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t958~0.base_12|) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t958~0.base_12| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t958~0.base_12|) |v_ULTIMATE.start_main_~#t958~0.offset_11| 1)) |v_#memory_int_19|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_20|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t958~0.base=|v_ULTIMATE.start_main_~#t958~0.base_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_19|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_21|, ULTIMATE.start_main_~#t958~0.offset=|v_ULTIMATE.start_main_~#t958~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t958~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t958~0.offset] because there is no mapped edge [2019-12-27 16:53:54,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [822] [822] L852-1-->L854: Formula: (and (= (store |v_#valid_41| |v_ULTIMATE.start_main_~#t959~0.base_13| 1) |v_#valid_40|) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t959~0.base_13| 4) |v_#length_19|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t959~0.base_13|) (= 0 |v_ULTIMATE.start_main_~#t959~0.offset_11|) (= (select |v_#valid_41| |v_ULTIMATE.start_main_~#t959~0.base_13|) 0) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t959~0.base_13| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t959~0.base_13|) |v_ULTIMATE.start_main_~#t959~0.offset_11| 2)) |v_#memory_int_17|) (not (= |v_ULTIMATE.start_main_~#t959~0.base_13| 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t959~0.offset=|v_ULTIMATE.start_main_~#t959~0.offset_11|, ULTIMATE.start_main_~#t959~0.base=|v_ULTIMATE.start_main_~#t959~0.base_13|} AuxVars[] AssignedVars[#valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t959~0.offset, ULTIMATE.start_main_~#t959~0.base] because there is no mapped edge [2019-12-27 16:53:54,519 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L854-1-->L856: Formula: (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t960~0.base_12|) (= |v_ULTIMATE.start_main_~#t960~0.offset_10| 0) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t960~0.base_12| 1)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t960~0.base_12|) 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t960~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t960~0.base_12|) |v_ULTIMATE.start_main_~#t960~0.offset_10| 3))) (not (= 0 |v_ULTIMATE.start_main_~#t960~0.base_12|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t960~0.base_12| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t960~0.base=|v_ULTIMATE.start_main_~#t960~0.base_12|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_21|, #length=|v_#length_23|, ULTIMATE.start_main_~#t960~0.offset=|v_ULTIMATE.start_main_~#t960~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t960~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t960~0.offset] because there is no mapped edge [2019-12-27 16:53:54,521 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L4-->L801: Formula: (and (= v_~z~0_12 v_~__unbuffered_p2_EAX~0_13) (= v_~y$r_buff0_thd0~0_41 v_~y$r_buff1_thd0~0_36) (= v_~y$r_buff0_thd3~0_35 v_~y$r_buff1_thd3~0_31) (= v_~y$r_buff0_thd4~0_32 v_~y$r_buff1_thd4~0_28) (= v_~y$r_buff1_thd1~0_9 v_~y$r_buff0_thd1~0_9) (not (= v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_48 0)) (= v_~y$r_buff0_thd2~0_103 v_~y$r_buff1_thd2~0_52) (= v_~y$r_buff0_thd3~0_34 1)) InVars {~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_32, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_35, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_48, ~z~0=v_~z~0_12} OutVars{P2Thread1of1ForFork3___VERIFIER_assert_~expression=v_P2Thread1of1ForFork3___VERIFIER_assert_~expression_48, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_52, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_32, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_9, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_28, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_31, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_34, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_41, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_103, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_13, ~z~0=v_~z~0_12, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_36} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~y$r_buff1_thd4~0, ~y$r_buff1_thd3~0, ~y$r_buff0_thd3~0, ~__unbuffered_p2_EAX~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 16:53:54,522 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [818] [818] P0ENTRY-->P0EXIT: Formula: (and (= v_~b~0_20 1) (= v_~x~0_26 v_~__unbuffered_p0_EAX~0_24) (= |v_P0Thread1of1ForFork1_#in~arg.base_18| v_P0Thread1of1ForFork1_~arg.base_18) (= v_P0Thread1of1ForFork1_~arg.offset_18 |v_P0Thread1of1ForFork1_#in~arg.offset_18|) (= (+ v_~__unbuffered_cnt~0_86 1) v_~__unbuffered_cnt~0_85) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_18|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_86, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_18|, ~x~0=v_~x~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_18|, ~b~0=v_~b~0_20, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_18, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_18|, ~x~0=v_~x~0_26, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_18} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, ~b~0, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-27 16:53:54,523 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L827-2-->L827-5: Formula: (let ((.cse0 (= |P3Thread1of1ForFork0_#t~ite33_Out874458350| |P3Thread1of1ForFork0_#t~ite32_Out874458350|)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In874458350 256))) (.cse2 (= 0 (mod ~y$r_buff1_thd4~0_In874458350 256)))) (or (and .cse0 (or .cse1 .cse2) (= ~y~0_In874458350 |P3Thread1of1ForFork0_#t~ite32_Out874458350|)) (and .cse0 (= ~y$w_buff1~0_In874458350 |P3Thread1of1ForFork0_#t~ite32_Out874458350|) (not .cse1) (not .cse2)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In874458350, ~y$w_buff1~0=~y$w_buff1~0_In874458350, ~y~0=~y~0_In874458350, ~y$w_buff1_used~0=~y$w_buff1_used~0_In874458350} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In874458350, ~y$w_buff1~0=~y$w_buff1~0_In874458350, ~y~0=~y~0_In874458350, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out874458350|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out874458350|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In874458350} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-27 16:53:54,524 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L828-->L828-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In210456709 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd4~0_In210456709 256)))) (or (and (not .cse0) (not .cse1) (= |P3Thread1of1ForFork0_#t~ite34_Out210456709| 0)) (and (= |P3Thread1of1ForFork0_#t~ite34_Out210456709| ~y$w_buff0_used~0_In210456709) (or .cse1 .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In210456709, ~y$w_buff0_used~0=~y$w_buff0_used~0_In210456709} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In210456709, ~y$w_buff0_used~0=~y$w_buff0_used~0_In210456709, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out210456709|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-27 16:53:54,526 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd3~0_In1472120494 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1472120494 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In1472120494 |P2Thread1of1ForFork3_#t~ite28_Out1472120494|)) (and (= 0 |P2Thread1of1ForFork3_#t~ite28_Out1472120494|) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1472120494, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1472120494} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1472120494, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1472120494, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out1472120494|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-27 16:53:54,527 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L829-->L829-2: Formula: (let ((.cse3 (= 0 (mod ~y$w_buff0_used~0_In1220761953 256))) (.cse2 (= (mod ~y$r_buff0_thd4~0_In1220761953 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In1220761953 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1220761953 256) 0))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite35_Out1220761953|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$w_buff1_used~0_In1220761953 |P3Thread1of1ForFork0_#t~ite35_Out1220761953|) (or .cse0 .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1220761953, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1220761953, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1220761953, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1220761953} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1220761953, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In1220761953, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1220761953, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out1220761953|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1220761953} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-27 16:53:54,528 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [796] [796] L803-->L803-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In77656374 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In77656374 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In77656374 256))) (.cse3 (= (mod ~y$r_buff0_thd3~0_In77656374 256) 0))) (or (and (= |P2Thread1of1ForFork3_#t~ite29_Out77656374| ~y$w_buff1_used~0_In77656374) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite29_Out77656374| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In77656374, ~y$w_buff0_used~0=~y$w_buff0_used~0_In77656374, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In77656374, ~y$w_buff1_used~0=~y$w_buff1_used~0_In77656374} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In77656374, ~y$w_buff0_used~0=~y$w_buff0_used~0_In77656374, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In77656374, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out77656374|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In77656374} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-27 16:53:54,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [785] [785] L804-->L805: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd3~0_In-813173510 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-813173510 256)))) (or (and (= ~y$r_buff0_thd3~0_Out-813173510 ~y$r_buff0_thd3~0_In-813173510) (or .cse0 .cse1)) (and (not .cse1) (= ~y$r_buff0_thd3~0_Out-813173510 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-813173510, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-813173510} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-813173510|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-813173510, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-813173510} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-27 16:53:54,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L805-->L805-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd3~0_In1590220100 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In1590220100 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1590220100 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In1590220100 256) 0))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd3~0_In1590220100 |P2Thread1of1ForFork3_#t~ite31_Out1590220100|) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork3_#t~ite31_Out1590220100|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1590220100, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1590220100, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1590220100, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1590220100} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1590220100, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1590220100, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1590220100, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out1590220100|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1590220100} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-27 16:53:54,529 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L805-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#t~ite31_36| v_~y$r_buff1_thd3~0_46) (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_71 (+ v_~__unbuffered_cnt~0_72 1)) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_72} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_46, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_35|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_71, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-27 16:53:54,530 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L765-->L765-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1635829192 256)))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1635829192 256)))) (or (and (= (mod ~y$w_buff1_used~0_In-1635829192 256) 0) .cse0) (= (mod ~y$w_buff0_used~0_In-1635829192 256) 0) (and (= 0 (mod ~y$r_buff1_thd2~0_In-1635829192 256)) .cse0))) (= ~y$w_buff0~0_In-1635829192 |P1Thread1of1ForFork2_#t~ite8_Out-1635829192|) (= |P1Thread1of1ForFork2_#t~ite9_Out-1635829192| |P1Thread1of1ForFork2_#t~ite8_Out-1635829192|) .cse1) (and (= ~y$w_buff0~0_In-1635829192 |P1Thread1of1ForFork2_#t~ite9_Out-1635829192|) (= |P1Thread1of1ForFork2_#t~ite8_In-1635829192| |P1Thread1of1ForFork2_#t~ite8_Out-1635829192|) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1635829192, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1635829192, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-1635829192|, ~y$w_buff0~0=~y$w_buff0~0_In-1635829192, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1635829192, ~weak$$choice2~0=~weak$$choice2~0_In-1635829192, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1635829192} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1635829192, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-1635829192|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1635829192, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-1635829192|, ~y$w_buff0~0=~y$w_buff0~0_In-1635829192, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1635829192, ~weak$$choice2~0=~weak$$choice2~0_In-1635829192, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1635829192} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-27 16:53:54,531 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1103504950 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out-1103504950| ~y$w_buff1~0_In-1103504950) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite11_In-1103504950| |P1Thread1of1ForFork2_#t~ite11_Out-1103504950|)) (and (= |P1Thread1of1ForFork2_#t~ite11_Out-1103504950| ~y$w_buff1~0_In-1103504950) (= |P1Thread1of1ForFork2_#t~ite12_Out-1103504950| |P1Thread1of1ForFork2_#t~ite11_Out-1103504950|) (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1103504950 256) 0))) (or (= 0 (mod ~y$w_buff0_used~0_In-1103504950 256)) (and (= (mod ~y$r_buff1_thd2~0_In-1103504950 256) 0) .cse1) (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In-1103504950 256))))) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1103504950, ~y$w_buff1~0=~y$w_buff1~0_In-1103504950, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1103504950, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1103504950, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In-1103504950|, ~weak$$choice2~0=~weak$$choice2~0_In-1103504950, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1103504950} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1103504950, ~y$w_buff1~0=~y$w_buff1~0_In-1103504950, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1103504950, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1103504950, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1103504950|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1103504950|, ~weak$$choice2~0=~weak$$choice2~0_In-1103504950, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1103504950} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 16:53:54,534 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L769-->L770: Formula: (and (= v_~y$r_buff0_thd2~0_106 v_~y$r_buff0_thd2~0_105) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_105, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_11|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 16:53:54,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L770-->L770-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-727637169 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite24_Out-727637169| ~y$r_buff1_thd2~0_In-727637169) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite23_In-727637169| |P1Thread1of1ForFork2_#t~ite23_Out-727637169|)) (and .cse0 (= ~y$r_buff1_thd2~0_In-727637169 |P1Thread1of1ForFork2_#t~ite23_Out-727637169|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-727637169 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-727637169 256)) (and .cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-727637169 256))) (and (= (mod ~y$w_buff1_used~0_In-727637169 256) 0) .cse1))) (= |P1Thread1of1ForFork2_#t~ite24_Out-727637169| |P1Thread1of1ForFork2_#t~ite23_Out-727637169|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-727637169, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-727637169, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-727637169, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In-727637169|, ~weak$$choice2~0=~weak$$choice2~0_In-727637169, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-727637169} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-727637169, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-727637169, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-727637169, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out-727637169|, ~weak$$choice2~0=~weak$$choice2~0_In-727637169, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out-727637169|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-727637169} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-27 16:53:54,535 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L772-->L780: Formula: (and (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (not (= 0 (mod v_~y$flush_delayed~0_10 256))) (= v_~y~0_26 v_~y$mem_tmp~0_7) (= 0 v_~y$flush_delayed~0_9)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_10, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ~y~0=v_~y~0_26, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-27 16:53:54,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd4~0_In1890345947 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1890345947 256) 0))) (or (and (= 0 |P3Thread1of1ForFork0_#t~ite36_Out1890345947|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P3Thread1of1ForFork0_#t~ite36_Out1890345947| ~y$r_buff0_thd4~0_In1890345947)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1890345947, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1890345947} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In1890345947, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1890345947, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out1890345947|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-27 16:53:54,536 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [792] [792] L831-->L831-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In662161426 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd4~0_In662161426 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In662161426 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In662161426 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd4~0_In662161426 |P3Thread1of1ForFork0_#t~ite37_Out662161426|)) (and (= 0 |P3Thread1of1ForFork0_#t~ite37_Out662161426|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In662161426, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In662161426, ~y$w_buff0_used~0=~y$w_buff0_used~0_In662161426, ~y$w_buff1_used~0=~y$w_buff1_used~0_In662161426} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In662161426, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In662161426, ~y$w_buff0_used~0=~y$w_buff0_used~0_In662161426, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out662161426|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In662161426} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-27 16:53:54,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L831-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= v_~__unbuffered_cnt~0_146 (+ v_~__unbuffered_cnt~0_147 1)) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= |v_P3Thread1of1ForFork0_#t~ite37_66| v_~y$r_buff1_thd4~0_141)) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_66|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_147} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_141, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_65|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_146} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 16:53:54,537 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L856-1-->L862: Formula: (and (= v_~main$tmp_guard0~0_12 1) (= 4 v_~__unbuffered_cnt~0_38)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_12|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 16:53:54,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L862-2-->L862-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In-1872517423 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In-1872517423 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite42_Out-1872517423| ~y~0_In-1872517423) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-1872517423| ~y$w_buff1~0_In-1872517423)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1872517423, ~y~0=~y~0_In-1872517423, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1872517423, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1872517423} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1872517423, ~y~0=~y~0_In-1872517423, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1872517423|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1872517423, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1872517423} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:53:54,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L862-4-->L863: Formula: (= v_~y~0_20 |v_ULTIMATE.start_main_#t~ite42_7|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_6|, ~y~0=v_~y~0_20, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 16:53:54,538 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L863-->L863-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1113866967 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1113866967 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite44_Out-1113866967| ~y$w_buff0_used~0_In-1113866967)) (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite44_Out-1113866967|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1113866967, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1113866967} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1113866967, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1113866967, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1113866967|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 16:53:54,539 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L864-->L864-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In-1449270991 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1449270991 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1449270991 256) 0)) (.cse0 (= (mod ~y$r_buff1_thd0~0_In-1449270991 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1449270991|)) (and (= ~y$w_buff1_used~0_In-1449270991 |ULTIMATE.start_main_#t~ite45_Out-1449270991|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1449270991, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1449270991, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1449270991, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1449270991} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1449270991, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1449270991, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1449270991, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1449270991|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1449270991} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 16:53:54,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L865-->L865-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1476891503 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1476891503 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite46_Out1476891503|) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd0~0_In1476891503 |ULTIMATE.start_main_#t~ite46_Out1476891503|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1476891503, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1476891503} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1476891503, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1476891503, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1476891503|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 16:53:54,540 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L866-->L866-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In1061431393 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In1061431393 256))) (.cse3 (= (mod ~y$w_buff0_used~0_In1061431393 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd0~0_In1061431393 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out1061431393| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite47_Out1061431393| ~y$r_buff1_thd0~0_In1061431393) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1061431393, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1061431393, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1061431393, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1061431393} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1061431393, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1061431393, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out1061431393|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1061431393, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1061431393} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-27 16:53:54,541 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L866-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p3_EBX~0_23) (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~y$r_buff1_thd0~0_137 |v_ULTIMATE.start_main_#t~ite47_48|) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p2_EAX~0_92) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12| (mod v_~main$tmp_guard1~0_20 256)) (= 0 v_~__unbuffered_p0_EAX~0_41) (= 1 v_~__unbuffered_p3_EAX~0_23) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_48|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_23} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_41, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_23, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_47|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_92, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_23, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_137, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_12|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 16:53:54,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 04:53:54 BasicIcfg [2019-12-27 16:53:54,627 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 16:53:54,629 INFO L168 Benchmark]: Toolchain (without parser) took 156659.62 ms. Allocated memory was 138.9 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 100.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.4 GB. Max. memory is 7.1 GB. [2019-12-27 16:53:54,629 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 138.9 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 16:53:54,630 INFO L168 Benchmark]: CACSL2BoogieTranslator took 829.70 ms. Allocated memory was 138.9 MB in the beginning and 200.8 MB in the end (delta: 61.9 MB). Free memory was 99.6 MB in the beginning and 154.4 MB in the end (delta: -54.8 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. [2019-12-27 16:53:54,630 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.26 ms. Allocated memory is still 200.8 MB. Free memory was 154.4 MB in the beginning and 151.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:53:54,631 INFO L168 Benchmark]: Boogie Preprocessor took 38.69 ms. Allocated memory is still 200.8 MB. Free memory was 151.6 MB in the beginning and 148.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 16:53:54,631 INFO L168 Benchmark]: RCFGBuilder took 798.60 ms. Allocated memory is still 200.8 MB. Free memory was 148.7 MB in the beginning and 99.5 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-27 16:53:54,631 INFO L168 Benchmark]: TraceAbstraction took 154909.63 ms. Allocated memory was 200.8 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 98.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. [2019-12-27 16:53:54,634 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 138.9 MB. Free memory was 119.6 MB in the beginning and 119.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 829.70 ms. Allocated memory was 138.9 MB in the beginning and 200.8 MB in the end (delta: 61.9 MB). Free memory was 99.6 MB in the beginning and 154.4 MB in the end (delta: -54.8 MB). Peak memory consumption was 24.2 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 76.26 ms. Allocated memory is still 200.8 MB. Free memory was 154.4 MB in the beginning and 151.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 38.69 ms. Allocated memory is still 200.8 MB. Free memory was 151.6 MB in the beginning and 148.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 798.60 ms. Allocated memory is still 200.8 MB. Free memory was 148.7 MB in the beginning and 99.5 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 154909.63 ms. Allocated memory was 200.8 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 98.8 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.3 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.3s, 183 ProgramPointsBefore, 88 ProgramPointsAfterwards, 211 TransitionsBefore, 95 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 39 TrivialSequentialCompositions, 53 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 35 ConcurrentYvCompositions, 26 ChoiceCompositions, 7374 VarBasedMoverChecksPositive, 271 VarBasedMoverChecksNegative, 80 SemBasedMoverChecksPositive, 263 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 74129 CheckedPairsTotal, 127 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L850] FCALL, FORK 0 pthread_create(&t957, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L852] FCALL, FORK 0 pthread_create(&t958, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L854] FCALL, FORK 0 pthread_create(&t959, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L856] FCALL, FORK 0 pthread_create(&t960, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L785] 3 y$w_buff1 = y$w_buff0 [L786] 3 y$w_buff0 = 1 [L787] 3 y$w_buff1_used = y$w_buff0_used [L788] 3 y$w_buff0_used = (_Bool)1 [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 4 z = 1 [L818] 4 a = 1 [L821] 4 __unbuffered_p3_EAX = a [L824] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L827] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L827] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L828] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L757] 2 x = 1 [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L802] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L829] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L803] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L830] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L862] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L863] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L864] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L865] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 171 locations, 2 error locations. Result: UNSAFE, OverallTime: 154.6s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 56.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4947 SDtfs, 13928 SDslu, 22289 SDs, 0 SdLazy, 17905 SolverSat, 1404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 19.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 789 GetRequests, 156 SyntacticMatches, 63 SemanticMatches, 570 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11741 ImplicationChecksByTransitivity, 18.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=160086occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 50.6s AutomataMinimizationTime, 25 MinimizatonAttempts, 202799 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 1100 NumberOfCodeBlocks, 1100 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1016 ConstructedInterpolants, 0 QuantifiedInterpolants, 207568 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 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...