/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix012_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 20:02:55,589 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 20:02:55,592 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 20:02:55,613 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 20:02:55,614 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 20:02:55,616 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 20:02:55,618 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 20:02:55,628 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 20:02:55,632 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 20:02:55,635 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 20:02:55,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 20:02:55,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 20:02:55,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 20:02:55,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 20:02:55,645 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 20:02:55,646 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 20:02:55,648 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 20:02:55,649 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 20:02:55,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 20:02:55,656 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 20:02:55,660 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 20:02:55,666 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 20:02:55,668 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 20:02:55,668 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 20:02:55,671 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 20:02:55,671 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 20:02:55,671 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 20:02:55,673 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 20:02:55,674 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 20:02:55,675 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 20:02:55,676 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 20:02:55,677 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 20:02:55,678 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 20:02:55,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 20:02:55,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 20:02:55,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 20:02:55,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 20:02:55,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 20:02:55,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 20:02:55,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 20:02:55,683 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 20:02:55,684 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-MCR.epf [2019-12-27 20:02:55,718 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 20:02:55,721 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 20:02:55,722 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 20:02:55,726 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 20:02:55,726 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 20:02:55,726 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 20:02:55,726 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 20:02:55,727 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 20:02:55,727 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 20:02:55,727 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 20:02:55,727 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 20:02:55,727 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 20:02:55,728 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 20:02:55,730 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 20:02:55,730 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 20:02:55,730 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 20:02:55,730 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 20:02:55,730 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 20:02:55,731 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 20:02:55,731 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 20:02:55,731 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 20:02:55,731 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 20:02:55,731 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 20:02:55,732 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 20:02:55,732 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 20:02:55,732 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 20:02:55,732 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 20:02:55,732 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 20:02:55,733 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 20:02:55,733 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 20:02:55,733 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 20:02:55,733 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 20:02:56,036 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 20:02:56,053 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 20:02:56,056 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 20:02:56,062 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 20:02:56,063 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 20:02:56,064 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix012_rmo.oepc.i [2019-12-27 20:02:56,140 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0da2fd04d/64187916c05747c58ca10394babcf30a/FLAG3269e5985 [2019-12-27 20:02:56,686 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 20:02:56,687 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix012_rmo.oepc.i [2019-12-27 20:02:56,707 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0da2fd04d/64187916c05747c58ca10394babcf30a/FLAG3269e5985 [2019-12-27 20:02:56,952 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0da2fd04d/64187916c05747c58ca10394babcf30a [2019-12-27 20:02:56,960 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 20:02:56,962 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 20:02:56,963 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 20:02:56,963 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 20:02:56,966 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 20:02:56,967 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:02:56" (1/1) ... [2019-12-27 20:02:56,970 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e50f93c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:56, skipping insertion in model container [2019-12-27 20:02:56,970 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 08:02:56" (1/1) ... [2019-12-27 20:02:56,978 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 20:02:57,034 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 20:02:57,504 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:02:57,519 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 20:02:57,619 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 20:02:57,700 INFO L208 MainTranslator]: Completed translation [2019-12-27 20:02:57,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57 WrapperNode [2019-12-27 20:02:57,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 20:02:57,701 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 20:02:57,702 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 20:02:57,702 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 20:02:57,710 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (1/1) ... [2019-12-27 20:02:57,731 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (1/1) ... [2019-12-27 20:02:57,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 20:02:57,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 20:02:57,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 20:02:57,761 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 20:02:57,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (1/1) ... [2019-12-27 20:02:57,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (1/1) ... [2019-12-27 20:02:57,776 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (1/1) ... [2019-12-27 20:02:57,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (1/1) ... [2019-12-27 20:02:57,788 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (1/1) ... [2019-12-27 20:02:57,792 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (1/1) ... [2019-12-27 20:02:57,796 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (1/1) ... [2019-12-27 20:02:57,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 20:02:57,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 20:02:57,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 20:02:57,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 20:02:57,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (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 20:02:57,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 20:02:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 20:02:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 20:02:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 20:02:57,873 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 20:02:57,873 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 20:02:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 20:02:57,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 20:02:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 20:02:57,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 20:02:57,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 20:02:57,876 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 20:02:58,623 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 20:02:58,624 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 20:02:58,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:02:58 BoogieIcfgContainer [2019-12-27 20:02:58,626 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 20:02:58,628 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 20:02:58,628 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 20:02:58,633 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 20:02:58,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 08:02:56" (1/3) ... [2019-12-27 20:02:58,635 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee16b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:02:58, skipping insertion in model container [2019-12-27 20:02:58,635 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 08:02:57" (2/3) ... [2019-12-27 20:02:58,636 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ee16b7d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 08:02:58, skipping insertion in model container [2019-12-27 20:02:58,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 08:02:58" (3/3) ... [2019-12-27 20:02:58,638 INFO L109 eAbstractionObserver]: Analyzing ICFG mix012_rmo.oepc.i [2019-12-27 20:02:58,649 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 20:02:58,649 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 20:02:58,665 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 20:02:58,666 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 20:02:58,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,704 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,704 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,704 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,705 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,705 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,715 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,715 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,750 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,755 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,756 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,768 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,769 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,770 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,770 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,770 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,771 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,773 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,774 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,775 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,776 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,777 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,777 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,778 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,779 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,780 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,780 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,781 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 20:02:58,797 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 20:02:58,821 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 20:02:58,821 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 20:02:58,821 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 20:02:58,822 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 20:02:58,822 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 20:02:58,822 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 20:02:58,822 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 20:02:58,822 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 20:02:58,845 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 148 places, 182 transitions [2019-12-27 20:02:58,846 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 20:02:58,945 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 20:02:58,946 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:02:58,961 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 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:02:58,976 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 148 places, 182 transitions [2019-12-27 20:02:59,055 INFO L132 PetriNetUnfolder]: 41/180 cut-off events. [2019-12-27 20:02:59,055 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 20:02:59,060 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 338 event pairs. 0/137 useless extension candidates. Maximal degree in co-relation 150. Up to 2 conditions per place. [2019-12-27 20:02:59,074 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12056 [2019-12-27 20:02:59,075 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 20:03:02,349 WARN L192 SmtUtils]: Spent 214.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-27 20:03:02,471 WARN L192 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 20:03:02,501 INFO L206 etLargeBlockEncoding]: Checked pairs total: 49139 [2019-12-27 20:03:02,501 INFO L214 etLargeBlockEncoding]: Total number of compositions: 103 [2019-12-27 20:03:02,505 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 74 places, 82 transitions [2019-12-27 20:03:02,934 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 8357 states. [2019-12-27 20:03:02,936 INFO L276 IsEmpty]: Start isEmpty. Operand 8357 states. [2019-12-27 20:03:02,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 20:03:02,944 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:02,945 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 20:03:02,945 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:02,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:02,953 INFO L82 PathProgramCache]: Analyzing trace with hash 795178, now seen corresponding path program 1 times [2019-12-27 20:03:02,967 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:02,968 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637050655] [2019-12-27 20:03:02,968 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:03,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:03,267 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 20:03:03,269 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637050655] [2019-12-27 20:03:03,271 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:03,272 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:03:03,272 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1987378187] [2019-12-27 20:03:03,273 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:03,279 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:03,292 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 20:03:03,293 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:03,298 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:03,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:03,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:03,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:03,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:03,316 INFO L87 Difference]: Start difference. First operand 8357 states. Second operand 3 states. [2019-12-27 20:03:03,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:03,577 INFO L93 Difference]: Finished difference Result 8205 states and 26514 transitions. [2019-12-27 20:03:03,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:03,579 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 20:03:03,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:03,660 INFO L225 Difference]: With dead ends: 8205 [2019-12-27 20:03:03,660 INFO L226 Difference]: Without dead ends: 7724 [2019-12-27 20:03:03,662 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 20:03:03,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7724 states. [2019-12-27 20:03:04,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7724 to 7724. [2019-12-27 20:03:04,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7724 states. [2019-12-27 20:03:04,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7724 states to 7724 states and 24917 transitions. [2019-12-27 20:03:04,250 INFO L78 Accepts]: Start accepts. Automaton has 7724 states and 24917 transitions. Word has length 3 [2019-12-27 20:03:04,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:04,251 INFO L462 AbstractCegarLoop]: Abstraction has 7724 states and 24917 transitions. [2019-12-27 20:03:04,251 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:04,251 INFO L276 IsEmpty]: Start isEmpty. Operand 7724 states and 24917 transitions. [2019-12-27 20:03:04,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 20:03:04,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:04,258 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:03:04,258 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:04,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:04,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1406163788, now seen corresponding path program 1 times [2019-12-27 20:03:04,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:04,259 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396892103] [2019-12-27 20:03:04,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:04,366 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 20:03:04,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396892103] [2019-12-27 20:03:04,367 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:04,367 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:03:04,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [990291890] [2019-12-27 20:03:04,367 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:04,369 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:04,372 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 20:03:04,373 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:04,373 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:04,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:04,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:04,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:04,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:04,375 INFO L87 Difference]: Start difference. First operand 7724 states and 24917 transitions. Second operand 3 states. [2019-12-27 20:03:04,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:04,412 INFO L93 Difference]: Finished difference Result 1230 states and 2764 transitions. [2019-12-27 20:03:04,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:04,413 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-27 20:03:04,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:04,420 INFO L225 Difference]: With dead ends: 1230 [2019-12-27 20:03:04,421 INFO L226 Difference]: Without dead ends: 1230 [2019-12-27 20:03:04,422 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 20:03:04,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1230 states. [2019-12-27 20:03:04,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1230 to 1230. [2019-12-27 20:03:04,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1230 states. [2019-12-27 20:03:04,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1230 states to 1230 states and 2764 transitions. [2019-12-27 20:03:04,465 INFO L78 Accepts]: Start accepts. Automaton has 1230 states and 2764 transitions. Word has length 11 [2019-12-27 20:03:04,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:04,465 INFO L462 AbstractCegarLoop]: Abstraction has 1230 states and 2764 transitions. [2019-12-27 20:03:04,465 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:04,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1230 states and 2764 transitions. [2019-12-27 20:03:04,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 20:03:04,470 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:04,470 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:03:04,471 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:04,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:04,471 INFO L82 PathProgramCache]: Analyzing trace with hash 540130104, now seen corresponding path program 1 times [2019-12-27 20:03:04,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:04,472 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019537666] [2019-12-27 20:03:04,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:04,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:04,644 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 20:03:04,645 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019537666] [2019-12-27 20:03:04,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:04,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:03:04,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [729621250] [2019-12-27 20:03:04,646 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:04,648 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:04,653 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 15 states and 14 transitions. [2019-12-27 20:03:04,654 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:04,654 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:04,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:03:04,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:04,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:03:04,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:04,656 INFO L87 Difference]: Start difference. First operand 1230 states and 2764 transitions. Second operand 5 states. [2019-12-27 20:03:04,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:04,963 INFO L93 Difference]: Finished difference Result 1827 states and 4035 transitions. [2019-12-27 20:03:04,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 20:03:04,964 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-12-27 20:03:04,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:04,974 INFO L225 Difference]: With dead ends: 1827 [2019-12-27 20:03:04,974 INFO L226 Difference]: Without dead ends: 1827 [2019-12-27 20:03:04,975 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 20:03:04,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1827 states. [2019-12-27 20:03:05,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1827 to 1570. [2019-12-27 20:03:05,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1570 states. [2019-12-27 20:03:05,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 3505 transitions. [2019-12-27 20:03:05,029 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 3505 transitions. Word has length 14 [2019-12-27 20:03:05,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:05,030 INFO L462 AbstractCegarLoop]: Abstraction has 1570 states and 3505 transitions. [2019-12-27 20:03:05,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:03:05,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 3505 transitions. [2019-12-27 20:03:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 20:03:05,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:05,035 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 20:03:05,035 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:05,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:05,036 INFO L82 PathProgramCache]: Analyzing trace with hash -2113363587, now seen corresponding path program 1 times [2019-12-27 20:03:05,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:05,041 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303348153] [2019-12-27 20:03:05,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:05,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:05,193 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 20:03:05,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303348153] [2019-12-27 20:03:05,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:05,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 20:03:05,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [360597800] [2019-12-27 20:03:05,198 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:05,204 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:05,212 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 20:03:05,212 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:05,213 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:05,213 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 20:03:05,213 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:05,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 20:03:05,214 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 20:03:05,214 INFO L87 Difference]: Start difference. First operand 1570 states and 3505 transitions. Second operand 6 states. [2019-12-27 20:03:05,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:05,722 INFO L93 Difference]: Finished difference Result 2335 states and 5008 transitions. [2019-12-27 20:03:05,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:03:05,722 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 25 [2019-12-27 20:03:05,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:05,735 INFO L225 Difference]: With dead ends: 2335 [2019-12-27 20:03:05,735 INFO L226 Difference]: Without dead ends: 2335 [2019-12-27 20:03:05,736 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:03:05,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2335 states. [2019-12-27 20:03:05,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2335 to 1703. [2019-12-27 20:03:05,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-12-27 20:03:05,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 3769 transitions. [2019-12-27 20:03:05,784 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 3769 transitions. Word has length 25 [2019-12-27 20:03:05,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:05,785 INFO L462 AbstractCegarLoop]: Abstraction has 1703 states and 3769 transitions. [2019-12-27 20:03:05,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 20:03:05,785 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 3769 transitions. [2019-12-27 20:03:05,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-27 20:03:05,787 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:05,787 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 20:03:05,788 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:05,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:05,788 INFO L82 PathProgramCache]: Analyzing trace with hash 461887986, now seen corresponding path program 1 times [2019-12-27 20:03:05,789 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:05,789 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949347961] [2019-12-27 20:03:05,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:05,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:05,866 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 20:03:05,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949347961] [2019-12-27 20:03:05,867 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:05,867 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 20:03:05,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1755188302] [2019-12-27 20:03:05,868 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:05,873 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:05,882 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 70 transitions. [2019-12-27 20:03:05,882 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:05,884 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:05,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:05,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:05,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:05,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:05,885 INFO L87 Difference]: Start difference. First operand 1703 states and 3769 transitions. Second operand 3 states. [2019-12-27 20:03:05,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:05,905 INFO L93 Difference]: Finished difference Result 1702 states and 3767 transitions. [2019-12-27 20:03:05,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:05,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-12-27 20:03:05,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:05,915 INFO L225 Difference]: With dead ends: 1702 [2019-12-27 20:03:05,916 INFO L226 Difference]: Without dead ends: 1702 [2019-12-27 20:03:05,916 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:05,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1702 states. [2019-12-27 20:03:05,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1702 to 1702. [2019-12-27 20:03:05,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-27 20:03:05,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3767 transitions. [2019-12-27 20:03:05,971 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3767 transitions. Word has length 26 [2019-12-27 20:03:05,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:05,972 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3767 transitions. [2019-12-27 20:03:05,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:05,972 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3767 transitions. [2019-12-27 20:03:05,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:03:05,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:05,975 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] [2019-12-27 20:03:05,975 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:05,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:05,976 INFO L82 PathProgramCache]: Analyzing trace with hash -691470702, now seen corresponding path program 1 times [2019-12-27 20:03:05,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:05,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529244597] [2019-12-27 20:03:05,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:06,067 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 20:03:06,067 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529244597] [2019-12-27 20:03:06,067 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:06,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:03:06,068 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1992214909] [2019-12-27 20:03:06,068 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:06,073 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:06,081 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 33 transitions. [2019-12-27 20:03:06,081 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:06,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:03:06,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 20:03:06,087 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:06,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 20:03:06,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 20:03:06,087 INFO L87 Difference]: Start difference. First operand 1702 states and 3767 transitions. Second operand 4 states. [2019-12-27 20:03:06,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:06,126 INFO L93 Difference]: Finished difference Result 2698 states and 6019 transitions. [2019-12-27 20:03:06,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:03:06,127 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-12-27 20:03:06,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:06,144 INFO L225 Difference]: With dead ends: 2698 [2019-12-27 20:03:06,145 INFO L226 Difference]: Without dead ends: 1248 [2019-12-27 20:03:06,145 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 20:03:06,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2019-12-27 20:03:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 1231. [2019-12-27 20:03:06,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1231 states. [2019-12-27 20:03:06,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1231 states to 1231 states and 2688 transitions. [2019-12-27 20:03:06,181 INFO L78 Accepts]: Start accepts. Automaton has 1231 states and 2688 transitions. Word has length 27 [2019-12-27 20:03:06,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:06,181 INFO L462 AbstractCegarLoop]: Abstraction has 1231 states and 2688 transitions. [2019-12-27 20:03:06,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 20:03:06,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1231 states and 2688 transitions. [2019-12-27 20:03:06,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 20:03:06,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:06,184 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] [2019-12-27 20:03:06,184 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:06,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:06,184 INFO L82 PathProgramCache]: Analyzing trace with hash -250638352, now seen corresponding path program 2 times [2019-12-27 20:03:06,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:06,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320123609] [2019-12-27 20:03:06,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:06,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:06,277 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 20:03:06,278 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320123609] [2019-12-27 20:03:06,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:06,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 20:03:06,279 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1691529150] [2019-12-27 20:03:06,279 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:06,283 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:06,295 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 59 states and 89 transitions. [2019-12-27 20:03:06,295 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:06,405 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 7 times. [2019-12-27 20:03:06,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 20:03:06,406 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:06,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 20:03:06,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 20:03:06,407 INFO L87 Difference]: Start difference. First operand 1231 states and 2688 transitions. Second operand 8 states. [2019-12-27 20:03:07,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:07,219 INFO L93 Difference]: Finished difference Result 1897 states and 4072 transitions. [2019-12-27 20:03:07,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 20:03:07,227 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-12-27 20:03:07,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:07,235 INFO L225 Difference]: With dead ends: 1897 [2019-12-27 20:03:07,235 INFO L226 Difference]: Without dead ends: 1897 [2019-12-27 20:03:07,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:03:07,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1897 states. [2019-12-27 20:03:07,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1897 to 1702. [2019-12-27 20:03:07,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1702 states. [2019-12-27 20:03:07,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1702 states to 1702 states and 3698 transitions. [2019-12-27 20:03:07,276 INFO L78 Accepts]: Start accepts. Automaton has 1702 states and 3698 transitions. Word has length 27 [2019-12-27 20:03:07,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:07,276 INFO L462 AbstractCegarLoop]: Abstraction has 1702 states and 3698 transitions. [2019-12-27 20:03:07,276 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 20:03:07,277 INFO L276 IsEmpty]: Start isEmpty. Operand 1702 states and 3698 transitions. [2019-12-27 20:03:07,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 20:03:07,279 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:07,279 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 20:03:07,280 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:07,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:07,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1889347286, now seen corresponding path program 1 times [2019-12-27 20:03:07,280 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:07,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849938609] [2019-12-27 20:03:07,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:07,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 20:03:07,324 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849938609] [2019-12-27 20:03:07,324 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:07,324 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:03:07,325 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [963771854] [2019-12-27 20:03:07,325 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:07,332 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:07,345 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 92 transitions. [2019-12-27 20:03:07,346 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:07,370 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 20:03:07,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 20:03:07,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:07,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 20:03:07,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:07,372 INFO L87 Difference]: Start difference. First operand 1702 states and 3698 transitions. Second operand 5 states. [2019-12-27 20:03:07,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:07,392 INFO L93 Difference]: Finished difference Result 921 states and 1892 transitions. [2019-12-27 20:03:07,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 20:03:07,392 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 20:03:07,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:07,396 INFO L225 Difference]: With dead ends: 921 [2019-12-27 20:03:07,396 INFO L226 Difference]: Without dead ends: 824 [2019-12-27 20:03:07,397 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 20:03:07,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 824 states. [2019-12-27 20:03:07,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 824 to 782. [2019-12-27 20:03:07,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 782 states. [2019-12-27 20:03:07,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1664 transitions. [2019-12-27 20:03:07,414 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1664 transitions. Word has length 28 [2019-12-27 20:03:07,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:07,415 INFO L462 AbstractCegarLoop]: Abstraction has 782 states and 1664 transitions. [2019-12-27 20:03:07,415 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 20:03:07,415 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1664 transitions. [2019-12-27 20:03:07,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:03:07,417 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:07,418 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 20:03:07,418 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:07,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:07,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1472734739, now seen corresponding path program 1 times [2019-12-27 20:03:07,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:07,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817524345] [2019-12-27 20:03:07,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:07,507 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 20:03:07,507 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817524345] [2019-12-27 20:03:07,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:07,508 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 20:03:07,508 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1085179117] [2019-12-27 20:03:07,508 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:07,523 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:07,672 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 110 states and 167 transitions. [2019-12-27 20:03:07,672 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:07,742 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 9 times. [2019-12-27 20:03:07,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 20:03:07,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:07,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 20:03:07,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 20:03:07,744 INFO L87 Difference]: Start difference. First operand 782 states and 1664 transitions. Second operand 9 states. [2019-12-27 20:03:08,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:08,027 INFO L93 Difference]: Finished difference Result 1342 states and 2781 transitions. [2019-12-27 20:03:08,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 20:03:08,028 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 51 [2019-12-27 20:03:08,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:08,032 INFO L225 Difference]: With dead ends: 1342 [2019-12-27 20:03:08,033 INFO L226 Difference]: Without dead ends: 903 [2019-12-27 20:03:08,033 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-12-27 20:03:08,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-12-27 20:03:08,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 773. [2019-12-27 20:03:08,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-12-27 20:03:08,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1630 transitions. [2019-12-27 20:03:08,051 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1630 transitions. Word has length 51 [2019-12-27 20:03:08,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:08,052 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1630 transitions. [2019-12-27 20:03:08,052 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 20:03:08,052 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1630 transitions. [2019-12-27 20:03:08,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:03:08,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:08,054 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 20:03:08,054 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:08,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:08,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1162443569, now seen corresponding path program 2 times [2019-12-27 20:03:08,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:08,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067587817] [2019-12-27 20:03:08,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:08,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:08,173 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 20:03:08,174 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067587817] [2019-12-27 20:03:08,174 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:08,174 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 20:03:08,175 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1561351641] [2019-12-27 20:03:08,175 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:08,190 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:08,248 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 166 transitions. [2019-12-27 20:03:08,249 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:08,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:03:08,412 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 20:03:08,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 20:03:08,413 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:08,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 20:03:08,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 20:03:08,413 INFO L87 Difference]: Start difference. First operand 773 states and 1630 transitions. Second operand 10 states. [2019-12-27 20:03:09,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:09,456 INFO L93 Difference]: Finished difference Result 1157 states and 2371 transitions. [2019-12-27 20:03:09,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 20:03:09,456 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 51 [2019-12-27 20:03:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:09,461 INFO L225 Difference]: With dead ends: 1157 [2019-12-27 20:03:09,461 INFO L226 Difference]: Without dead ends: 1157 [2019-12-27 20:03:09,461 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 7 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-12-27 20:03:09,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1157 states. [2019-12-27 20:03:09,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1157 to 845. [2019-12-27 20:03:09,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 845 states. [2019-12-27 20:03:09,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 845 states to 845 states and 1761 transitions. [2019-12-27 20:03:09,481 INFO L78 Accepts]: Start accepts. Automaton has 845 states and 1761 transitions. Word has length 51 [2019-12-27 20:03:09,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:09,482 INFO L462 AbstractCegarLoop]: Abstraction has 845 states and 1761 transitions. [2019-12-27 20:03:09,482 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 20:03:09,482 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1761 transitions. [2019-12-27 20:03:09,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-27 20:03:09,484 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:09,484 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 20:03:09,485 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:09,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:09,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1548839163, now seen corresponding path program 3 times [2019-12-27 20:03:09,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:09,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556968040] [2019-12-27 20:03:09,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:09,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:09,563 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 20:03:09,564 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556968040] [2019-12-27 20:03:09,564 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:09,564 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:03:09,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [951942052] [2019-12-27 20:03:09,564 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:09,578 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:09,639 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 129 transitions. [2019-12-27 20:03:09,639 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:09,640 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 20:03:09,641 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:09,641 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:09,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:09,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:09,641 INFO L87 Difference]: Start difference. First operand 845 states and 1761 transitions. Second operand 3 states. [2019-12-27 20:03:09,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:09,690 INFO L93 Difference]: Finished difference Result 1118 states and 2337 transitions. [2019-12-27 20:03:09,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:09,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-27 20:03:09,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:09,694 INFO L225 Difference]: With dead ends: 1118 [2019-12-27 20:03:09,694 INFO L226 Difference]: Without dead ends: 1118 [2019-12-27 20:03:09,695 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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 20:03:09,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2019-12-27 20:03:09,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 902. [2019-12-27 20:03:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 902 states. [2019-12-27 20:03:09,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1897 transitions. [2019-12-27 20:03:09,714 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1897 transitions. Word has length 51 [2019-12-27 20:03:09,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:09,715 INFO L462 AbstractCegarLoop]: Abstraction has 902 states and 1897 transitions. [2019-12-27 20:03:09,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:09,715 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1897 transitions. [2019-12-27 20:03:09,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:03:09,718 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:09,718 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 20:03:09,718 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:09,719 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:09,719 INFO L82 PathProgramCache]: Analyzing trace with hash -2127061277, now seen corresponding path program 1 times [2019-12-27 20:03:09,719 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:09,720 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155729785] [2019-12-27 20:03:09,720 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:09,903 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 20:03:09,904 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155729785] [2019-12-27 20:03:09,904 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:09,904 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 20:03:09,904 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1469520317] [2019-12-27 20:03:09,905 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:09,920 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:10,350 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 113 states and 169 transitions. [2019-12-27 20:03:10,351 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:10,449 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 20:03:10,500 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 20:03:10,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 20:03:10,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:10,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 20:03:10,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 20:03:10,502 INFO L87 Difference]: Start difference. First operand 902 states and 1897 transitions. Second operand 11 states. [2019-12-27 20:03:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:11,697 INFO L93 Difference]: Finished difference Result 1246 states and 2538 transitions. [2019-12-27 20:03:11,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 20:03:11,697 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 52 [2019-12-27 20:03:11,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:11,704 INFO L225 Difference]: With dead ends: 1246 [2019-12-27 20:03:11,704 INFO L226 Difference]: Without dead ends: 1246 [2019-12-27 20:03:11,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 10 SyntacticMatches, 8 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-12-27 20:03:11,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1246 states. [2019-12-27 20:03:11,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1246 to 962. [2019-12-27 20:03:11,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 962 states. [2019-12-27 20:03:11,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 2019 transitions. [2019-12-27 20:03:11,733 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 2019 transitions. Word has length 52 [2019-12-27 20:03:11,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:11,734 INFO L462 AbstractCegarLoop]: Abstraction has 962 states and 2019 transitions. [2019-12-27 20:03:11,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 20:03:11,734 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 2019 transitions. [2019-12-27 20:03:11,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:03:11,737 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:11,737 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 20:03:11,737 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:11,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:11,738 INFO L82 PathProgramCache]: Analyzing trace with hash 313439079, now seen corresponding path program 1 times [2019-12-27 20:03:11,738 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:11,739 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993528642] [2019-12-27 20:03:11,739 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:11,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:11,797 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 20:03:11,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993528642] [2019-12-27 20:03:11,798 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:11,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 20:03:11,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [117402372] [2019-12-27 20:03:11,798 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:11,814 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:11,867 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 133 transitions. [2019-12-27 20:03:11,867 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:11,871 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 20:03:11,872 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:11,872 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:11,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:11,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:11,873 INFO L87 Difference]: Start difference. First operand 962 states and 2019 transitions. Second operand 3 states. [2019-12-27 20:03:11,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:11,938 INFO L93 Difference]: Finished difference Result 1371 states and 2765 transitions. [2019-12-27 20:03:11,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:11,939 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 20:03:11,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:11,941 INFO L225 Difference]: With dead ends: 1371 [2019-12-27 20:03:11,941 INFO L226 Difference]: Without dead ends: 1371 [2019-12-27 20:03:11,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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 20:03:11,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2019-12-27 20:03:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1036. [2019-12-27 20:03:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1036 states. [2019-12-27 20:03:11,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1036 states to 1036 states and 2149 transitions. [2019-12-27 20:03:11,964 INFO L78 Accepts]: Start accepts. Automaton has 1036 states and 2149 transitions. Word has length 52 [2019-12-27 20:03:11,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:11,965 INFO L462 AbstractCegarLoop]: Abstraction has 1036 states and 2149 transitions. [2019-12-27 20:03:11,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:11,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 2149 transitions. [2019-12-27 20:03:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-27 20:03:11,967 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:11,968 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 20:03:11,968 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:11,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:11,968 INFO L82 PathProgramCache]: Analyzing trace with hash -1220422803, now seen corresponding path program 2 times [2019-12-27 20:03:11,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:11,969 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310878819] [2019-12-27 20:03:11,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:11,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 20:03:12,041 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 20:03:12,041 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310878819] [2019-12-27 20:03:12,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 20:03:12,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 20:03:12,042 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [172294466] [2019-12-27 20:03:12,042 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 20:03:12,058 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 20:03:12,140 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 102 states and 133 transitions. [2019-12-27 20:03:12,141 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 20:03:12,141 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 20:03:12,142 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 20:03:12,142 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 20:03:12,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 20:03:12,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 20:03:12,143 INFO L87 Difference]: Start difference. First operand 1036 states and 2149 transitions. Second operand 3 states. [2019-12-27 20:03:12,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 20:03:12,158 INFO L93 Difference]: Finished difference Result 1035 states and 2147 transitions. [2019-12-27 20:03:12,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 20:03:12,159 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-12-27 20:03:12,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 20:03:12,161 INFO L225 Difference]: With dead ends: 1035 [2019-12-27 20:03:12,162 INFO L226 Difference]: Without dead ends: 1035 [2019-12-27 20:03:12,162 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 20:03:12,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2019-12-27 20:03:12,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 823. [2019-12-27 20:03:12,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 823 states. [2019-12-27 20:03:12,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1747 transitions. [2019-12-27 20:03:12,179 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1747 transitions. Word has length 52 [2019-12-27 20:03:12,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 20:03:12,179 INFO L462 AbstractCegarLoop]: Abstraction has 823 states and 1747 transitions. [2019-12-27 20:03:12,180 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 20:03:12,180 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1747 transitions. [2019-12-27 20:03:12,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-27 20:03:12,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 20:03:12,182 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 20:03:12,182 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 20:03:12,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 20:03:12,182 INFO L82 PathProgramCache]: Analyzing trace with hash -445188541, now seen corresponding path program 1 times [2019-12-27 20:03:12,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 20:03:12,183 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953493794] [2019-12-27 20:03:12,183 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 20:03:12,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:03:12,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 20:03:12,356 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 20:03:12,356 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 20:03:12,360 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] ULTIMATE.startENTRY-->L799: Formula: (let ((.cse0 (store |v_#valid_51| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~x~0_11 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t313~0.base_22|) (= 0 v_~y$w_buff1~0_24) (= v_~main$tmp_guard0~0_9 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_15 0) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$mem_tmp~0_7) (= 0 v_~y$r_buff1_thd2~0_56) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t313~0.base_22|)) (= 0 v_~__unbuffered_cnt~0_17) (= 0 v_~y$read_delayed_var~0.base_5) (= 0 |v_ULTIMATE.start_main_~#t313~0.offset_17|) (= 0 v_~weak$$choice2~0_34) (= v_~y~0_24 0) (< 0 |v_#StackHeapBarrier_15|) (= 0 v_~y$r_buff1_thd0~0_24) (= 0 v_~y$flush_delayed~0_13) (= 0 v_~y$read_delayed_var~0.offset_5) (= v_~y$r_buff0_thd1~0_29 0) (= 0 |v_#NULL.base_6|) (= 0 v_~y$r_buff1_thd1~0_18) (= v_~y$r_buff0_thd0~0_21 0) (= |v_#valid_49| (store .cse0 |v_ULTIMATE.start_main_~#t313~0.base_22| 1)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t313~0.base_22| 4)) (= v_~y$w_buff0_used~0_105 0) (= v_~y$r_buff0_thd2~0_81 0) (= 0 v_~y$w_buff0~0_25) (= 0 v_~__unbuffered_p0_EAX~0_16) (= v_~y$w_buff1_used~0_64 0) (= 0 v_~weak$$choice0~0_6) (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t313~0.base_22| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t313~0.base_22|) |v_ULTIMATE.start_main_~#t313~0.offset_17| 0))))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_51|, #memory_int=|v_#memory_int_12|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t313~0.base=|v_ULTIMATE.start_main_~#t313~0.base_22|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_105, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_~#t314~0.offset=|v_ULTIMATE.start_main_~#t314~0.offset_18|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_18, ~y$mem_tmp~0=v_~y$mem_tmp~0_7, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ~y$w_buff0~0=v_~y$w_buff0~0_25, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_29, ~y$flush_delayed~0=v_~y$flush_delayed~0_13, #length=|v_#length_17|, ~y~0=v_~y~0_24, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_56, ~weak$$choice0~0=v_~weak$$choice0~0_6, #StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_12|, ULTIMATE.start_main_~#t314~0.base=|v_ULTIMATE.start_main_~#t314~0.base_24|, ~y$w_buff1~0=v_~y$w_buff1~0_24, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_5, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, #valid=|v_#valid_49|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_81, #memory_int=|v_#memory_int_11|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ULTIMATE.start_main_~#t313~0.offset=|v_ULTIMATE.start_main_~#t313~0.offset_17|, ~weak$$choice2~0=v_~weak$$choice2~0_34, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_24, ~x~0=v_~x~0_11, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t313~0.base, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~y$read_delayed~0, ULTIMATE.start_main_~#t314~0.offset, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ~y~0, ~__unbuffered_p1_EBX~0, ~main$tmp_guard0~0, #NULL.base, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_~#t314~0.base, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t313~0.offset, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 20:03:12,362 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L799-1-->L801: Formula: (and (= |v_ULTIMATE.start_main_~#t314~0.offset_9| 0) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t314~0.base_10| 1)) (not (= |v_ULTIMATE.start_main_~#t314~0.base_10| 0)) (= |v_#length_9| (store |v_#length_10| |v_ULTIMATE.start_main_~#t314~0.base_10| 4)) (= (select |v_#valid_20| |v_ULTIMATE.start_main_~#t314~0.base_10|) 0) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t314~0.base_10| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t314~0.base_10|) |v_ULTIMATE.start_main_~#t314~0.offset_9| 1))) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t314~0.base_10|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_6|, #length=|v_#length_10|} OutVars{ULTIMATE.start_main_~#t314~0.offset=|v_ULTIMATE.start_main_~#t314~0.offset_9|, #StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_~#t314~0.base=|v_ULTIMATE.start_main_~#t314~0.base_10|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_5|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t314~0.offset, ULTIMATE.start_main_~#t314~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 20:03:12,363 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L4-->L740: Formula: (and (not (= 0 P0Thread1of1ForFork0___VERIFIER_assert_~expression_In901526130)) (= ~y$r_buff0_thd1~0_In901526130 ~y$r_buff1_thd1~0_Out901526130) (= ~y$r_buff1_thd2~0_Out901526130 ~y$r_buff0_thd2~0_In901526130) (= ~__unbuffered_p0_EAX~0_Out901526130 ~x~0_In901526130) (= 1 ~y$r_buff0_thd1~0_Out901526130) (= ~y$r_buff0_thd0~0_In901526130 ~y$r_buff1_thd0~0_Out901526130)) InVars {~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In901526130, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In901526130, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In901526130, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In901526130, ~x~0=~x~0_In901526130} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_Out901526130, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_Out901526130, ~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out901526130, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In901526130, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out901526130, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In901526130, P0Thread1of1ForFork0___VERIFIER_assert_~expression=P0Thread1of1ForFork0___VERIFIER_assert_~expression_In901526130, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_Out901526130, ~x~0=~x~0_In901526130} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p0_EAX~0, ~y$r_buff0_thd1~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 20:03:12,367 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [706] [706] L741-->L741-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In-288936215 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-288936215 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-288936215| ~y$w_buff0_used~0_In-288936215) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-288936215|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-288936215, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-288936215} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-288936215|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-288936215, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-288936215} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-27 20:03:12,368 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [701] [701] L742-->L742-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1610782569 256))) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-1610782569 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd1~0_In-1610782569 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-1610782569 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out-1610782569| ~y$w_buff1_used~0_In-1610782569) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1610782569| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1610782569, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1610782569, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1610782569, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1610782569} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1610782569|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1610782569, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1610782569, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1610782569, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1610782569} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-27 20:03:12,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L743-->L744: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-353254520 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-353254520 256)))) (or (and (= ~y$r_buff0_thd1~0_Out-353254520 ~y$r_buff0_thd1~0_In-353254520) (or .cse0 .cse1)) (and (not .cse1) (= ~y$r_buff0_thd1~0_Out-353254520 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-353254520, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-353254520} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-353254520, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-353254520|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_Out-353254520} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 20:03:12,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [714] [714] L744-->L744-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff0_thd1~0_In855777416 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In855777416 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In855777416 256))) (.cse0 (= (mod ~y$r_buff1_thd1~0_In855777416 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite8_Out855777416| ~y$r_buff1_thd1~0_In855777416) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite8_Out855777416| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In855777416, ~y$w_buff0_used~0=~y$w_buff0_used~0_In855777416, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In855777416, ~y$w_buff1_used~0=~y$w_buff1_used~0_In855777416} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In855777416, ~y$w_buff0_used~0=~y$w_buff0_used~0_In855777416, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out855777416|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In855777416, ~y$w_buff1_used~0=~y$w_buff1_used~0_In855777416} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-27 20:03:12,369 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L744-2-->P0EXIT: Formula: (and (= |v_P0Thread1of1ForFork0_#t~ite8_8| v_~y$r_buff1_thd1~0_13) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_13, 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_9} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 20:03:12,371 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [750] [750] L766-->L766-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In580693653 256)))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite17_In580693653| |P1Thread1of1ForFork1_#t~ite17_Out580693653|) (= |P1Thread1of1ForFork1_#t~ite18_Out580693653| ~y$w_buff1~0_In580693653)) (and (= |P1Thread1of1ForFork1_#t~ite17_Out580693653| ~y$w_buff1~0_In580693653) .cse0 (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In580693653 256)))) (or (and .cse1 (= (mod ~y$r_buff1_thd2~0_In580693653 256) 0)) (and (= 0 (mod ~y$w_buff1_used~0_In580693653 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In580693653 256)))) (= |P1Thread1of1ForFork1_#t~ite17_Out580693653| |P1Thread1of1ForFork1_#t~ite18_Out580693653|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In580693653, ~y$w_buff1~0=~y$w_buff1~0_In580693653, ~y$w_buff0_used~0=~y$w_buff0_used~0_In580693653, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In580693653, ~weak$$choice2~0=~weak$$choice2~0_In580693653, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_In580693653|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In580693653} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In580693653, P1Thread1of1ForFork1_#t~ite18=|P1Thread1of1ForFork1_#t~ite18_Out580693653|, ~y$w_buff1~0=~y$w_buff1~0_In580693653, ~y$w_buff0_used~0=~y$w_buff0_used~0_In580693653, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In580693653, ~weak$$choice2~0=~weak$$choice2~0_In580693653, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out580693653|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In580693653} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-27 20:03:12,372 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L767-->L767-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-23097393 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite20_Out-23097393| ~y$w_buff0_used~0_In-23097393) (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-23097393 256)))) (or (= 0 (mod ~y$w_buff0_used~0_In-23097393 256)) (and .cse0 (= (mod ~y$w_buff1_used~0_In-23097393 256) 0)) (and .cse0 (= (mod ~y$r_buff1_thd2~0_In-23097393 256) 0)))) (= |P1Thread1of1ForFork1_#t~ite21_Out-23097393| |P1Thread1of1ForFork1_#t~ite20_Out-23097393|) .cse1) (and (= |P1Thread1of1ForFork1_#t~ite20_In-23097393| |P1Thread1of1ForFork1_#t~ite20_Out-23097393|) (= |P1Thread1of1ForFork1_#t~ite21_Out-23097393| ~y$w_buff0_used~0_In-23097393) (not .cse1)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-23097393, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-23097393, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_In-23097393|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-23097393, ~weak$$choice2~0=~weak$$choice2~0_In-23097393, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-23097393} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-23097393, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-23097393, P1Thread1of1ForFork1_#t~ite20=|P1Thread1of1ForFork1_#t~ite20_Out-23097393|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-23097393, P1Thread1of1ForFork1_#t~ite21=|P1Thread1of1ForFork1_#t~ite21_Out-23097393|, ~weak$$choice2~0=~weak$$choice2~0_In-23097393, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-23097393} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite20, P1Thread1of1ForFork1_#t~ite21] because there is no mapped edge [2019-12-27 20:03:12,373 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L768-->L768-8: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In-1789604176 256) 0)) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In-1789604176 256))) (.cse4 (= 0 (mod ~weak$$choice2~0_In-1789604176 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In-1789604176 256))) (.cse5 (= |P1Thread1of1ForFork1_#t~ite24_Out-1789604176| |P1Thread1of1ForFork1_#t~ite23_Out-1789604176|)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1789604176 256)))) (or (and (or (and (or (and .cse0 .cse1) .cse2 (and .cse3 .cse0)) .cse4 (= |P1Thread1of1ForFork1_#t~ite23_Out-1789604176| ~y$w_buff1_used~0_In-1789604176) .cse5) (and (= |P1Thread1of1ForFork1_#t~ite23_Out-1789604176| |P1Thread1of1ForFork1_#t~ite23_In-1789604176|) (= |P1Thread1of1ForFork1_#t~ite24_Out-1789604176| ~y$w_buff1_used~0_In-1789604176) (not .cse4))) (= |P1Thread1of1ForFork1_#t~ite22_In-1789604176| |P1Thread1of1ForFork1_#t~ite22_Out-1789604176|)) (let ((.cse6 (not .cse0))) (and (not .cse2) (or (not .cse3) .cse6) .cse4 (= |P1Thread1of1ForFork1_#t~ite23_Out-1789604176| |P1Thread1of1ForFork1_#t~ite22_Out-1789604176|) (or (not .cse1) .cse6) (= |P1Thread1of1ForFork1_#t~ite22_Out-1789604176| 0) .cse5)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1789604176, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1789604176, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1789604176, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_In-1789604176|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_In-1789604176|, ~weak$$choice2~0=~weak$$choice2~0_In-1789604176, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1789604176} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1789604176, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1789604176, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1789604176, P1Thread1of1ForFork1_#t~ite23=|P1Thread1of1ForFork1_#t~ite23_Out-1789604176|, P1Thread1of1ForFork1_#t~ite24=|P1Thread1of1ForFork1_#t~ite24_Out-1789604176|, P1Thread1of1ForFork1_#t~ite22=|P1Thread1of1ForFork1_#t~ite22_Out-1789604176|, ~weak$$choice2~0=~weak$$choice2~0_In-1789604176, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1789604176} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite23, P1Thread1of1ForFork1_#t~ite24, P1Thread1of1ForFork1_#t~ite22] because there is no mapped edge [2019-12-27 20:03:12,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [665] [665] L769-->L770: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_15 256))) (= v_~y$r_buff0_thd2~0_49 v_~y$r_buff0_thd2~0_50)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_50, ~weak$$choice2~0=v_~weak$$choice2~0_15} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_49, P1Thread1of1ForFork1_#t~ite27=|v_P1Thread1of1ForFork1_#t~ite27_9|, ~weak$$choice2~0=v_~weak$$choice2~0_15, P1Thread1of1ForFork1_#t~ite25=|v_P1Thread1of1ForFork1_#t~ite25_8|, P1Thread1of1ForFork1_#t~ite26=|v_P1Thread1of1ForFork1_#t~ite26_9|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite27, P1Thread1of1ForFork1_#t~ite25, P1Thread1of1ForFork1_#t~ite26] because there is no mapped edge [2019-12-27 20:03:12,374 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L770-->L770-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-1284070075 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite29_In-1284070075| |P1Thread1of1ForFork1_#t~ite29_Out-1284070075|) (= ~y$r_buff1_thd2~0_In-1284070075 |P1Thread1of1ForFork1_#t~ite30_Out-1284070075|) (= |P1Thread1of1ForFork1_#t~ite28_In-1284070075| |P1Thread1of1ForFork1_#t~ite28_Out-1284070075|)) (let ((.cse1 (not (= (mod ~y$r_buff0_thd2~0_In-1284070075 256) 0)))) (and .cse0 (= |P1Thread1of1ForFork1_#t~ite29_Out-1284070075| |P1Thread1of1ForFork1_#t~ite28_Out-1284070075|) (or (not (= 0 (mod ~y$w_buff1_used~0_In-1284070075 256))) .cse1) (not (= 0 (mod ~y$w_buff0_used~0_In-1284070075 256))) (= |P1Thread1of1ForFork1_#t~ite29_Out-1284070075| |P1Thread1of1ForFork1_#t~ite30_Out-1284070075|) (= 0 |P1Thread1of1ForFork1_#t~ite28_Out-1284070075|) (or (not (= (mod ~y$r_buff1_thd2~0_In-1284070075 256) 0)) .cse1))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1284070075, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_In-1284070075|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1284070075, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1284070075, ~weak$$choice2~0=~weak$$choice2~0_In-1284070075, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_In-1284070075|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1284070075} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1284070075, P1Thread1of1ForFork1_#t~ite29=|P1Thread1of1ForFork1_#t~ite29_Out-1284070075|, P1Thread1of1ForFork1_#t~ite30=|P1Thread1of1ForFork1_#t~ite30_Out-1284070075|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1284070075, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1284070075, ~weak$$choice2~0=~weak$$choice2~0_In-1284070075, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out-1284070075|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1284070075} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, P1Thread1of1ForFork1_#t~ite30, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 20:03:12,375 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [696] [696] L772-->L776: Formula: (and (not (= 0 (mod v_~y$flush_delayed~0_8 256))) (= v_~y~0_18 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_7)) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_8} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_7|, ~y$flush_delayed~0=v_~y$flush_delayed~0_7, ~y~0=v_~y~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$flush_delayed~0, ~y~0] because there is no mapped edge [2019-12-27 20:03:12,376 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L776-2-->L776-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork1_#t~ite33_Out-1889264711| |P1Thread1of1ForFork1_#t~ite32_Out-1889264711|)) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1889264711 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In-1889264711 256) 0))) (or (and .cse0 (not .cse1) (= |P1Thread1of1ForFork1_#t~ite32_Out-1889264711| ~y$w_buff1~0_In-1889264711) (not .cse2)) (and .cse0 (or .cse1 .cse2) (= |P1Thread1of1ForFork1_#t~ite32_Out-1889264711| ~y~0_In-1889264711)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1889264711, ~y$w_buff1~0=~y$w_buff1~0_In-1889264711, ~y~0=~y~0_In-1889264711, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1889264711} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1889264711, ~y$w_buff1~0=~y$w_buff1~0_In-1889264711, P1Thread1of1ForFork1_#t~ite32=|P1Thread1of1ForFork1_#t~ite32_Out-1889264711|, P1Thread1of1ForFork1_#t~ite33=|P1Thread1of1ForFork1_#t~ite33_Out-1889264711|, ~y~0=~y~0_In-1889264711, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1889264711} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-27 20:03:12,377 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [713] [713] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In467999410 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In467999410 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite34_Out467999410| ~y$w_buff0_used~0_In467999410) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork1_#t~ite34_Out467999410| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In467999410, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In467999410} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In467999410, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In467999410, P1Thread1of1ForFork1_#t~ite34=|P1Thread1of1ForFork1_#t~ite34_Out467999410|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 20:03:12,378 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [715] [715] L778-->L778-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In-13221077 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-13221077 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-13221077 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-13221077 256) 0))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite35_Out-13221077| ~y$w_buff1_used~0_In-13221077) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork1_#t~ite35_Out-13221077| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-13221077, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-13221077, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-13221077, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-13221077} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-13221077, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-13221077, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-13221077, P1Thread1of1ForFork1_#t~ite35=|P1Thread1of1ForFork1_#t~ite35_Out-13221077|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-13221077} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 20:03:12,379 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [705] [705] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1727660151 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In-1727660151 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1727660151| ~y$r_buff0_thd2~0_In-1727660151) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite36_Out-1727660151| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1727660151, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1727660151} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1727660151, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1727660151, P1Thread1of1ForFork1_#t~ite36=|P1Thread1of1ForFork1_#t~ite36_Out-1727660151|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 20:03:12,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [702] [702] L780-->L780-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1758188258 256))) (.cse1 (= (mod ~y$r_buff1_thd2~0_In-1758188258 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd2~0_In-1758188258 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1758188258 256)))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite37_Out-1758188258|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd2~0_In-1758188258 |P1Thread1of1ForFork1_#t~ite37_Out-1758188258|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1758188258, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758188258, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1758188258, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1758188258} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1758188258, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1758188258, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1758188258, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1758188258|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1758188258} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:03:12,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L780-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_50 |v_P1Thread1of1ForFork1_#t~ite37_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_50, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|, P1Thread1of1ForFork1_#t~ite37=|v_P1Thread1of1ForFork1_#t~ite37_7|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#res.base, P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 20:03:12,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [685] [685] L801-1-->L807: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, 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 20:03:12,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~y$r_buff1_thd0~0_In1004366760 256) 0)) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In1004366760 256)))) (or (and (not .cse0) (not .cse1) (= ~y$w_buff1~0_In1004366760 |ULTIMATE.start_main_#t~ite40_Out1004366760|)) (and (or .cse0 .cse1) (= ~y~0_In1004366760 |ULTIMATE.start_main_#t~ite40_Out1004366760|)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In1004366760, ~y~0=~y~0_In1004366760, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1004366760, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1004366760} OutVars{ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1004366760|, ~y$w_buff1~0=~y$w_buff1~0_In1004366760, ~y~0=~y~0_In1004366760, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1004366760, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1004366760} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40] because there is no mapped edge [2019-12-27 20:03:12,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [682] [682] L807-4-->L808: Formula: (= v_~y~0_17 |v_ULTIMATE.start_main_#t~ite40_8|) InVars {ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_8|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_7|, ~y~0=v_~y~0_17} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite40, ~y~0] because there is no mapped edge [2019-12-27 20:03:12,381 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [716] [716] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In114492681 256))) (.cse0 (= (mod ~y$r_buff0_thd0~0_In114492681 256) 0))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out114492681| 0) (not .cse1)) (and (= ~y$w_buff0_used~0_In114492681 |ULTIMATE.start_main_#t~ite42_Out114492681|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In114492681, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In114492681} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In114492681, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In114492681, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out114492681|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 20:03:12,382 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [710] [710] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-461861189 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-461861189 256) 0)) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In-461861189 256))) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-461861189 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite43_Out-461861189| ~y$w_buff1_used~0_In-461861189)) (and (= |ULTIMATE.start_main_#t~ite43_Out-461861189| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-461861189, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-461861189, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-461861189, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-461861189} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-461861189, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-461861189, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out-461861189|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-461861189, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-461861189} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 20:03:12,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In-112440402 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-112440402 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite44_Out-112440402| 0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-112440402| ~y$r_buff0_thd0~0_In-112440402) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-112440402, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-112440402} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-112440402, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-112440402, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-112440402|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 20:03:12,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L811-->L811-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In1229180379 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In1229180379 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In1229180379 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In1229180379 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite45_Out1229180379|)) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite45_Out1229180379| ~y$r_buff1_thd0~0_In1229180379) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1229180379, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1229180379, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1229180379, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1229180379} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1229180379, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1229180379, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1229180379, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out1229180379|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1229180379} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 20:03:12,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L811-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_10 256)) (= 1 v_~__unbuffered_p1_EAX~0_8) (= v_~main$tmp_guard1~0_10 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 0 v_~__unbuffered_p0_EAX~0_10) (= |v_ULTIMATE.start_main_#t~ite45_12| v_~y$r_buff1_thd0~0_18) (= 0 v_~__unbuffered_p1_EBX~0_9)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_12|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_18, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_11|, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start_main_#t~ite45, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 20:03:12,489 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 08:03:12 BasicIcfg [2019-12-27 20:03:12,489 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 20:03:12,491 INFO L168 Benchmark]: Toolchain (without parser) took 15529.53 ms. Allocated memory was 140.0 MB in the beginning and 669.5 MB in the end (delta: 529.5 MB). Free memory was 103.3 MB in the beginning and 402.6 MB in the end (delta: -299.4 MB). Peak memory consumption was 230.2 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:12,492 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 20:03:12,492 INFO L168 Benchmark]: CACSL2BoogieTranslator took 738.31 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 102.8 MB in the beginning and 157.0 MB in the end (delta: -54.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:12,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.13 ms. Allocated memory is still 204.5 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:12,495 INFO L168 Benchmark]: Boogie Preprocessor took 39.96 ms. Allocated memory is still 204.5 MB. Free memory was 154.4 MB in the beginning and 152.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:12,499 INFO L168 Benchmark]: RCFGBuilder took 824.70 ms. Allocated memory is still 204.5 MB. Free memory was 152.5 MB in the beginning and 107.7 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:12,500 INFO L168 Benchmark]: TraceAbstraction took 13861.43 ms. Allocated memory was 204.5 MB in the beginning and 669.5 MB in the end (delta: 465.0 MB). Free memory was 107.1 MB in the beginning and 402.6 MB in the end (delta: -295.6 MB). Peak memory consumption was 169.5 MB. Max. memory is 7.1 GB. [2019-12-27 20:03:12,506 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 140.0 MB. Free memory was 123.2 MB in the beginning and 123.0 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 738.31 ms. Allocated memory was 140.0 MB in the beginning and 204.5 MB in the end (delta: 64.5 MB). Free memory was 102.8 MB in the beginning and 157.0 MB in the end (delta: -54.2 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 59.13 ms. Allocated memory is still 204.5 MB. Free memory was 157.0 MB in the beginning and 154.4 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.96 ms. Allocated memory is still 204.5 MB. Free memory was 154.4 MB in the beginning and 152.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 824.70 ms. Allocated memory is still 204.5 MB. Free memory was 152.5 MB in the beginning and 107.7 MB in the end (delta: 44.8 MB). Peak memory consumption was 44.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13861.43 ms. Allocated memory was 204.5 MB in the beginning and 669.5 MB in the end (delta: 465.0 MB). Free memory was 107.1 MB in the beginning and 402.6 MB in the end (delta: -295.6 MB). Peak memory consumption was 169.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.6s, 148 ProgramPointsBefore, 74 ProgramPointsAfterwards, 182 TransitionsBefore, 82 TransitionsAfterwards, 12056 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 31 ConcurrentYvCompositions, 29 ChoiceCompositions, 4737 VarBasedMoverChecksPositive, 159 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 49139 CheckedPairsTotal, 103 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L799] FCALL, FORK 0 pthread_create(&t313, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L726] 1 y$w_buff1 = y$w_buff0 [L727] 1 y$w_buff0 = 1 [L728] 1 y$w_buff1_used = y$w_buff0_used [L729] 1 y$w_buff0_used = (_Bool)1 [L801] FCALL, FORK 0 pthread_create(&t314, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] 2 x = 1 [L757] 2 __unbuffered_p1_EAX = x [L760] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L761] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L762] 2 y$flush_delayed = weak$$choice2 [L763] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L741] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L742] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L764] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L765] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L766] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L767] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L768] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L770] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L771] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L777] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L778] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L779] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L807] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L808] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L809] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L810] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 142 locations, 2 error locations. Result: UNSAFE, OverallTime: 13.5s, OverallIterations: 15, TraceHistogramMax: 1, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1710 SDtfs, 1726 SDslu, 4215 SDs, 0 SdLazy, 2935 SolverSat, 87 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 147 GetRequests, 52 SyntacticMatches, 23 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=8357occurred 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: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 2632 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 523 NumberOfCodeBlocks, 523 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 456 ConstructedInterpolants, 0 QuantifiedInterpolants, 58720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 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...