/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-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi001_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:04:11,639 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:04:11,641 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:04:11,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:04:11,655 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:04:11,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:04:11,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:04:11,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:04:11,673 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:04:11,674 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:04:11,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:04:11,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:04:11,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:04:11,682 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:04:11,683 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:04:11,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:04:11,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:04:11,689 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:04:11,691 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:04:11,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:04:11,699 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:04:11,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:04:11,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:04:11,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:04:11,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:04:11,706 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:04:11,706 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:04:11,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:04:11,709 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:04:11,711 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:04:11,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:04:11,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:04:11,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:04:11,714 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:04:11,716 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:04:11,716 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:04:11,717 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:04:11,717 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:04:11,717 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:04:11,720 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:04:11,721 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:04:11,722 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-VariableLbe.epf [2019-12-27 07:04:11,741 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:04:11,742 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:04:11,743 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:04:11,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:04:11,743 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:04:11,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:04:11,744 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:04:11,744 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:04:11,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:04:11,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:04:11,744 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:04:11,745 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:04:11,745 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:04:11,745 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:04:11,745 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:04:11,745 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:04:11,746 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:04:11,746 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:04:11,746 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:04:11,746 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:04:11,746 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:04:11,747 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:04:11,747 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:04:11,747 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:04:11,747 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:04:11,747 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:04:11,748 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:04:11,748 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:04:11,748 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:04:11,748 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:04:12,012 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:04:12,023 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:04:12,026 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:04:12,027 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:04:12,027 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:04:12,028 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi001_rmo.oepc.i [2019-12-27 07:04:12,093 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/072e5b52f/287d64e7a3de45a18a4f8eea8af7f043/FLAGa9fd5063f [2019-12-27 07:04:12,722 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:04:12,725 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi001_rmo.oepc.i [2019-12-27 07:04:12,749 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/072e5b52f/287d64e7a3de45a18a4f8eea8af7f043/FLAGa9fd5063f [2019-12-27 07:04:12,946 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/072e5b52f/287d64e7a3de45a18a4f8eea8af7f043 [2019-12-27 07:04:12,955 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:04:12,957 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:04:12,958 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:04:12,958 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:04:12,961 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:04:12,962 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:04:12" (1/1) ... [2019-12-27 07:04:12,965 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ca97c16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:12, skipping insertion in model container [2019-12-27 07:04:12,965 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:04:12" (1/1) ... [2019-12-27 07:04:12,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:04:13,017 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:04:13,523 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:04:13,535 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:04:13,616 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:04:13,698 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:04:13,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:13 WrapperNode [2019-12-27 07:04:13,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:04:13,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:04:13,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:04:13,699 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:04:13,708 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:13" (1/1) ... [2019-12-27 07:04:13,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:13" (1/1) ... [2019-12-27 07:04:13,756 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:04:13,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:04:13,756 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:04:13,756 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:04:13,765 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:13" (1/1) ... [2019-12-27 07:04:13,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:13" (1/1) ... [2019-12-27 07:04:13,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:13" (1/1) ... [2019-12-27 07:04:13,771 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:13" (1/1) ... [2019-12-27 07:04:13,781 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:13" (1/1) ... [2019-12-27 07:04:13,785 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:13" (1/1) ... [2019-12-27 07:04:13,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:13" (1/1) ... [2019-12-27 07:04:13,793 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:04:13,794 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:04:13,794 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:04:13,794 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:04:13,795 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:13" (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 07:04:13,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:04:13,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:04:13,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:04:13,861 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:04:13,861 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:04:13,861 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:04:13,861 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:04:13,862 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:04:13,862 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:04:13,862 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:04:13,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:04:13,864 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 07:04:14,558 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:04:14,558 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:04:14,560 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:04:14 BoogieIcfgContainer [2019-12-27 07:04:14,560 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:04:14,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:04:14,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:04:14,568 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:04:14,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:04:12" (1/3) ... [2019-12-27 07:04:14,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e8e840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:04:14, skipping insertion in model container [2019-12-27 07:04:14,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:04:13" (2/3) ... [2019-12-27 07:04:14,573 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17e8e840 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:04:14, skipping insertion in model container [2019-12-27 07:04:14,573 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:04:14" (3/3) ... [2019-12-27 07:04:14,577 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi001_rmo.oepc.i [2019-12-27 07:04:14,589 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:04:14,589 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:04:14,603 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:04:14,604 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:04:14,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,670 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,670 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,670 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,671 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,671 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,684 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,687 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,688 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,738 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,739 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,740 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,740 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,741 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,741 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,741 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,769 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,770 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,771 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,771 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,772 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:04:14,789 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:04:14,806 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:04:14,806 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:04:14,806 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:04:14,806 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:04:14,806 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:04:14,806 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:04:14,806 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:04:14,807 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:04:14,823 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 07:04:14,824 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 07:04:14,930 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 07:04:14,930 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:04:14,944 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 350 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:04:14,964 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 07:04:15,041 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 07:04:15,042 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:04:15,048 INFO L76 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 180 events. 41/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 350 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 07:04:15,062 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 07:04:15,063 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:04:17,906 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 57 [2019-12-27 07:04:18,208 WARN L192 SmtUtils]: Spent 232.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 07:04:18,320 WARN L192 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 07:04:18,348 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49085 [2019-12-27 07:04:18,348 INFO L214 etLargeBlockEncoding]: Total number of compositions: 102 [2019-12-27 07:04:18,351 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 76 places, 87 transitions [2019-12-27 07:04:18,791 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8066 states. [2019-12-27 07:04:18,793 INFO L276 IsEmpty]: Start isEmpty. Operand 8066 states. [2019-12-27 07:04:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 07:04:18,800 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:18,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 07:04:18,801 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:18,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:18,808 INFO L82 PathProgramCache]: Analyzing trace with hash 791333, now seen corresponding path program 1 times [2019-12-27 07:04:18,818 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:18,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908123549] [2019-12-27 07:04:18,819 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:18,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:19,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 07:04:19,091 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908123549] [2019-12-27 07:04:19,092 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:19,092 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:04:19,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419091051] [2019-12-27 07:04:19,097 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:19,098 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:19,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:19,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:19,112 INFO L87 Difference]: Start difference. First operand 8066 states. Second operand 3 states. [2019-12-27 07:04:19,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:19,478 INFO L93 Difference]: Finished difference Result 7932 states and 26018 transitions. [2019-12-27 07:04:19,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:19,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 07:04:19,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:19,574 INFO L225 Difference]: With dead ends: 7932 [2019-12-27 07:04:19,574 INFO L226 Difference]: Without dead ends: 7440 [2019-12-27 07:04:19,576 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 07:04:19,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7440 states. [2019-12-27 07:04:20,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7440 to 7440. [2019-12-27 07:04:20,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7440 states. [2019-12-27 07:04:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7440 states to 7440 states and 24357 transitions. [2019-12-27 07:04:20,069 INFO L78 Accepts]: Start accepts. Automaton has 7440 states and 24357 transitions. Word has length 3 [2019-12-27 07:04:20,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:20,069 INFO L462 AbstractCegarLoop]: Abstraction has 7440 states and 24357 transitions. [2019-12-27 07:04:20,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:20,070 INFO L276 IsEmpty]: Start isEmpty. Operand 7440 states and 24357 transitions. [2019-12-27 07:04:20,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:04:20,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:20,075 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:20,075 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:20,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:20,076 INFO L82 PathProgramCache]: Analyzing trace with hash 912855206, now seen corresponding path program 1 times [2019-12-27 07:04:20,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:20,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110157941] [2019-12-27 07:04:20,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:20,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:20,166 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 07:04:20,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110157941] [2019-12-27 07:04:20,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:20,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:20,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596201828] [2019-12-27 07:04:20,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:20,170 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:20,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:20,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:20,171 INFO L87 Difference]: Start difference. First operand 7440 states and 24357 transitions. Second operand 3 states. [2019-12-27 07:04:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:20,215 INFO L93 Difference]: Finished difference Result 1230 states and 2824 transitions. [2019-12-27 07:04:20,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:20,216 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 07:04:20,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:20,223 INFO L225 Difference]: With dead ends: 1230 [2019-12-27 07:04:20,223 INFO L226 Difference]: Without dead ends: 1230 [2019-12-27 07:04:20,225 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 07:04:20,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-27 07:04:20,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2019-12-27 07:04:20,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-27 07:04:20,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2824 transitions. [2019-12-27 07:04:20,264 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2824 transitions. Word has length 11 [2019-12-27 07:04:20,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:20,264 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2824 transitions. [2019-12-27 07:04:20,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:20,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2824 transitions. [2019-12-27 07:04:20,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:04:20,271 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:20,271 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:20,271 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:20,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:20,272 INFO L82 PathProgramCache]: Analyzing trace with hash 124584310, now seen corresponding path program 1 times [2019-12-27 07:04:20,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:20,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188034863] [2019-12-27 07:04:20,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:20,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:20,332 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 07:04:20,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188034863] [2019-12-27 07:04:20,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:20,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:04:20,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257020765] [2019-12-27 07:04:20,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:20,333 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:20,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:20,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:20,334 INFO L87 Difference]: Start difference. First operand 1230 states and 2824 transitions. Second operand 3 states. [2019-12-27 07:04:20,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:20,417 INFO L93 Difference]: Finished difference Result 1956 states and 4348 transitions. [2019-12-27 07:04:20,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:20,418 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-27 07:04:20,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:20,433 INFO L225 Difference]: With dead ends: 1956 [2019-12-27 07:04:20,433 INFO L226 Difference]: Without dead ends: 1956 [2019-12-27 07:04:20,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:20,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1956 states. [2019-12-27 07:04:20,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1956 to 1356. [2019-12-27 07:04:20,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1356 states. [2019-12-27 07:04:20,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1356 states to 1356 states and 3081 transitions. [2019-12-27 07:04:20,547 INFO L78 Accepts]: Start accepts. Automaton has 1356 states and 3081 transitions. Word has length 14 [2019-12-27 07:04:20,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:20,548 INFO L462 AbstractCegarLoop]: Abstraction has 1356 states and 3081 transitions. [2019-12-27 07:04:20,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:20,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1356 states and 3081 transitions. [2019-12-27 07:04:20,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:04:20,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:20,549 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:20,550 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:20,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:20,550 INFO L82 PathProgramCache]: Analyzing trace with hash 35390056, now seen corresponding path program 1 times [2019-12-27 07:04:20,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:20,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411394863] [2019-12-27 07:04:20,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:20,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:20,611 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 07:04:20,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411394863] [2019-12-27 07:04:20,612 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:20,613 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:20,613 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1429310433] [2019-12-27 07:04:20,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:04:20,614 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:20,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:04:20,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:04:20,616 INFO L87 Difference]: Start difference. First operand 1356 states and 3081 transitions. Second operand 4 states. [2019-12-27 07:04:20,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:20,806 INFO L93 Difference]: Finished difference Result 1678 states and 3739 transitions. [2019-12-27 07:04:20,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:04:20,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:04:20,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:20,816 INFO L225 Difference]: With dead ends: 1678 [2019-12-27 07:04:20,816 INFO L226 Difference]: Without dead ends: 1678 [2019-12-27 07:04:20,817 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 07:04:20,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1678 states. [2019-12-27 07:04:20,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1678 to 1618. [2019-12-27 07:04:20,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2019-12-27 07:04:20,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 3623 transitions. [2019-12-27 07:04:20,864 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 3623 transitions. Word has length 14 [2019-12-27 07:04:20,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:20,865 INFO L462 AbstractCegarLoop]: Abstraction has 1618 states and 3623 transitions. [2019-12-27 07:04:20,865 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:04:20,865 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 3623 transitions. [2019-12-27 07:04:20,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:04:20,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:20,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:20,866 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:20,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:20,867 INFO L82 PathProgramCache]: Analyzing trace with hash 801099966, now seen corresponding path program 1 times [2019-12-27 07:04:20,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:20,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433423143] [2019-12-27 07:04:20,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:20,935 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 07:04:20,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433423143] [2019-12-27 07:04:20,936 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:20,936 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:20,936 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008818717] [2019-12-27 07:04:20,937 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:04:20,937 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:20,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:04:20,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:04:20,937 INFO L87 Difference]: Start difference. First operand 1618 states and 3623 transitions. Second operand 4 states. [2019-12-27 07:04:21,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:21,118 INFO L93 Difference]: Finished difference Result 1981 states and 4398 transitions. [2019-12-27 07:04:21,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:04:21,119 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:04:21,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:21,133 INFO L225 Difference]: With dead ends: 1981 [2019-12-27 07:04:21,134 INFO L226 Difference]: Without dead ends: 1981 [2019-12-27 07:04:21,134 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 07:04:21,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2019-12-27 07:04:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1706. [2019-12-27 07:04:21,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2019-12-27 07:04:21,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 3834 transitions. [2019-12-27 07:04:21,185 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 3834 transitions. Word has length 14 [2019-12-27 07:04:21,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:21,185 INFO L462 AbstractCegarLoop]: Abstraction has 1706 states and 3834 transitions. [2019-12-27 07:04:21,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:04:21,185 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 3834 transitions. [2019-12-27 07:04:21,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:04:21,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:21,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:21,188 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:21,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:21,188 INFO L82 PathProgramCache]: Analyzing trace with hash -738044695, now seen corresponding path program 1 times [2019-12-27 07:04:21,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:21,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786820225] [2019-12-27 07:04:21,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:21,268 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 07:04:21,268 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786820225] [2019-12-27 07:04:21,268 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:21,269 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:04:21,269 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36107775] [2019-12-27 07:04:21,269 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:04:21,270 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:21,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:04:21,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:04:21,270 INFO L87 Difference]: Start difference. First operand 1706 states and 3834 transitions. Second operand 5 states. [2019-12-27 07:04:21,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:21,508 INFO L93 Difference]: Finished difference Result 2240 states and 4897 transitions. [2019-12-27 07:04:21,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:04:21,509 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 07:04:21,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:21,531 INFO L225 Difference]: With dead ends: 2240 [2019-12-27 07:04:21,533 INFO L226 Difference]: Without dead ends: 2240 [2019-12-27 07:04:21,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:04:21,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2240 states. [2019-12-27 07:04:21,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2240 to 1991. [2019-12-27 07:04:21,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1991 states. [2019-12-27 07:04:21,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1991 states to 1991 states and 4418 transitions. [2019-12-27 07:04:21,591 INFO L78 Accepts]: Start accepts. Automaton has 1991 states and 4418 transitions. Word has length 25 [2019-12-27 07:04:21,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:21,591 INFO L462 AbstractCegarLoop]: Abstraction has 1991 states and 4418 transitions. [2019-12-27 07:04:21,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:04:21,592 INFO L276 IsEmpty]: Start isEmpty. Operand 1991 states and 4418 transitions. [2019-12-27 07:04:21,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 07:04:21,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:21,594 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:21,594 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:21,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:21,595 INFO L82 PathProgramCache]: Analyzing trace with hash 602591181, now seen corresponding path program 1 times [2019-12-27 07:04:21,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:21,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142935679] [2019-12-27 07:04:21,596 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:21,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:21,635 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 07:04:21,636 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142935679] [2019-12-27 07:04:21,636 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:21,636 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:04:21,637 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246896018] [2019-12-27 07:04:21,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:21,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:21,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:21,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:21,638 INFO L87 Difference]: Start difference. First operand 1991 states and 4418 transitions. Second operand 3 states. [2019-12-27 07:04:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:21,678 INFO L93 Difference]: Finished difference Result 2574 states and 5503 transitions. [2019-12-27 07:04:21,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:21,679 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-12-27 07:04:21,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:21,691 INFO L225 Difference]: With dead ends: 2574 [2019-12-27 07:04:21,692 INFO L226 Difference]: Without dead ends: 2574 [2019-12-27 07:04:21,692 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:21,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2019-12-27 07:04:21,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 1963. [2019-12-27 07:04:21,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2019-12-27 07:04:21,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 4214 transitions. [2019-12-27 07:04:21,752 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 4214 transitions. Word has length 25 [2019-12-27 07:04:21,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:21,753 INFO L462 AbstractCegarLoop]: Abstraction has 1963 states and 4214 transitions. [2019-12-27 07:04:21,753 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 4214 transitions. [2019-12-27 07:04:21,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:04:21,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:21,756 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:21,756 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:21,756 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:21,757 INFO L82 PathProgramCache]: Analyzing trace with hash -2104804157, now seen corresponding path program 1 times [2019-12-27 07:04:21,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:21,758 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277441688] [2019-12-27 07:04:21,758 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:21,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:21,885 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 07:04:21,886 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277441688] [2019-12-27 07:04:21,887 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:21,887 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:04:21,887 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505522787] [2019-12-27 07:04:21,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:04:21,888 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:21,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:04:21,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:04:21,888 INFO L87 Difference]: Start difference. First operand 1963 states and 4214 transitions. Second operand 4 states. [2019-12-27 07:04:21,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:21,909 INFO L93 Difference]: Finished difference Result 1053 states and 2169 transitions. [2019-12-27 07:04:21,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:04:21,909 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2019-12-27 07:04:21,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:21,913 INFO L225 Difference]: With dead ends: 1053 [2019-12-27 07:04:21,913 INFO L226 Difference]: Without dead ends: 1053 [2019-12-27 07:04:21,913 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 07:04:21,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states. [2019-12-27 07:04:21,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 995. [2019-12-27 07:04:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 995 states. [2019-12-27 07:04:21,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 2062 transitions. [2019-12-27 07:04:21,950 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 2062 transitions. Word has length 26 [2019-12-27 07:04:21,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:21,951 INFO L462 AbstractCegarLoop]: Abstraction has 995 states and 2062 transitions. [2019-12-27 07:04:21,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:04:21,951 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 2062 transitions. [2019-12-27 07:04:21,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 07:04:21,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:21,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:21,953 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:21,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:21,954 INFO L82 PathProgramCache]: Analyzing trace with hash -134458557, now seen corresponding path program 1 times [2019-12-27 07:04:21,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:21,958 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188957625] [2019-12-27 07:04:21,958 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:22,068 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 07:04:22,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188957625] [2019-12-27 07:04:22,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:22,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:04:22,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607650973] [2019-12-27 07:04:22,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:04:22,070 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:22,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:04:22,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:04:22,071 INFO L87 Difference]: Start difference. First operand 995 states and 2062 transitions. Second operand 5 states. [2019-12-27 07:04:22,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:22,253 INFO L93 Difference]: Finished difference Result 1129 states and 2304 transitions. [2019-12-27 07:04:22,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:04:22,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-27 07:04:22,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:22,258 INFO L225 Difference]: With dead ends: 1129 [2019-12-27 07:04:22,258 INFO L226 Difference]: Without dead ends: 1129 [2019-12-27 07:04:22,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:04:22,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2019-12-27 07:04:22,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 904. [2019-12-27 07:04:22,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 904 states. [2019-12-27 07:04:22,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1874 transitions. [2019-12-27 07:04:22,280 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1874 transitions. Word has length 26 [2019-12-27 07:04:22,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:22,281 INFO L462 AbstractCegarLoop]: Abstraction has 904 states and 1874 transitions. [2019-12-27 07:04:22,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:04:22,281 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1874 transitions. [2019-12-27 07:04:22,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 07:04:22,285 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:22,286 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] [2019-12-27 07:04:22,286 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:22,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:22,287 INFO L82 PathProgramCache]: Analyzing trace with hash 830310095, now seen corresponding path program 1 times [2019-12-27 07:04:22,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:22,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504486274] [2019-12-27 07:04:22,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:22,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 07:04:22,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504486274] [2019-12-27 07:04:22,354 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:22,354 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:22,354 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979304885] [2019-12-27 07:04:22,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:22,355 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:22,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:22,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:22,356 INFO L87 Difference]: Start difference. First operand 904 states and 1874 transitions. Second operand 3 states. [2019-12-27 07:04:22,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:22,367 INFO L93 Difference]: Finished difference Result 1410 states and 2964 transitions. [2019-12-27 07:04:22,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:22,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 07:04:22,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:22,369 INFO L225 Difference]: With dead ends: 1410 [2019-12-27 07:04:22,369 INFO L226 Difference]: Without dead ends: 548 [2019-12-27 07:04:22,370 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 07:04:22,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2019-12-27 07:04:22,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2019-12-27 07:04:22,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-12-27 07:04:22,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 1169 transitions. [2019-12-27 07:04:22,381 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 1169 transitions. Word has length 51 [2019-12-27 07:04:22,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:22,382 INFO L462 AbstractCegarLoop]: Abstraction has 548 states and 1169 transitions. [2019-12-27 07:04:22,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:22,382 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 1169 transitions. [2019-12-27 07:04:22,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 07:04:22,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:22,384 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] [2019-12-27 07:04:22,384 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:22,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:22,384 INFO L82 PathProgramCache]: Analyzing trace with hash 365260025, now seen corresponding path program 2 times [2019-12-27 07:04:22,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:22,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475193574] [2019-12-27 07:04:22,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:22,473 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 07:04:22,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475193574] [2019-12-27 07:04:22,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:22,474 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:04:22,474 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290545506] [2019-12-27 07:04:22,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:04:22,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:22,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:04:22,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:04:22,475 INFO L87 Difference]: Start difference. First operand 548 states and 1169 transitions. Second operand 7 states. [2019-12-27 07:04:22,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:22,654 INFO L93 Difference]: Finished difference Result 1122 states and 2322 transitions. [2019-12-27 07:04:22,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 07:04:22,654 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 51 [2019-12-27 07:04:22,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:22,656 INFO L225 Difference]: With dead ends: 1122 [2019-12-27 07:04:22,656 INFO L226 Difference]: Without dead ends: 775 [2019-12-27 07:04:22,658 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 07:04:22,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 775 states. [2019-12-27 07:04:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 775 to 613. [2019-12-27 07:04:22,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2019-12-27 07:04:22,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 1276 transitions. [2019-12-27 07:04:22,674 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 1276 transitions. Word has length 51 [2019-12-27 07:04:22,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:22,675 INFO L462 AbstractCegarLoop]: Abstraction has 613 states and 1276 transitions. [2019-12-27 07:04:22,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:04:22,675 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 1276 transitions. [2019-12-27 07:04:22,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 07:04:22,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:22,677 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:04:22,677 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:22,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:22,678 INFO L82 PathProgramCache]: Analyzing trace with hash 372470905, now seen corresponding path program 3 times [2019-12-27 07:04:22,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:22,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70938416] [2019-12-27 07:04:22,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:22,810 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 07:04:22,810 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70938416] [2019-12-27 07:04:22,810 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:22,810 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:04:22,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685781432] [2019-12-27 07:04:22,811 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:04:22,811 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:22,811 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:04:22,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:04:22,812 INFO L87 Difference]: Start difference. First operand 613 states and 1276 transitions. Second operand 6 states. [2019-12-27 07:04:23,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:23,328 INFO L93 Difference]: Finished difference Result 1039 states and 2101 transitions. [2019-12-27 07:04:23,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:04:23,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 51 [2019-12-27 07:04:23,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:23,331 INFO L225 Difference]: With dead ends: 1039 [2019-12-27 07:04:23,331 INFO L226 Difference]: Without dead ends: 1015 [2019-12-27 07:04:23,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:04:23,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1015 states. [2019-12-27 07:04:23,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1015 to 937. [2019-12-27 07:04:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 937 states. [2019-12-27 07:04:23,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1912 transitions. [2019-12-27 07:04:23,352 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1912 transitions. Word has length 51 [2019-12-27 07:04:23,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:23,352 INFO L462 AbstractCegarLoop]: Abstraction has 937 states and 1912 transitions. [2019-12-27 07:04:23,352 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:04:23,352 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1912 transitions. [2019-12-27 07:04:23,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 07:04:23,355 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:23,355 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] [2019-12-27 07:04:23,355 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:23,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:23,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1736295055, now seen corresponding path program 4 times [2019-12-27 07:04:23,356 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:23,356 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979769694] [2019-12-27 07:04:23,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:23,443 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 07:04:23,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979769694] [2019-12-27 07:04:23,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:23,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:23,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919620668] [2019-12-27 07:04:23,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:23,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:23,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:23,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:23,445 INFO L87 Difference]: Start difference. First operand 937 states and 1912 transitions. Second operand 3 states. [2019-12-27 07:04:23,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:23,494 INFO L93 Difference]: Finished difference Result 1175 states and 2397 transitions. [2019-12-27 07:04:23,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:23,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 07:04:23,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:23,497 INFO L225 Difference]: With dead ends: 1175 [2019-12-27 07:04:23,498 INFO L226 Difference]: Without dead ends: 1175 [2019-12-27 07:04:23,498 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 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 07:04:23,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1175 states. [2019-12-27 07:04:23,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1175 to 931. [2019-12-27 07:04:23,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 931 states. [2019-12-27 07:04:23,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 931 states to 931 states and 1919 transitions. [2019-12-27 07:04:23,518 INFO L78 Accepts]: Start accepts. Automaton has 931 states and 1919 transitions. Word has length 51 [2019-12-27 07:04:23,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:23,520 INFO L462 AbstractCegarLoop]: Abstraction has 931 states and 1919 transitions. [2019-12-27 07:04:23,520 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:23,520 INFO L276 IsEmpty]: Start isEmpty. Operand 931 states and 1919 transitions. [2019-12-27 07:04:23,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:04:23,522 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:23,523 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] [2019-12-27 07:04:23,523 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:23,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:23,523 INFO L82 PathProgramCache]: Analyzing trace with hash 679432093, now seen corresponding path program 1 times [2019-12-27 07:04:23,523 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:23,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303663636] [2019-12-27 07:04:23,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:23,626 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 07:04:23,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303663636] [2019-12-27 07:04:23,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:23,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:04:23,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67984933] [2019-12-27 07:04:23,628 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:04:23,628 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:23,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:04:23,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:04:23,629 INFO L87 Difference]: Start difference. First operand 931 states and 1919 transitions. Second operand 7 states. [2019-12-27 07:04:24,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:24,205 INFO L93 Difference]: Finished difference Result 1141 states and 2310 transitions. [2019-12-27 07:04:24,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 07:04:24,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-27 07:04:24,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:24,209 INFO L225 Difference]: With dead ends: 1141 [2019-12-27 07:04:24,210 INFO L226 Difference]: Without dead ends: 1141 [2019-12-27 07:04:24,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-27 07:04:24,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1141 states. [2019-12-27 07:04:24,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1141 to 1039. [2019-12-27 07:04:24,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1039 states. [2019-12-27 07:04:24,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 2123 transitions. [2019-12-27 07:04:24,231 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 2123 transitions. Word has length 52 [2019-12-27 07:04:24,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:24,232 INFO L462 AbstractCegarLoop]: Abstraction has 1039 states and 2123 transitions. [2019-12-27 07:04:24,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:04:24,232 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 2123 transitions. [2019-12-27 07:04:24,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:04:24,234 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:24,235 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] [2019-12-27 07:04:24,235 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:24,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:24,235 INFO L82 PathProgramCache]: Analyzing trace with hash 292599181, now seen corresponding path program 1 times [2019-12-27 07:04:24,235 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:24,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024704955] [2019-12-27 07:04:24,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:24,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:24,333 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 07:04:24,334 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024704955] [2019-12-27 07:04:24,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:24,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 07:04:24,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173508111] [2019-12-27 07:04:24,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 07:04:24,335 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:24,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 07:04:24,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-27 07:04:24,336 INFO L87 Difference]: Start difference. First operand 1039 states and 2123 transitions. Second operand 6 states. [2019-12-27 07:04:24,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:24,815 INFO L93 Difference]: Finished difference Result 1291 states and 2597 transitions. [2019-12-27 07:04:24,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 07:04:24,815 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-27 07:04:24,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:24,820 INFO L225 Difference]: With dead ends: 1291 [2019-12-27 07:04:24,820 INFO L226 Difference]: Without dead ends: 1291 [2019-12-27 07:04:24,820 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:04:24,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states. [2019-12-27 07:04:24,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1075. [2019-12-27 07:04:24,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1075 states. [2019-12-27 07:04:24,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1075 states to 1075 states and 2189 transitions. [2019-12-27 07:04:24,842 INFO L78 Accepts]: Start accepts. Automaton has 1075 states and 2189 transitions. Word has length 52 [2019-12-27 07:04:24,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:24,842 INFO L462 AbstractCegarLoop]: Abstraction has 1075 states and 2189 transitions. [2019-12-27 07:04:24,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 07:04:24,842 INFO L276 IsEmpty]: Start isEmpty. Operand 1075 states and 2189 transitions. [2019-12-27 07:04:24,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 07:04:24,845 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:24,845 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] [2019-12-27 07:04:24,845 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:24,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:24,845 INFO L82 PathProgramCache]: Analyzing trace with hash -267803227, now seen corresponding path program 2 times [2019-12-27 07:04:24,846 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:24,846 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502241471] [2019-12-27 07:04:24,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:24,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:04:24,902 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 07:04:24,902 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502241471] [2019-12-27 07:04:24,902 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:04:24,902 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:04:24,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433833755] [2019-12-27 07:04:24,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:04:24,903 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:04:24,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:04:24,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:04:24,904 INFO L87 Difference]: Start difference. First operand 1075 states and 2189 transitions. Second operand 3 states. [2019-12-27 07:04:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:04:24,917 INFO L93 Difference]: Finished difference Result 1075 states and 2188 transitions. [2019-12-27 07:04:24,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:04:24,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 07:04:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:04:24,919 INFO L225 Difference]: With dead ends: 1075 [2019-12-27 07:04:24,920 INFO L226 Difference]: Without dead ends: 1075 [2019-12-27 07:04:24,920 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 07:04:24,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states. [2019-12-27 07:04:24,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 826. [2019-12-27 07:04:24,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 826 states. [2019-12-27 07:04:24,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1719 transitions. [2019-12-27 07:04:24,938 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1719 transitions. Word has length 52 [2019-12-27 07:04:24,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:04:24,938 INFO L462 AbstractCegarLoop]: Abstraction has 826 states and 1719 transitions. [2019-12-27 07:04:24,938 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:04:24,938 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1719 transitions. [2019-12-27 07:04:24,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 07:04:24,941 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:04:24,941 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] [2019-12-27 07:04:24,941 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:04:24,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:04:24,942 INFO L82 PathProgramCache]: Analyzing trace with hash -1093323660, now seen corresponding path program 1 times [2019-12-27 07:04:24,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:04:24,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23160984] [2019-12-27 07:04:24,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:04:24,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:04:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:04:25,147 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:04:25,148 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:04:25,152 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= 0 v_~x$read_delayed_var~0.offset_6) (= v_~x$r_buff1_thd0~0_27 0) (= 0 v_~weak$$choice0~0_8) (= 0 v_~x$w_buff1~0_22) (= v_~y~0_18 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1609~0.base_23|)) (= 0 v_~__unbuffered_p1_EAX~0_15) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= |v_ULTIMATE.start_main_~#t1609~0.offset_18| 0) (= 0 v_~x$w_buff0_used~0_100) (= |v_#valid_46| (store .cse0 |v_ULTIMATE.start_main_~#t1609~0.base_23| 1)) (= 0 v_~x$w_buff0~0_23) (= 0 v_~x$r_buff0_thd0~0_19) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t1609~0.base_23|) (= 0 v_~x$r_buff0_thd2~0_78) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~x$read_delayed~0_6) (= v_~x$r_buff1_thd2~0_49 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1609~0.base_23| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1609~0.base_23|) |v_ULTIMATE.start_main_~#t1609~0.offset_18| 0)) |v_#memory_int_11|) (= v_~x$mem_tmp~0_8 0) (= 0 v_~x$r_buff0_thd1~0_27) (= 0 |v_#NULL.base_6|) (= v_~x$r_buff1_thd1~0_21 0) (= v_~x$flush_delayed~0_11 0) (= 0 v_~weak$$choice2~0_35) (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t1609~0.base_23| 4)) (= v_~x~0_22 0) (= v_~x$w_buff1_used~0_64 0) (= 0 v_~z~0_8) (= 0 v_~__unbuffered_cnt~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_12|, #length=|v_#length_20|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_23, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_27, ~x$flush_delayed~0=v_~x$flush_delayed~0_11, #NULL.offset=|v_#NULL.offset_6|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_21, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ~x$mem_tmp~0=v_~x$mem_tmp~0_8, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_11|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_11|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_24|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_11|, ULTIMATE.start_main_~#t1610~0.base=|v_ULTIMATE.start_main_~#t1610~0.base_22|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ULTIMATE.start_main_~#t1610~0.offset=|v_ULTIMATE.start_main_~#t1610~0.offset_16|, #length=|v_#length_19|, ~y~0=v_~y~0_18, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_19, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ULTIMATE.start_main_~#t1609~0.offset=|v_ULTIMATE.start_main_~#t1609~0.offset_18|, ~x$w_buff1~0=v_~x$w_buff1~0_22, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_64, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_49, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_27, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_78, ULTIMATE.start_main_~#t1609~0.base=|v_ULTIMATE.start_main_~#t1609~0.base_23|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_6|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_100, ~weak$$choice0~0=v_~weak$$choice0~0_8, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_13|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_13|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~x~0=v_~x~0_22, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t1610~0.base, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1610~0.offset, #length, ~y~0, ~x$r_buff0_thd0~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_~#t1609~0.offset, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t1609~0.base, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 07:04:25,154 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [739] [739] L802-1-->L804: Formula: (and (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1610~0.base_11|) 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1610~0.base_11|) (not (= |v_ULTIMATE.start_main_~#t1610~0.base_11| 0)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1610~0.base_11| 4)) (= 0 |v_ULTIMATE.start_main_~#t1610~0.offset_10|) (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1610~0.base_11| 1)) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1610~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1610~0.base_11|) |v_ULTIMATE.start_main_~#t1610~0.offset_10| 1)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t1610~0.base=|v_ULTIMATE.start_main_~#t1610~0.base_11|, ULTIMATE.start_main_~#t1610~0.offset=|v_ULTIMATE.start_main_~#t1610~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_6|, #length=|v_#length_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1610~0.base, ULTIMATE.start_main_~#t1610~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 07:04:25,155 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L4-->L740: Formula: (and (= ~x$r_buff1_thd0~0_Out-960621238 ~x$r_buff0_thd0~0_In-960621238) (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-960621238)) (= 1 ~x$r_buff0_thd1~0_Out-960621238) (= 1 ~y~0_Out-960621238) (= ~x$r_buff1_thd1~0_Out-960621238 ~x$r_buff0_thd1~0_In-960621238) (= ~x$r_buff1_thd2~0_Out-960621238 ~x$r_buff0_thd2~0_In-960621238)) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-960621238, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-960621238, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-960621238, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-960621238} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-960621238, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-960621238, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In-960621238, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_Out-960621238, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_Out-960621238, ~y~0=~y~0_Out-960621238, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-960621238, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-960621238} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 07:04:25,159 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [711] [711] L741-->L741-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In440704100 256) 0)) (.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In440704100 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out440704100|)) (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In440704100 |P0Thread1of1ForFork0_#t~ite5_Out440704100|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In440704100, ~x$w_buff0_used~0=~x$w_buff0_used~0_In440704100} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out440704100|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In440704100, ~x$w_buff0_used~0=~x$w_buff0_used~0_In440704100} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 07:04:25,160 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In1636246139 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd1~0_In1636246139 256) 0)) (.cse3 (= (mod ~x$r_buff0_thd1~0_In1636246139 256) 0)) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In1636246139 256)))) (or (and (= 0 |P0Thread1of1ForFork0_#t~ite6_Out1636246139|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In1636246139 |P0Thread1of1ForFork0_#t~ite6_Out1636246139|) (or .cse1 .cse0) (or .cse3 .cse2)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1636246139, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1636246139, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1636246139, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1636246139} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out1636246139|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1636246139, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1636246139, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1636246139, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1636246139} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 07:04:25,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L743-->L744: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1858952602 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd1~0_In-1858952602 256) 0))) (or (and (= ~x$r_buff0_thd1~0_Out-1858952602 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd1~0_Out-1858952602 ~x$r_buff0_thd1~0_In-1858952602)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1858952602, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1858952602} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_Out-1858952602, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1858952602|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1858952602} AuxVars[] AssignedVars[~x$r_buff0_thd1~0, P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-27 07:04:25,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1778919100 256))) (.cse1 (= (mod ~x$w_buff1_used~0_In-1778919100 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-1778919100 256))) (.cse2 (= 0 (mod ~x$w_buff0_used~0_In-1778919100 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite8_Out-1778919100| 0)) (and (or .cse0 .cse1) (or .cse3 .cse2) (= |P0Thread1of1ForFork0_#t~ite8_Out-1778919100| ~x$r_buff1_thd1~0_In-1778919100)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1778919100, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1778919100, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1778919100, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1778919100} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1778919100, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1778919100|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1778919100, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1778919100, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1778919100} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 07:04:25,161 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L744-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~x$r_buff1_thd1~0_17 |v_P0Thread1of1ForFork0_#t~ite8_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_7|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_17} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-27 07:04:25,167 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [663] [663] L772-->L773: Formula: (and (not (= (mod v_~weak$$choice2~0_21 256) 0)) (= v_~x$r_buff0_thd2~0_53 v_~x$r_buff0_thd2~0_52)) InVars {~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_21} OutVars{P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_7|, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_21, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_7|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite27, ~x$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 07:04:25,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L773-->L773-8: Formula: (let ((.cse2 (= |P1Thread1of1ForFork1_#t~ite29_Out841915287| |P1Thread1of1ForFork1_#t~ite30_Out841915287|)) (.cse3 (= 0 (mod ~weak$$choice2~0_In841915287 256))) (.cse4 (= 0 (mod ~x$r_buff1_thd2~0_In841915287 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In841915287 256))) (.cse6 (= 0 (mod ~x$r_buff0_thd2~0_In841915287 256))) (.cse5 (= 0 (mod ~x$w_buff0_used~0_In841915287 256)))) (or (let ((.cse0 (not .cse6))) (and (or .cse0 (not .cse1)) .cse2 .cse3 (= |P1Thread1of1ForFork1_#t~ite29_Out841915287| |P1Thread1of1ForFork1_#t~ite28_Out841915287|) (or (not .cse4) .cse0) (not .cse5) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out841915287|))) (and (or (and (not .cse3) (= ~x$r_buff1_thd2~0_In841915287 |P1Thread1of1ForFork1_#t~ite30_Out841915287|) (= |P1Thread1of1ForFork1_#t~ite29_In841915287| |P1Thread1of1ForFork1_#t~ite29_Out841915287|)) (and (= ~x$r_buff1_thd2~0_In841915287 |P1Thread1of1ForFork1_#t~ite29_Out841915287|) .cse2 .cse3 (or (and .cse4 .cse6) (and .cse1 .cse6) .cse5))) (= |P1Thread1of1ForFork1_#t~ite28_In841915287| |P1Thread1of1ForFork1_#t~ite28_Out841915287|)))) InVars {P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In841915287|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In841915287, ~x$w_buff1_used~0=~x$w_buff1_used~0_In841915287, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In841915287, ~weak$$choice2~0=~weak$$choice2~0_In841915287, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In841915287|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In841915287} OutVars{P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out841915287|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out841915287|, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In841915287, ~x$w_buff1_used~0=~x$w_buff1_used~0_In841915287, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In841915287, ~weak$$choice2~0=~weak$$choice2~0_In841915287, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out841915287|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In841915287} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 07:04:25,168 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L775-->L779: Formula: (and (= v_~x$mem_tmp~0_4 v_~x~0_16) (= 0 v_~x$flush_delayed~0_6) (not (= 0 (mod v_~x$flush_delayed~0_7 256)))) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{~x$flush_delayed~0=v_~x$flush_delayed~0_6, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[~x$flush_delayed~0, P1Thread1of1ForFork1_#t~ite31, ~x~0] because there is no mapped edge [2019-12-27 07:04:25,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L779-2-->L779-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd2~0_In1363162238 256) 0)) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In1363162238 256)))) (or (and (= ~x~0_In1363162238 |P1Thread1of1ForFork1_#t~ite32_Out1363162238|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite32_Out1363162238| ~x$w_buff1~0_In1363162238) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1363162238, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1363162238, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1363162238, ~x~0=~x~0_In1363162238} OutVars{~x$w_buff1~0=~x$w_buff1~0_In1363162238, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1363162238, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1363162238, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out1363162238|, ~x~0=~x~0_In1363162238} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 07:04:25,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] L779-4-->L780: Formula: (= v_~x~0_17 |v_P1Thread1of1ForFork1_#t~ite32_8|) InVars {P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_8|} OutVars{P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_7|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_17} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 07:04:25,170 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1273536039 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd2~0_In-1273536039 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork1_#t~ite34_Out-1273536039|)) (and (= ~x$w_buff0_used~0_In-1273536039 |P1Thread1of1ForFork1_#t~ite34_Out-1273536039|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1273536039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1273536039} OutVars{P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out-1273536039|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1273536039, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1273536039} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 07:04:25,171 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L781-->L781-2: Formula: (let ((.cse3 (= (mod ~x$w_buff0_used~0_In200813344 256) 0)) (.cse2 (= (mod ~x$r_buff0_thd2~0_In200813344 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In200813344 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd2~0_In200813344 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite35_Out200813344| ~x$w_buff1_used~0_In200813344)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork1_#t~ite35_Out200813344| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In200813344, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In200813344, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In200813344, ~x$w_buff0_used~0=~x$w_buff0_used~0_In200813344} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In200813344, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In200813344, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out200813344|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In200813344, ~x$w_buff0_used~0=~x$w_buff0_used~0_In200813344} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 07:04:25,172 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L782-->L782-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1109611452 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1109611452 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite36_Out1109611452|) (not .cse0) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In1109611452 |P1Thread1of1ForFork1_#t~ite36_Out1109611452|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1109611452, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1109611452} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1109611452, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out1109611452|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1109611452} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 07:04:25,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L783-->L783-2: Formula: (let ((.cse3 (= (mod ~x$w_buff1_used~0_In330238753 256) 0)) (.cse2 (= (mod ~x$r_buff1_thd2~0_In330238753 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In330238753 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In330238753 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite37_Out330238753|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~x$r_buff1_thd2~0_In330238753 |P1Thread1of1ForFork1_#t~ite37_Out330238753|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In330238753, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In330238753, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In330238753, ~x$w_buff0_used~0=~x$w_buff0_used~0_In330238753} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In330238753, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In330238753, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In330238753, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out330238753|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In330238753} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:04:25,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L783-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_41 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_41, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 07:04:25,173 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [683] [683] L804-1-->L810: Formula: (and (= v_~main$tmp_guard0~0_5 1) (= v_~__unbuffered_cnt~0_7 2)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_7, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[~main$tmp_guard0~0, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 07:04:25,174 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L810-2-->L810-5: Formula: (let ((.cse1 (= |ULTIMATE.start_main_#t~ite41_Out-2057607268| |ULTIMATE.start_main_#t~ite40_Out-2057607268|)) (.cse0 (= (mod ~x$r_buff1_thd0~0_In-2057607268 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-2057607268 256)))) (or (and (= ~x$w_buff1~0_In-2057607268 |ULTIMATE.start_main_#t~ite40_Out-2057607268|) (not .cse0) .cse1 (not .cse2)) (and .cse1 (= |ULTIMATE.start_main_#t~ite40_Out-2057607268| ~x~0_In-2057607268) (or .cse0 .cse2)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-2057607268, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2057607268, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2057607268, ~x~0=~x~0_In-2057607268} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out-2057607268|, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out-2057607268|, ~x$w_buff1~0=~x$w_buff1~0_In-2057607268, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-2057607268, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-2057607268, ~x~0=~x~0_In-2057607268} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 07:04:25,175 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [717] [717] L811-->L811-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1559808463 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1559808463 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite42_Out-1559808463|)) (and (= ~x$w_buff0_used~0_In-1559808463 |ULTIMATE.start_main_#t~ite42_Out-1559808463|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1559808463, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1559808463} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1559808463, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-1559808463|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1559808463} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 07:04:25,176 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-969823445 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-969823445 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In-969823445 256))) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In-969823445 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite43_Out-969823445|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$w_buff1_used~0_In-969823445 |ULTIMATE.start_main_#t~ite43_Out-969823445|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-969823445, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-969823445, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-969823445, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-969823445} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-969823445, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-969823445, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-969823445|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-969823445, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-969823445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 07:04:25,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1700695149 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In1700695149 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite44_Out1700695149|) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In1700695149 |ULTIMATE.start_main_#t~ite44_Out1700695149|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1700695149, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1700695149} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1700695149, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1700695149|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1700695149} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 07:04:25,177 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd0~0_In879795172 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In879795172 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In879795172 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In879795172 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~x$r_buff1_thd0~0_In879795172 |ULTIMATE.start_main_#t~ite45_Out879795172|)) (and (= |ULTIMATE.start_main_#t~ite45_Out879795172| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In879795172, ~x$w_buff1_used~0=~x$w_buff1_used~0_In879795172, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In879795172, ~x$w_buff0_used~0=~x$w_buff0_used~0_In879795172} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In879795172, ~x$w_buff1_used~0=~x$w_buff1_used~0_In879795172, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In879795172, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out879795172|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In879795172} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 07:04:25,178 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 1 v_~__unbuffered_p1_EAX~0_7) (= v_~y~0_10 2) (= v_~main$tmp_guard1~0_8 0) (= v_~x$r_buff1_thd0~0_18 |v_ULTIMATE.start_main_#t~ite45_11|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|) (= 0 v_~__unbuffered_p1_EBX~0_7) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~y~0=v_~y~0_10, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_7, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~y~0=v_~y~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:04:25,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:04:25 BasicIcfg [2019-12-27 07:04:25,309 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:04:25,311 INFO L168 Benchmark]: Toolchain (without parser) took 12354.99 ms. Allocated memory was 137.9 MB in the beginning and 403.2 MB in the end (delta: 265.3 MB). Free memory was 101.5 MB in the beginning and 323.6 MB in the end (delta: -222.1 MB). Peak memory consumption was 43.2 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:25,312 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 07:04:25,313 INFO L168 Benchmark]: CACSL2BoogieTranslator took 740.95 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 101.0 MB in the beginning and 157.0 MB in the end (delta: -56.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:25,314 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.80 ms. Allocated memory is still 202.4 MB. Free memory was 157.0 MB in the beginning and 154.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:25,318 INFO L168 Benchmark]: Boogie Preprocessor took 37.58 ms. Allocated memory is still 202.4 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:25,319 INFO L168 Benchmark]: RCFGBuilder took 766.40 ms. Allocated memory is still 202.4 MB. Free memory was 152.1 MB in the beginning and 107.8 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:04:25,319 INFO L168 Benchmark]: TraceAbstraction took 10747.21 ms. Allocated memory was 202.4 MB in the beginning and 403.2 MB in the end (delta: 200.8 MB). Free memory was 106.8 MB in the beginning and 323.6 MB in the end (delta: -216.8 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-12-27 07:04:25,325 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.15 ms. Allocated memory is still 137.9 MB. Free memory is still 120.7 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 740.95 ms. Allocated memory was 137.9 MB in the beginning and 202.4 MB in the end (delta: 64.5 MB). Free memory was 101.0 MB in the beginning and 157.0 MB in the end (delta: -56.0 MB). Peak memory consumption was 25.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 56.80 ms. Allocated memory is still 202.4 MB. Free memory was 157.0 MB in the beginning and 154.1 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.58 ms. Allocated memory is still 202.4 MB. Free memory was 154.1 MB in the beginning and 152.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 766.40 ms. Allocated memory is still 202.4 MB. Free memory was 152.1 MB in the beginning and 107.8 MB in the end (delta: 44.3 MB). Peak memory consumption was 44.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10747.21 ms. Allocated memory was 202.4 MB in the beginning and 403.2 MB in the end (delta: 200.8 MB). Free memory was 106.8 MB in the beginning and 323.6 MB in the end (delta: -216.8 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.5s, 148 ProgramPointsBefore, 76 ProgramPointsAfterwards, 182 TransitionsBefore, 87 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 29 ConcurrentYvCompositions, 26 ChoiceCompositions, 4391 VarBasedMoverChecksPositive, 152 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49085 CheckedPairsTotal, 102 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1609, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L726] 1 x$w_buff1 = x$w_buff0 [L727] 1 x$w_buff0 = 1 [L728] 1 x$w_buff1_used = x$w_buff0_used [L729] 1 x$w_buff0_used = (_Bool)1 [L804] FCALL, FORK 0 pthread_create(&t1610, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L754] 2 y = 2 [L757] 2 z = 1 [L760] 2 __unbuffered_p1_EAX = z [L763] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L764] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L765] 2 x$flush_delayed = weak$$choice2 [L766] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L767] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L740] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L741] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L742] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L767] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L768] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L768] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L769] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L769] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L770] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L770] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L771] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L771] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L773] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L779] 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L780] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L781] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L782] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2, z=1] [L810] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L811] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L812] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L813] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 10.3s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2037 SDtfs, 1340 SDslu, 3833 SDs, 0 SdLazy, 2228 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 95 GetRequests, 31 SyntacticMatches, 10 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8066occurred 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: 1.0s AutomataMinimizationTime, 16 MinimizatonAttempts, 3129 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 571 NumberOfCodeBlocks, 571 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 502 ConstructedInterpolants, 0 QuantifiedInterpolants, 57284 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...