/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi004_tso.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:10:48,666 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:10:48,669 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:10:48,683 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:10:48,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:10:48,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:10:48,686 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:10:48,688 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:10:48,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:10:48,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:10:48,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:10:48,692 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:10:48,693 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:10:48,694 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:10:48,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:10:48,696 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:10:48,698 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:10:48,699 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:10:48,701 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:10:48,703 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:10:48,704 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:10:48,705 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:10:48,706 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:10:48,707 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:10:48,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:10:48,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:10:48,710 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:10:48,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:10:48,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:10:48,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:10:48,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:10:48,714 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:10:48,715 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:10:48,716 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:10:48,717 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:10:48,717 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:10:48,718 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:10:48,718 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:10:48,718 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:10:48,719 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:10:48,720 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:10:48,720 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-18 14:10:48,734 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:10:48,734 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:10:48,735 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:10:48,736 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:10:48,736 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:10:48,736 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:10:48,736 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:10:48,736 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:10:48,737 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:10:48,737 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:10:48,737 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:10:48,737 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:10:48,737 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:10:48,738 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:10:48,738 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:10:48,738 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:10:48,738 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:10:48,738 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:10:48,739 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:10:48,739 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:10:48,739 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:10:48,739 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:10:48,740 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:10:48,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:10:48,740 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:10:48,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:10:48,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:10:48,740 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:10:48,741 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:10:48,741 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:10:49,028 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:10:49,042 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:10:49,045 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:10:49,047 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:10:49,047 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:10:49,048 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi004_tso.oepc.i [2019-12-18 14:10:49,108 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5b815ff/a3ff3f41300d4f3db03ddda5fd1cc163/FLAGa6b537a59 [2019-12-18 14:10:49,650 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:10:49,651 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi004_tso.oepc.i [2019-12-18 14:10:49,672 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5b815ff/a3ff3f41300d4f3db03ddda5fd1cc163/FLAGa6b537a59 [2019-12-18 14:10:49,954 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a5b815ff/a3ff3f41300d4f3db03ddda5fd1cc163 [2019-12-18 14:10:49,962 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:10:49,965 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:10:49,966 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:10:49,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:10:49,971 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:10:49,972 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:10:49" (1/1) ... [2019-12-18 14:10:49,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2983cbdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:49, skipping insertion in model container [2019-12-18 14:10:49,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:10:49" (1/1) ... [2019-12-18 14:10:49,984 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:10:50,048 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:10:50,556 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:10:50,568 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:10:50,631 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:10:50,703 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:10:50,704 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:50 WrapperNode [2019-12-18 14:10:50,704 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:10:50,705 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:10:50,705 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:10:50,705 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:10:50,714 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:50" (1/1) ... [2019-12-18 14:10:50,734 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:50" (1/1) ... [2019-12-18 14:10:50,765 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:10:50,766 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:10:50,766 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:10:50,766 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:10:50,777 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:50" (1/1) ... [2019-12-18 14:10:50,777 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:50" (1/1) ... [2019-12-18 14:10:50,782 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:50" (1/1) ... [2019-12-18 14:10:50,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:50" (1/1) ... [2019-12-18 14:10:50,799 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:50" (1/1) ... [2019-12-18 14:10:50,804 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:50" (1/1) ... [2019-12-18 14:10:50,808 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:50" (1/1) ... [2019-12-18 14:10:50,813 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:10:50,815 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:10:50,815 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:10:50,815 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:10:50,816 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:10:50,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:10:50,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:10:50,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:10:50,885 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:10:50,885 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:10:50,886 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:10:50,886 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:10:50,886 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:10:50,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:10:50,886 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:10:50,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:10:50,888 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:10:51,546 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:10:51,546 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:10:51,547 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:10:51 BoogieIcfgContainer [2019-12-18 14:10:51,548 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:10:51,549 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:10:51,549 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:10:51,552 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:10:51,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:10:49" (1/3) ... [2019-12-18 14:10:51,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9bd31c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:10:51, skipping insertion in model container [2019-12-18 14:10:51,554 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:10:50" (2/3) ... [2019-12-18 14:10:51,554 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a9bd31c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:10:51, skipping insertion in model container [2019-12-18 14:10:51,555 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:10:51" (3/3) ... [2019-12-18 14:10:51,557 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi004_tso.oepc.i [2019-12-18 14:10:51,568 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:10:51,568 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:10:51,576 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:10:51,578 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:10:51,616 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,618 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,618 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,620 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,621 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,622 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,623 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,624 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,625 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,626 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,627 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,628 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,629 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,630 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,631 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,632 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,633 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,634 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,635 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,636 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,637 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,638 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,639 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,640 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,641 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,643 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,644 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,644 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,645 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,646 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,647 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,648 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,649 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,650 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,651 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,655 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,656 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,656 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,656 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,657 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,658 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,662 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,663 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:10:51,683 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 14:10:51,705 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:10:51,705 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:10:51,705 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:10:51,705 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:10:51,705 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:10:51,706 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:10:51,706 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:10:51,706 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:10:51,750 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 137 places, 165 transitions [2019-12-18 14:10:51,752 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 14:10:51,822 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 14:10:51,823 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:10:51,836 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 14:10:51,856 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 137 places, 165 transitions [2019-12-18 14:10:51,890 INFO L126 PetriNetUnfolder]: 35/163 cut-off events. [2019-12-18 14:10:51,890 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:10:51,896 INFO L76 FinitePrefix]: Finished finitePrefix Result has 170 conditions, 163 events. 35/163 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 339 event pairs. 6/132 useless extension candidates. Maximal degree in co-relation 132. Up to 2 conditions per place. [2019-12-18 14:10:51,911 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 10216 [2019-12-18 14:10:51,912 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:10:56,609 WARN L192 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 14:10:56,732 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 14:10:56,787 INFO L206 etLargeBlockEncoding]: Checked pairs total: 39043 [2019-12-18 14:10:56,787 INFO L214 etLargeBlockEncoding]: Total number of compositions: 99 [2019-12-18 14:10:56,791 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 67 places, 78 transitions [2019-12-18 14:10:57,244 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 6812 states. [2019-12-18 14:10:57,246 INFO L276 IsEmpty]: Start isEmpty. Operand 6812 states. [2019-12-18 14:10:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:10:57,254 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:57,255 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:10:57,255 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:57,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:57,262 INFO L82 PathProgramCache]: Analyzing trace with hash 679696961, now seen corresponding path program 1 times [2019-12-18 14:10:57,272 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:57,272 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136691794] [2019-12-18 14:10:57,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:57,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:57,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136691794] [2019-12-18 14:10:57,535 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:57,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:10:57,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1362258978] [2019-12-18 14:10:57,541 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:10:57,541 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:57,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:10:57,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:57,561 INFO L87 Difference]: Start difference. First operand 6812 states. Second operand 3 states. [2019-12-18 14:10:57,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:57,758 INFO L93 Difference]: Finished difference Result 6636 states and 22229 transitions. [2019-12-18 14:10:57,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:10:57,760 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:10:57,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:57,832 INFO L225 Difference]: With dead ends: 6636 [2019-12-18 14:10:57,832 INFO L226 Difference]: Without dead ends: 6246 [2019-12-18 14:10:57,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:57,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6246 states. [2019-12-18 14:10:58,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6246 to 6246. [2019-12-18 14:10:58,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6246 states. [2019-12-18 14:10:58,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6246 states to 6246 states and 20886 transitions. [2019-12-18 14:10:58,199 INFO L78 Accepts]: Start accepts. Automaton has 6246 states and 20886 transitions. Word has length 5 [2019-12-18 14:10:58,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:58,199 INFO L462 AbstractCegarLoop]: Abstraction has 6246 states and 20886 transitions. [2019-12-18 14:10:58,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:10:58,199 INFO L276 IsEmpty]: Start isEmpty. Operand 6246 states and 20886 transitions. [2019-12-18 14:10:58,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:10:58,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:58,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:58,204 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:58,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:58,204 INFO L82 PathProgramCache]: Analyzing trace with hash -113641298, now seen corresponding path program 1 times [2019-12-18 14:10:58,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:58,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793781350] [2019-12-18 14:10:58,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:58,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:58,325 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793781350] [2019-12-18 14:10:58,326 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:58,326 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:10:58,326 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441099192] [2019-12-18 14:10:58,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:10:58,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:58,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:10:58,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:10:58,328 INFO L87 Difference]: Start difference. First operand 6246 states and 20886 transitions. Second operand 4 states. [2019-12-18 14:10:58,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:58,734 INFO L93 Difference]: Finished difference Result 9424 states and 30254 transitions. [2019-12-18 14:10:58,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:10:58,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:10:58,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:58,813 INFO L225 Difference]: With dead ends: 9424 [2019-12-18 14:10:58,813 INFO L226 Difference]: Without dead ends: 9411 [2019-12-18 14:10:58,814 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:10:58,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9411 states. [2019-12-18 14:10:59,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9411 to 8307. [2019-12-18 14:10:59,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8307 states. [2019-12-18 14:10:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8307 states to 8307 states and 27132 transitions. [2019-12-18 14:10:59,157 INFO L78 Accepts]: Start accepts. Automaton has 8307 states and 27132 transitions. Word has length 11 [2019-12-18 14:10:59,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:10:59,157 INFO L462 AbstractCegarLoop]: Abstraction has 8307 states and 27132 transitions. [2019-12-18 14:10:59,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:10:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 8307 states and 27132 transitions. [2019-12-18 14:10:59,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:10:59,161 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:10:59,162 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:10:59,162 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:10:59,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:10:59,162 INFO L82 PathProgramCache]: Analyzing trace with hash 711580898, now seen corresponding path program 1 times [2019-12-18 14:10:59,163 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:10:59,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766322397] [2019-12-18 14:10:59,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:10:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:10:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:10:59,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766322397] [2019-12-18 14:10:59,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:10:59,259 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:10:59,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943807938] [2019-12-18 14:10:59,261 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:10:59,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:10:59,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:10:59,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:59,262 INFO L87 Difference]: Start difference. First operand 8307 states and 27132 transitions. Second operand 3 states. [2019-12-18 14:10:59,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:10:59,406 INFO L93 Difference]: Finished difference Result 11392 states and 37048 transitions. [2019-12-18 14:10:59,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:10:59,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-12-18 14:10:59,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:10:59,463 INFO L225 Difference]: With dead ends: 11392 [2019-12-18 14:10:59,463 INFO L226 Difference]: Without dead ends: 11392 [2019-12-18 14:10:59,464 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:10:59,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11392 states. [2019-12-18 14:11:00,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11392 to 10440. [2019-12-18 14:11:00,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10440 states. [2019-12-18 14:11:00,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10440 states to 10440 states and 34208 transitions. [2019-12-18 14:11:00,331 INFO L78 Accepts]: Start accepts. Automaton has 10440 states and 34208 transitions. Word has length 14 [2019-12-18 14:11:00,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:11:00,334 INFO L462 AbstractCegarLoop]: Abstraction has 10440 states and 34208 transitions. [2019-12-18 14:11:00,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:11:00,335 INFO L276 IsEmpty]: Start isEmpty. Operand 10440 states and 34208 transitions. [2019-12-18 14:11:00,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:11:00,338 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:11:00,338 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:11:00,339 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:11:00,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:11:00,339 INFO L82 PathProgramCache]: Analyzing trace with hash 798779155, now seen corresponding path program 1 times [2019-12-18 14:11:00,339 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:11:00,340 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593781177] [2019-12-18 14:11:00,340 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:11:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:11:00,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:11:00,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593781177] [2019-12-18 14:11:00,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:11:00,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:11:00,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540393062] [2019-12-18 14:11:00,450 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:11:00,450 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:11:00,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:11:00,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:11:00,451 INFO L87 Difference]: Start difference. First operand 10440 states and 34208 transitions. Second operand 4 states. [2019-12-18 14:11:00,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:11:00,688 INFO L93 Difference]: Finished difference Result 12648 states and 40515 transitions. [2019-12-18 14:11:00,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:11:00,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:11:00,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:11:00,732 INFO L225 Difference]: With dead ends: 12648 [2019-12-18 14:11:00,732 INFO L226 Difference]: Without dead ends: 12637 [2019-12-18 14:11:00,732 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:11:00,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12637 states. [2019-12-18 14:11:01,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12637 to 11272. [2019-12-18 14:11:01,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11272 states. [2019-12-18 14:11:01,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11272 states to 11272 states and 36643 transitions. [2019-12-18 14:11:01,189 INFO L78 Accepts]: Start accepts. Automaton has 11272 states and 36643 transitions. Word has length 14 [2019-12-18 14:11:01,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:11:01,189 INFO L462 AbstractCegarLoop]: Abstraction has 11272 states and 36643 transitions. [2019-12-18 14:11:01,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:11:01,189 INFO L276 IsEmpty]: Start isEmpty. Operand 11272 states and 36643 transitions. [2019-12-18 14:11:01,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-18 14:11:01,193 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:11:01,194 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:11:01,194 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:11:01,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:11:01,194 INFO L82 PathProgramCache]: Analyzing trace with hash -564373810, now seen corresponding path program 1 times [2019-12-18 14:11:01,195 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:11:01,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613733420] [2019-12-18 14:11:01,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:11:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:11:01,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:11:01,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613733420] [2019-12-18 14:11:01,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:11:01,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:11:01,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893481850] [2019-12-18 14:11:01,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:11:01,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:11:01,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:11:01,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:11:01,239 INFO L87 Difference]: Start difference. First operand 11272 states and 36643 transitions. Second operand 4 states. [2019-12-18 14:11:01,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:11:01,441 INFO L93 Difference]: Finished difference Result 13620 states and 43661 transitions. [2019-12-18 14:11:01,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:11:01,443 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-18 14:11:01,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:11:01,499 INFO L225 Difference]: With dead ends: 13620 [2019-12-18 14:11:01,499 INFO L226 Difference]: Without dead ends: 13607 [2019-12-18 14:11:01,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:11:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13607 states. [2019-12-18 14:11:01,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13607 to 11607. [2019-12-18 14:11:01,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11607 states. [2019-12-18 14:11:02,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11607 states to 11607 states and 37707 transitions. [2019-12-18 14:11:02,128 INFO L78 Accepts]: Start accepts. Automaton has 11607 states and 37707 transitions. Word has length 14 [2019-12-18 14:11:02,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:11:02,129 INFO L462 AbstractCegarLoop]: Abstraction has 11607 states and 37707 transitions. [2019-12-18 14:11:02,129 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:11:02,129 INFO L276 IsEmpty]: Start isEmpty. Operand 11607 states and 37707 transitions. [2019-12-18 14:11:02,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 14:11:02,134 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:11:02,134 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:11:02,134 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:11:02,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:11:02,135 INFO L82 PathProgramCache]: Analyzing trace with hash 833908596, now seen corresponding path program 1 times [2019-12-18 14:11:02,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:11:02,135 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597348762] [2019-12-18 14:11:02,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:11:02,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:11:02,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-18 14:11:02,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597348762] [2019-12-18 14:11:02,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:11:02,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:11:02,174 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712279635] [2019-12-18 14:11:02,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:11:02,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:11:02,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:11:02,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:11:02,175 INFO L87 Difference]: Start difference. First operand 11607 states and 37707 transitions. Second operand 3 states. [2019-12-18 14:11:02,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:11:02,230 INFO L93 Difference]: Finished difference Result 11464 states and 37241 transitions. [2019-12-18 14:11:02,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:11:02,230 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-18 14:11:02,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:11:02,256 INFO L225 Difference]: With dead ends: 11464 [2019-12-18 14:11:02,256 INFO L226 Difference]: Without dead ends: 11464 [2019-12-18 14:11:02,257 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:11:02,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11464 states. [2019-12-18 14:11:02,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11464 to 11464. [2019-12-18 14:11:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11464 states. [2019-12-18 14:11:02,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11464 states to 11464 states and 37241 transitions. [2019-12-18 14:11:02,565 INFO L78 Accepts]: Start accepts. Automaton has 11464 states and 37241 transitions. Word has length 16 [2019-12-18 14:11:02,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:11:02,565 INFO L462 AbstractCegarLoop]: Abstraction has 11464 states and 37241 transitions. [2019-12-18 14:11:02,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:11:02,566 INFO L276 IsEmpty]: Start isEmpty. Operand 11464 states and 37241 transitions. [2019-12-18 14:11:02,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 14:11:02,572 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:11:02,573 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:11:02,573 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:11:02,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:11:02,573 INFO L82 PathProgramCache]: Analyzing trace with hash 89165451, now seen corresponding path program 1 times [2019-12-18 14:11:02,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:11:02,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946376826] [2019-12-18 14:11:02,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:11:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:11:02,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:11:02,641 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946376826] [2019-12-18 14:11:02,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:11:02,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:11:02,642 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109185011] [2019-12-18 14:11:02,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:11:02,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:11:02,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:11:02,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:11:02,643 INFO L87 Difference]: Start difference. First operand 11464 states and 37241 transitions. Second operand 4 states. [2019-12-18 14:11:02,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:11:02,684 INFO L93 Difference]: Finished difference Result 2504 states and 6586 transitions. [2019-12-18 14:11:02,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:11:02,685 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-18 14:11:02,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:11:02,689 INFO L225 Difference]: With dead ends: 2504 [2019-12-18 14:11:02,689 INFO L226 Difference]: Without dead ends: 1773 [2019-12-18 14:11:02,689 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:11:02,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2019-12-18 14:11:02,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1773. [2019-12-18 14:11:02,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1773 states. [2019-12-18 14:11:02,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 4286 transitions. [2019-12-18 14:11:02,720 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 4286 transitions. Word has length 17 [2019-12-18 14:11:02,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:11:02,720 INFO L462 AbstractCegarLoop]: Abstraction has 1773 states and 4286 transitions. [2019-12-18 14:11:02,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:11:02,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 4286 transitions. [2019-12-18 14:11:02,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 14:11:02,724 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:11:02,724 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:11:02,724 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:11:02,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:11:02,724 INFO L82 PathProgramCache]: Analyzing trace with hash -375021524, now seen corresponding path program 1 times [2019-12-18 14:11:02,725 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:11:02,725 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322465546] [2019-12-18 14:11:02,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:11:02,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:11:02,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-18 14:11:02,797 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322465546] [2019-12-18 14:11:02,797 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:11:02,798 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:11:02,798 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206230757] [2019-12-18 14:11:02,798 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:11:02,799 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:11:02,799 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:11:02,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:11:02,799 INFO L87 Difference]: Start difference. First operand 1773 states and 4286 transitions. Second operand 5 states. [2019-12-18 14:11:02,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:11:02,990 INFO L93 Difference]: Finished difference Result 2369 states and 5653 transitions. [2019-12-18 14:11:02,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:11:02,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 14:11:02,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:11:02,994 INFO L225 Difference]: With dead ends: 2369 [2019-12-18 14:11:02,994 INFO L226 Difference]: Without dead ends: 2367 [2019-12-18 14:11:02,995 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:11:03,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2367 states. [2019-12-18 14:11:03,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2367 to 1883. [2019-12-18 14:11:03,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1883 states. [2019-12-18 14:11:03,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1883 states to 1883 states and 4545 transitions. [2019-12-18 14:11:03,031 INFO L78 Accepts]: Start accepts. Automaton has 1883 states and 4545 transitions. Word has length 26 [2019-12-18 14:11:03,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:11:03,031 INFO L462 AbstractCegarLoop]: Abstraction has 1883 states and 4545 transitions. [2019-12-18 14:11:03,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:11:03,032 INFO L276 IsEmpty]: Start isEmpty. Operand 1883 states and 4545 transitions. [2019-12-18 14:11:03,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-18 14:11:03,035 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:11:03,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:11:03,037 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:11:03,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:11:03,038 INFO L82 PathProgramCache]: Analyzing trace with hash -673024853, now seen corresponding path program 1 times [2019-12-18 14:11:03,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:11:03,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499487753] [2019-12-18 14:11:03,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:11:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:11:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:11:03,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499487753] [2019-12-18 14:11:03,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:11:03,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:11:03,138 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677885870] [2019-12-18 14:11:03,138 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:11:03,138 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:11:03,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:11:03,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:11:03,139 INFO L87 Difference]: Start difference. First operand 1883 states and 4545 transitions. Second operand 5 states. [2019-12-18 14:11:03,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:11:03,652 INFO L93 Difference]: Finished difference Result 2691 states and 6378 transitions. [2019-12-18 14:11:03,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:11:03,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2019-12-18 14:11:03,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:11:03,656 INFO L225 Difference]: With dead ends: 2691 [2019-12-18 14:11:03,657 INFO L226 Difference]: Without dead ends: 2691 [2019-12-18 14:11:03,657 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:11:03,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2691 states. [2019-12-18 14:11:03,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2691 to 2271. [2019-12-18 14:11:03,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2271 states. [2019-12-18 14:11:03,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2271 states to 2271 states and 5420 transitions. [2019-12-18 14:11:03,696 INFO L78 Accepts]: Start accepts. Automaton has 2271 states and 5420 transitions. Word has length 26 [2019-12-18 14:11:03,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:11:03,696 INFO L462 AbstractCegarLoop]: Abstraction has 2271 states and 5420 transitions. [2019-12-18 14:11:03,696 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:11:03,696 INFO L276 IsEmpty]: Start isEmpty. Operand 2271 states and 5420 transitions. [2019-12-18 14:11:03,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:11:03,701 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:11:03,702 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-18 14:11:03,702 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:11:03,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:11:03,702 INFO L82 PathProgramCache]: Analyzing trace with hash 427469221, now seen corresponding path program 1 times [2019-12-18 14:11:03,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:11:03,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405980662] [2019-12-18 14:11:03,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:11:03,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:11:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:11:03,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405980662] [2019-12-18 14:11:03,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:11:03,764 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:11:03,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663549072] [2019-12-18 14:11:03,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:11:03,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:11:03,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:11:03,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:11:03,765 INFO L87 Difference]: Start difference. First operand 2271 states and 5420 transitions. Second operand 5 states. [2019-12-18 14:11:03,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:11:03,966 INFO L93 Difference]: Finished difference Result 2790 states and 6588 transitions. [2019-12-18 14:11:03,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:11:03,966 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 14:11:03,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:11:03,972 INFO L225 Difference]: With dead ends: 2790 [2019-12-18 14:11:03,972 INFO L226 Difference]: Without dead ends: 2788 [2019-12-18 14:11:03,972 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:11:03,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2788 states. [2019-12-18 14:11:04,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2788 to 2211. [2019-12-18 14:11:04,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2211 states. [2019-12-18 14:11:04,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2211 states to 2211 states and 5271 transitions. [2019-12-18 14:11:04,009 INFO L78 Accepts]: Start accepts. Automaton has 2211 states and 5271 transitions. Word has length 27 [2019-12-18 14:11:04,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:11:04,010 INFO L462 AbstractCegarLoop]: Abstraction has 2211 states and 5271 transitions. [2019-12-18 14:11:04,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:11:04,010 INFO L276 IsEmpty]: Start isEmpty. Operand 2211 states and 5271 transitions. [2019-12-18 14:11:04,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-18 14:11:04,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:11:04,016 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-18 14:11:04,016 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:11:04,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:11:04,017 INFO L82 PathProgramCache]: Analyzing trace with hash 225506980, now seen corresponding path program 1 times [2019-12-18 14:11:04,017 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:11:04,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639117547] [2019-12-18 14:11:04,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:11:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:11:04,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:11:04,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639117547] [2019-12-18 14:11:04,150 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:11:04,150 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:11:04,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497317163] [2019-12-18 14:11:04,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:11:04,152 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:11:04,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:11:04,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:11:04,153 INFO L87 Difference]: Start difference. First operand 2211 states and 5271 transitions. Second operand 5 states. [2019-12-18 14:11:04,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:11:04,220 INFO L93 Difference]: Finished difference Result 1251 states and 2791 transitions. [2019-12-18 14:11:04,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:11:04,221 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2019-12-18 14:11:04,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:11:04,222 INFO L225 Difference]: With dead ends: 1251 [2019-12-18 14:11:04,222 INFO L226 Difference]: Without dead ends: 1109 [2019-12-18 14:11:04,223 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-18 14:11:04,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2019-12-18 14:11:04,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 989. [2019-12-18 14:11:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 989 states. [2019-12-18 14:11:04,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 2218 transitions. [2019-12-18 14:11:04,234 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 2218 transitions. Word has length 27 [2019-12-18 14:11:04,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:11:04,234 INFO L462 AbstractCegarLoop]: Abstraction has 989 states and 2218 transitions. [2019-12-18 14:11:04,234 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:11:04,234 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 2218 transitions. [2019-12-18 14:11:04,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:11:04,237 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:11:04,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:11:04,238 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:11:04,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:11:04,238 INFO L82 PathProgramCache]: Analyzing trace with hash 1687726867, now seen corresponding path program 1 times [2019-12-18 14:11:04,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:11:04,238 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6339782] [2019-12-18 14:11:04,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:11:04,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:11:04,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:11:04,302 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6339782] [2019-12-18 14:11:04,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:11:04,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:11:04,303 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56445265] [2019-12-18 14:11:04,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:11:04,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:11:04,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:11:04,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:11:04,304 INFO L87 Difference]: Start difference. First operand 989 states and 2218 transitions. Second operand 6 states. [2019-12-18 14:11:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:11:04,528 INFO L93 Difference]: Finished difference Result 2445 states and 5362 transitions. [2019-12-18 14:11:04,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:11:04,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 14:11:04,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:11:04,531 INFO L225 Difference]: With dead ends: 2445 [2019-12-18 14:11:04,532 INFO L226 Difference]: Without dead ends: 1624 [2019-12-18 14:11:04,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:11:04,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2019-12-18 14:11:04,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1064. [2019-12-18 14:11:04,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1064 states. [2019-12-18 14:11:04,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1064 states to 1064 states and 2384 transitions. [2019-12-18 14:11:04,550 INFO L78 Accepts]: Start accepts. Automaton has 1064 states and 2384 transitions. Word has length 41 [2019-12-18 14:11:04,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:11:04,550 INFO L462 AbstractCegarLoop]: Abstraction has 1064 states and 2384 transitions. [2019-12-18 14:11:04,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:11:04,550 INFO L276 IsEmpty]: Start isEmpty. Operand 1064 states and 2384 transitions. [2019-12-18 14:11:04,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:11:04,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:11:04,553 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:11:04,554 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:11:04,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:11:04,554 INFO L82 PathProgramCache]: Analyzing trace with hash -2071793039, now seen corresponding path program 2 times [2019-12-18 14:11:04,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:11:04,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29171152] [2019-12-18 14:11:04,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:11:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:11:04,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:11:04,618 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29171152] [2019-12-18 14:11:04,619 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:11:04,619 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:11:04,619 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196535239] [2019-12-18 14:11:04,620 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:11:04,620 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:11:04,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:11:04,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:11:04,620 INFO L87 Difference]: Start difference. First operand 1064 states and 2384 transitions. Second operand 4 states. [2019-12-18 14:11:04,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:11:04,643 INFO L93 Difference]: Finished difference Result 1833 states and 4110 transitions. [2019-12-18 14:11:04,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:11:04,643 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-12-18 14:11:04,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:11:04,644 INFO L225 Difference]: With dead ends: 1833 [2019-12-18 14:11:04,645 INFO L226 Difference]: Without dead ends: 797 [2019-12-18 14:11:04,646 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:11:04,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 797 states. [2019-12-18 14:11:04,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 797 to 797. [2019-12-18 14:11:04,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-12-18 14:11:04,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1774 transitions. [2019-12-18 14:11:04,657 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1774 transitions. Word has length 41 [2019-12-18 14:11:04,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:11:04,657 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1774 transitions. [2019-12-18 14:11:04,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:11:04,657 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1774 transitions. [2019-12-18 14:11:04,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:11:04,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:11:04,660 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:11:04,660 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:11:04,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:11:04,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1825813411, now seen corresponding path program 3 times [2019-12-18 14:11:04,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:11:04,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247721588] [2019-12-18 14:11:04,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:11:04,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:11:04,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:11:04,752 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247721588] [2019-12-18 14:11:04,752 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:11:04,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:11:04,753 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773511635] [2019-12-18 14:11:04,753 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:11:04,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:11:04,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:11:04,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:11:04,754 INFO L87 Difference]: Start difference. First operand 797 states and 1774 transitions. Second operand 7 states. [2019-12-18 14:11:04,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:11:04,915 INFO L93 Difference]: Finished difference Result 1250 states and 2717 transitions. [2019-12-18 14:11:04,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 14:11:04,915 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2019-12-18 14:11:04,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:11:04,917 INFO L225 Difference]: With dead ends: 1250 [2019-12-18 14:11:04,917 INFO L226 Difference]: Without dead ends: 829 [2019-12-18 14:11:04,917 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-18 14:11:04,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 829 states. [2019-12-18 14:11:04,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 829 to 785. [2019-12-18 14:11:04,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 785 states. [2019-12-18 14:11:04,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1748 transitions. [2019-12-18 14:11:04,928 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1748 transitions. Word has length 41 [2019-12-18 14:11:04,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:11:04,929 INFO L462 AbstractCegarLoop]: Abstraction has 785 states and 1748 transitions. [2019-12-18 14:11:04,929 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:11:04,929 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1748 transitions. [2019-12-18 14:11:04,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:11:04,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:11:04,931 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:11:04,931 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:11:04,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:11:04,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1484678691, now seen corresponding path program 4 times [2019-12-18 14:11:04,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:11:04,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219747378] [2019-12-18 14:11:04,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:11:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:11:05,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:11:05,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219747378] [2019-12-18 14:11:05,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:11:05,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:11:05,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868229433] [2019-12-18 14:11:05,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:11:05,125 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:11:05,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:11:05,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:11:05,126 INFO L87 Difference]: Start difference. First operand 785 states and 1748 transitions. Second operand 6 states. [2019-12-18 14:11:05,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:11:05,490 INFO L93 Difference]: Finished difference Result 908 states and 1993 transitions. [2019-12-18 14:11:05,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:11:05,491 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2019-12-18 14:11:05,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:11:05,492 INFO L225 Difference]: With dead ends: 908 [2019-12-18 14:11:05,492 INFO L226 Difference]: Without dead ends: 908 [2019-12-18 14:11:05,492 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:11:05,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2019-12-18 14:11:05,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 791. [2019-12-18 14:11:05,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2019-12-18 14:11:05,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 1759 transitions. [2019-12-18 14:11:05,502 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 1759 transitions. Word has length 41 [2019-12-18 14:11:05,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:11:05,503 INFO L462 AbstractCegarLoop]: Abstraction has 791 states and 1759 transitions. [2019-12-18 14:11:05,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:11:05,503 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 1759 transitions. [2019-12-18 14:11:05,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-18 14:11:05,505 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:11:05,505 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:11:05,505 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:11:05,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:11:05,506 INFO L82 PathProgramCache]: Analyzing trace with hash 577447219, now seen corresponding path program 5 times [2019-12-18 14:11:05,506 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:11:05,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71315200] [2019-12-18 14:11:05,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:11:05,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:11:05,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:11:05,561 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71315200] [2019-12-18 14:11:05,562 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:11:05,562 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:11:05,562 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360635373] [2019-12-18 14:11:05,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:11:05,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:11:05,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:11:05,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:11:05,563 INFO L87 Difference]: Start difference. First operand 791 states and 1759 transitions. Second operand 3 states. [2019-12-18 14:11:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:11:05,575 INFO L93 Difference]: Finished difference Result 789 states and 1754 transitions. [2019-12-18 14:11:05,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:11:05,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-18 14:11:05,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:11:05,577 INFO L225 Difference]: With dead ends: 789 [2019-12-18 14:11:05,577 INFO L226 Difference]: Without dead ends: 789 [2019-12-18 14:11:05,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:11:05,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-12-18 14:11:05,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 697. [2019-12-18 14:11:05,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 697 states. [2019-12-18 14:11:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 697 states to 697 states and 1570 transitions. [2019-12-18 14:11:05,587 INFO L78 Accepts]: Start accepts. Automaton has 697 states and 1570 transitions. Word has length 41 [2019-12-18 14:11:05,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:11:05,587 INFO L462 AbstractCegarLoop]: Abstraction has 697 states and 1570 transitions. [2019-12-18 14:11:05,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:11:05,588 INFO L276 IsEmpty]: Start isEmpty. Operand 697 states and 1570 transitions. [2019-12-18 14:11:05,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-18 14:11:05,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:11:05,589 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:11:05,589 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:11:05,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:11:05,590 INFO L82 PathProgramCache]: Analyzing trace with hash -1605159892, now seen corresponding path program 1 times [2019-12-18 14:11:05,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:11:05,590 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346852977] [2019-12-18 14:11:05,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:11:05,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:11:05,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:11:05,712 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:11:05,712 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:11:05,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [686] [686] ULTIMATE.startENTRY-->L802: Formula: (let ((.cse0 (store |v_#valid_40| 0 0))) (and (= 0 v_~y$read_delayed_var~0.base_6) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$w_buff0~0_571) (= v_~z~0_33 0) (= 0 v_~y$r_buff0_thd2~0_124) (= 0 v_~y$flush_delayed~0_47) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_56 0) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_321 0) (= 0 v_~__unbuffered_p0_EAX~0_60) (= v_~weak$$choice2~0_156 0) (= v_~y~0_145 0) (= v_~y$w_buff1_used~0_548 0) (= 0 |v_ULTIMATE.start_main_~#t1661~0.offset_17|) (= v_~main$tmp_guard1~0_30 0) (= 0 v_~__unbuffered_cnt~0_85) (= v_~y$r_buff1_thd0~0_115 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1661~0.base_19| 4)) (= v_~y$r_buff1_thd1~0_238 0) (= v_~y$mem_tmp~0_18 0) (= 0 v_~y$r_buff1_thd2~0_86) (= (store .cse0 |v_ULTIMATE.start_main_~#t1661~0.base_19| 1) |v_#valid_38|) (= v_~y$w_buff0_used~0_794 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice0~0_11) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1661~0.base_19|) (= v_~y$r_buff0_thd0~0_127 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1661~0.base_19| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1661~0.base_19|) |v_ULTIMATE.start_main_~#t1661~0.offset_17| 0)) |v_#memory_int_11|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1661~0.base_19|) 0) (= v_~main$tmp_guard0~0_32 0) (= 0 v_~__unbuffered_p1_EAX~0_56) (= 0 v_~y$read_delayed_var~0.offset_6) (= v_~x~0_36 0) (= v_~y$w_buff1~0_385 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_12|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_9|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_6, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_794, ULTIMATE.start_main_#t~nondet33=|v_ULTIMATE.start_main_#t~nondet33_15|, #NULL.offset=|v_#NULL.offset_6|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_30, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_238, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_60, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_56, ~y$w_buff0~0=v_~y$w_buff0~0_571, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_321, ~y$flush_delayed~0=v_~y$flush_delayed~0_47, #length=|v_#length_13|, ~y~0=v_~y~0_145, ULTIMATE.start_main_~#t1662~0.offset=|v_ULTIMATE.start_main_~#t1662~0.offset_17|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_56, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_68|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_33|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_86|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_44|, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_120|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_32, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_~#t1661~0.base=|v_ULTIMATE.start_main_~#t1661~0.base_19|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_44|, ULTIMATE.start_main_~#t1661~0.offset=|v_ULTIMATE.start_main_~#t1661~0.offset_17|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_86, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ~y$w_buff1~0=v_~y$w_buff1~0_385, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_23|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_127, #valid=|v_#valid_38|, ULTIMATE.start_main_~#t1662~0.base=|v_ULTIMATE.start_main_~#t1662~0.base_22|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_124, #memory_int=|v_#memory_int_11|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_85, ~z~0=v_~z~0_33, ~weak$$choice2~0=v_~weak$$choice2~0_156, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_115, ~x~0=v_~x~0_36, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_548} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet33, #NULL.offset, ~main$tmp_guard1~0, ~y$read_delayed~0, ~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, ULTIMATE.start_main_~#t1662~0.offset, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_#t~ite37, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_~#t1661~0.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_~#t1661~0.offset, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ULTIMATE.start_main_~#t1662~0.base, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ~z~0, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 14:11:05,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L802-1-->L804: Formula: (and (= 0 (select |v_#valid_20| |v_ULTIMATE.start_main_~#t1662~0.base_9|)) (< |v_#StackHeapBarrier_7| |v_ULTIMATE.start_main_~#t1662~0.base_9|) (not (= 0 |v_ULTIMATE.start_main_~#t1662~0.base_9|)) (= |v_#memory_int_7| (store |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1662~0.base_9| (store (select |v_#memory_int_8| |v_ULTIMATE.start_main_~#t1662~0.base_9|) |v_ULTIMATE.start_main_~#t1662~0.offset_8| 1))) (= |v_ULTIMATE.start_main_~#t1662~0.offset_8| 0) (= |v_#valid_19| (store |v_#valid_20| |v_ULTIMATE.start_main_~#t1662~0.base_9| 1)) (= (store |v_#length_10| |v_ULTIMATE.start_main_~#t1662~0.base_9| 4) |v_#length_9|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_7|, #valid=|v_#valid_20|, #memory_int=|v_#memory_int_8|, #length=|v_#length_10|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_7|, ULTIMATE.start_main_#t~nondet32=|v_ULTIMATE.start_main_#t~nondet32_4|, ULTIMATE.start_main_~#t1662~0.offset=|v_ULTIMATE.start_main_~#t1662~0.offset_8|, ULTIMATE.start_main_~#t1662~0.base=|v_ULTIMATE.start_main_~#t1662~0.base_9|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_7|, #length=|v_#length_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet32, ULTIMATE.start_main_~#t1662~0.offset, ULTIMATE.start_main_~#t1662~0.base, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 14:11:05,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [621] [621] L5-->L779: Formula: (and (not (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_76 0)) (= v_~z~0_12 1) (= v_~y$r_buff0_thd2~0_57 v_~y$r_buff1_thd2~0_35) (= v_~y$r_buff0_thd0~0_50 v_~y$r_buff1_thd0~0_31) (= v_~y$r_buff0_thd1~0_125 v_~y$r_buff1_thd1~0_69) (= v_~__unbuffered_p1_EBX~0_15 v_~x~0_14) (= v_~y$r_buff0_thd2~0_56 1) (= v_~z~0_12 v_~__unbuffered_p1_EAX~0_15)) InVars {P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_76, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_57, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~x~0=v_~x~0_14} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_35, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_69, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_76, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_15, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_50, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_56, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_125, ~z~0=v_~z~0_12, ~x~0=v_~x~0_14, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_31} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, ~y$r_buff1_thd1~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd2~0, ~z~0, ~y$r_buff1_thd0~0] because there is no mapped edge [2019-12-18 14:11:05,722 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [641] [641] L780-->L780-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-789856435 256) 0)) (.cse1 (= (mod ~y$w_buff0_used~0_In-789856435 256) 0))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-789856435| 0) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork0_#t~ite28_Out-789856435| ~y$w_buff0_used~0_In-789856435)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-789856435, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-789856435} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-789856435, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-789856435, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-789856435|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-18 14:11:05,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [629] [629] L781-->L781-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In960714137 256))) (.cse0 (= (mod ~y$r_buff0_thd2~0_In960714137 256) 0)) (.cse2 (= (mod ~y$w_buff1_used~0_In960714137 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In960714137 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite29_Out960714137| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= |P1Thread1of1ForFork0_#t~ite29_Out960714137| ~y$w_buff1_used~0_In960714137) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In960714137, ~y$w_buff0_used~0=~y$w_buff0_used~0_In960714137, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In960714137, ~y$w_buff1_used~0=~y$w_buff1_used~0_In960714137} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In960714137, ~y$w_buff0_used~0=~y$w_buff0_used~0_In960714137, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In960714137, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out960714137|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In960714137} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-18 14:11:05,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [640] [640] L782-->L783: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In-1365526393 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1365526393 256)))) (or (and (= ~y$r_buff0_thd2~0_In-1365526393 ~y$r_buff0_thd2~0_Out-1365526393) (or .cse0 .cse1)) (and (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out-1365526393) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1365526393, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1365526393} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1365526393, P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1365526393|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1365526393} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:11:05,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L742-->L742-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In336329177 256)))) (or (and .cse0 (= ~y$w_buff1_used~0_In336329177 |P0Thread1of1ForFork1_#t~ite17_Out336329177|) (= |P0Thread1of1ForFork1_#t~ite18_Out336329177| |P0Thread1of1ForFork1_#t~ite17_Out336329177|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In336329177 256)))) (or (= (mod ~y$w_buff0_used~0_In336329177 256) 0) (and .cse1 (= (mod ~y$r_buff1_thd1~0_In336329177 256) 0)) (and .cse1 (= (mod ~y$w_buff1_used~0_In336329177 256) 0))))) (and (= ~y$w_buff1_used~0_In336329177 |P0Thread1of1ForFork1_#t~ite18_Out336329177|) (= |P0Thread1of1ForFork1_#t~ite17_In336329177| |P0Thread1of1ForFork1_#t~ite17_Out336329177|) (not .cse0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In336329177, ~y$w_buff0_used~0=~y$w_buff0_used~0_In336329177, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In336329177, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_In336329177|, ~weak$$choice2~0=~weak$$choice2~0_In336329177, ~y$w_buff1_used~0=~y$w_buff1_used~0_In336329177} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In336329177, ~y$w_buff0_used~0=~y$w_buff0_used~0_In336329177, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In336329177, P0Thread1of1ForFork1_#t~ite18=|P0Thread1of1ForFork1_#t~ite18_Out336329177|, P0Thread1of1ForFork1_#t~ite17=|P0Thread1of1ForFork1_#t~ite17_Out336329177|, ~weak$$choice2~0=~weak$$choice2~0_In336329177, ~y$w_buff1_used~0=~y$w_buff1_used~0_In336329177} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite18, P0Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 14:11:05,727 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [609] [609] L743-->L744: Formula: (and (= v_~y$r_buff0_thd1~0_97 v_~y$r_buff0_thd1~0_96) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_97, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork1_#t~ite21=|v_P0Thread1of1ForFork1_#t~ite21_7|, P0Thread1of1ForFork1_#t~ite20=|v_P0Thread1of1ForFork1_#t~ite20_14|, P0Thread1of1ForFork1_#t~ite19=|v_P0Thread1of1ForFork1_#t~ite19_15|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_96, ~weak$$choice2~0=v_~weak$$choice2~0_29} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite21, P0Thread1of1ForFork1_#t~ite20, P0Thread1of1ForFork1_#t~ite19, ~y$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 14:11:05,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [599] [599] L746-->L754: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= v_~y~0_27 v_~y$mem_tmp~0_4) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_4, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_4, P0Thread1of1ForFork1_#t~ite25=|v_P0Thread1of1ForFork1_#t~ite25_11|, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, ~y~0=v_~y~0_27} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite25, ~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-18 14:11:05,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [639] [639] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff0_used~0_In931058655 256))) (.cse1 (= (mod ~y$r_buff0_thd2~0_In931058655 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In931058655 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In931058655 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out931058655|)) (and (= ~y$r_buff1_thd2~0_In931058655 |P1Thread1of1ForFork0_#t~ite31_Out931058655|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In931058655, ~y$w_buff0_used~0=~y$w_buff0_used~0_In931058655, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In931058655, ~y$w_buff1_used~0=~y$w_buff1_used~0_In931058655} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In931058655, ~y$w_buff0_used~0=~y$w_buff0_used~0_In931058655, P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out931058655|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In931058655, ~y$w_buff1_used~0=~y$w_buff1_used~0_In931058655} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-18 14:11:05,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [660] [660] L783-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork0_#t~ite31_34| v_~y$r_buff1_thd2~0_51) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_54 1) v_~__unbuffered_cnt~0_53) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_34|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_51, P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_33|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_53, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork0_#t~ite31, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-18 14:11:05,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [581] [581] L808-->L810-2: Formula: (and (or (= (mod v_~y$w_buff0_used~0_97 256) 0) (= 0 (mod v_~y$r_buff0_thd0~0_21 256))) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_97, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_21, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-18 14:11:05,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [645] [645] L810-2-->L810-4: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1764024512 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In-1764024512 256) 0))) (or (and (or .cse0 .cse1) (= ~y~0_In-1764024512 |ULTIMATE.start_main_#t~ite34_Out-1764024512|)) (and (not .cse0) (not .cse1) (= |ULTIMATE.start_main_#t~ite34_Out-1764024512| ~y$w_buff1~0_In-1764024512)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1764024512, ~y~0=~y~0_In-1764024512, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1764024512, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1764024512} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1764024512, ~y~0=~y~0_In-1764024512, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1764024512, ULTIMATE.start_main_#t~ite34=|ULTIMATE.start_main_#t~ite34_Out-1764024512|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1764024512} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 14:11:05,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [569] [569] L810-4-->L811: Formula: (= v_~y~0_15 |v_ULTIMATE.start_main_#t~ite34_7|) InVars {ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_7|} OutVars{ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_6|, ~y~0=v_~y~0_15, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite35, ~y~0, ULTIMATE.start_main_#t~ite34] because there is no mapped edge [2019-12-18 14:11:05,730 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [635] [635] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-159675054 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-159675054 256)))) (or (and (not .cse0) (= |ULTIMATE.start_main_#t~ite36_Out-159675054| 0) (not .cse1)) (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite36_Out-159675054| ~y$w_buff0_used~0_In-159675054)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-159675054, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-159675054} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-159675054, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-159675054, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out-159675054|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36] because there is no mapped edge [2019-12-18 14:11:05,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [634] [634] L812-->L812-2: Formula: (let ((.cse2 (= 0 (mod ~y$r_buff1_thd0~0_In1217886057 256))) (.cse3 (= 0 (mod ~y$w_buff1_used~0_In1217886057 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1217886057 256))) (.cse1 (= (mod ~y$r_buff0_thd0~0_In1217886057 256) 0))) (or (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1217886057 |ULTIMATE.start_main_#t~ite37_Out1217886057|) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite37_Out1217886057|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1217886057, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1217886057, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1217886057, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1217886057} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1217886057, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1217886057, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1217886057|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In1217886057, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1217886057} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-18 14:11:05,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [644] [644] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1482396458 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1482396458 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1482396458| ~y$r_buff0_thd0~0_In-1482396458)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite38_Out-1482396458| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1482396458, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1482396458} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1482396458, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1482396458, ULTIMATE.start_main_#t~ite38=|ULTIMATE.start_main_#t~ite38_Out-1482396458|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite38] because there is no mapped edge [2019-12-18 14:11:05,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [631] [631] L814-->L814-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In-2131578864 256) 0)) (.cse2 (= 0 (mod ~y$r_buff0_thd0~0_In-2131578864 256))) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In-2131578864 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-2131578864 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite39_Out-2131578864|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~y$r_buff1_thd0~0_In-2131578864 |ULTIMATE.start_main_#t~ite39_Out-2131578864|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2131578864, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2131578864, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2131578864, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2131578864} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2131578864, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out-2131578864|, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2131578864, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-2131578864, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2131578864} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-18 14:11:05,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [671] [671] L814-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_15 0) (= 1 v_~__unbuffered_p1_EAX~0_32) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13| (mod v_~main$tmp_guard1~0_15 256)) (= v_~__unbuffered_p1_EBX~0_32 0) (= 0 v_~__unbuffered_p0_EAX~0_40) (= |v_ULTIMATE.start_main_#t~ite39_34| v_~y$r_buff1_thd0~0_70)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_34|} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_40, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_32, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_33|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_70, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite39, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:11:05,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:11:05 BasicIcfg [2019-12-18 14:11:05,813 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:11:05,815 INFO L168 Benchmark]: Toolchain (without parser) took 15850.55 ms. Allocated memory was 145.2 MB in the beginning and 731.4 MB in the end (delta: 586.2 MB). Free memory was 101.4 MB in the beginning and 408.2 MB in the end (delta: -306.9 MB). Peak memory consumption was 279.3 MB. Max. memory is 7.1 GB. [2019-12-18 14:11:05,815 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 14:11:05,816 INFO L168 Benchmark]: CACSL2BoogieTranslator took 738.64 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.0 MB in the beginning and 157.4 MB in the end (delta: -56.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-18 14:11:05,817 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.06 ms. Allocated memory is still 202.4 MB. Free memory was 156.7 MB in the beginning and 154.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:11:05,818 INFO L168 Benchmark]: Boogie Preprocessor took 48.00 ms. Allocated memory is still 202.4 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:11:05,818 INFO L168 Benchmark]: RCFGBuilder took 733.32 ms. Allocated memory is still 202.4 MB. Free memory was 152.1 MB in the beginning and 110.9 MB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 7.1 GB. [2019-12-18 14:11:05,819 INFO L168 Benchmark]: TraceAbstraction took 14263.96 ms. Allocated memory was 202.4 MB in the beginning and 731.4 MB in the end (delta: 529.0 MB). Free memory was 110.9 MB in the beginning and 408.2 MB in the end (delta: -297.3 MB). Peak memory consumption was 231.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:11:05,823 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.22 ms. Allocated memory is still 145.2 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 738.64 ms. Allocated memory was 145.2 MB in the beginning and 202.4 MB in the end (delta: 57.1 MB). Free memory was 101.0 MB in the beginning and 157.4 MB in the end (delta: -56.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.06 ms. Allocated memory is still 202.4 MB. Free memory was 156.7 MB in the beginning and 154.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.00 ms. Allocated memory is still 202.4 MB. Free memory was 154.8 MB in the beginning and 152.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 733.32 ms. Allocated memory is still 202.4 MB. Free memory was 152.1 MB in the beginning and 110.9 MB in the end (delta: 41.2 MB). Peak memory consumption was 41.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14263.96 ms. Allocated memory was 202.4 MB in the beginning and 731.4 MB in the end (delta: 529.0 MB). Free memory was 110.9 MB in the beginning and 408.2 MB in the end (delta: -297.3 MB). Peak memory consumption was 231.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.0s, 137 ProgramPointsBefore, 67 ProgramPointsAfterwards, 165 TransitionsBefore, 78 TransitionsAfterwards, 10216 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 27 ConcurrentYvCompositions, 20 ChoiceCompositions, 4326 VarBasedMoverChecksPositive, 213 VarBasedMoverChecksNegative, 84 SemBasedMoverChecksPositive, 180 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 39043 CheckedPairsTotal, 99 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L802] FCALL, FORK 0 pthread_create(&t1661, ((void *)0), P0, ((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=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L804] FCALL, FORK 0 pthread_create(&t1662, ((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=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L759] 2 y$w_buff1 = y$w_buff0 [L760] 2 y$w_buff0 = 1 [L761] 2 y$w_buff1_used = y$w_buff0_used [L762] 2 y$w_buff0_used = (_Bool)1 [L779] 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=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __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=1, 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, z=1] [L729] 1 x = 1 [L734] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L735] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L736] 1 y$flush_delayed = weak$$choice2 [L737] 1 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=0, y$r_buff0_thd2=1, 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, z=1] [L738] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? 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=0, y$r_buff0_thd2=1, 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, z=1] [L779] 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) [L780] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L781] 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 [L738] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L739] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) 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, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? 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=0, y$r_buff0_thd2=1, 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, z=1] [L739] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L740] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) 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, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L740] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L741] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) 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, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L741] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L742] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) 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, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, 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, z=1] [L744] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L745] 1 __unbuffered_p0_EAX = 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=0, y$r_buff0_thd2=1, 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, z=1] [L806] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__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=0, y$r_buff0_thd2=1, 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, z=1] [L811] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L812] 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 [L813] 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, 131 locations, 2 error locations. Result: UNSAFE, OverallTime: 14.0s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1945 SDtfs, 1721 SDslu, 3471 SDs, 0 SdLazy, 1643 SolverSat, 80 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 90 GetRequests, 23 SyntacticMatches, 5 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11607occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 16 MinimizatonAttempts, 7835 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 444 NumberOfCodeBlocks, 444 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 386 ConstructedInterpolants, 0 QuantifiedInterpolants, 33742 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...