/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 03:24:14,531 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 03:24:14,533 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 03:24:14,553 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 03:24:14,553 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 03:24:14,554 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 03:24:14,555 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 03:24:14,557 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 03:24:14,559 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 03:24:14,560 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 03:24:14,561 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 03:24:14,562 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 03:24:14,562 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 03:24:14,563 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 03:24:14,564 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 03:24:14,565 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 03:24:14,566 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 03:24:14,567 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 03:24:14,569 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 03:24:14,571 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 03:24:14,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 03:24:14,574 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 03:24:14,575 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 03:24:14,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 03:24:14,581 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 03:24:14,581 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 03:24:14,581 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 03:24:14,582 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 03:24:14,582 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 03:24:14,584 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 03:24:14,585 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 03:24:14,586 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 03:24:14,587 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 03:24:14,589 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 03:24:14,593 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 03:24:14,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 03:24:14,595 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 03:24:14,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 03:24:14,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 03:24:14,599 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 03:24:14,600 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 03:24:14,602 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf [2019-12-19 03:24:14,625 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 03:24:14,625 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 03:24:14,627 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 03:24:14,627 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 03:24:14,627 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 03:24:14,627 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 03:24:14,628 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 03:24:14,628 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 03:24:14,628 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 03:24:14,628 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 03:24:14,629 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 03:24:14,630 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 03:24:14,630 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 03:24:14,631 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 03:24:14,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 03:24:14,631 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 03:24:14,631 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 03:24:14,631 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 03:24:14,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 03:24:14,632 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 03:24:14,632 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 03:24:14,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 03:24:14,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 03:24:14,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 03:24:14,633 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 03:24:14,633 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 03:24:14,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 03:24:14,634 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 03:24:14,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 03:24:14,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 03:24:14,945 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 03:24:14,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 03:24:14,971 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 03:24:14,972 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 03:24:14,972 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 03:24:14,974 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix054_rmo.oepc.i [2019-12-19 03:24:15,048 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c02a62920/c2828ba24c0c49d29f241c8d7af1cb7b/FLAGbbde209c8 [2019-12-19 03:24:15,554 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 03:24:15,555 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix054_rmo.oepc.i [2019-12-19 03:24:15,576 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c02a62920/c2828ba24c0c49d29f241c8d7af1cb7b/FLAGbbde209c8 [2019-12-19 03:24:15,892 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c02a62920/c2828ba24c0c49d29f241c8d7af1cb7b [2019-12-19 03:24:15,900 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 03:24:15,902 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 03:24:15,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 03:24:15,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 03:24:15,907 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 03:24:15,907 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:24:15" (1/1) ... [2019-12-19 03:24:15,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18316cf8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:15, skipping insertion in model container [2019-12-19 03:24:15,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 03:24:15" (1/1) ... [2019-12-19 03:24:15,916 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 03:24:15,967 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 03:24:16,488 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:24:16,502 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 03:24:16,565 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 03:24:16,646 INFO L208 MainTranslator]: Completed translation [2019-12-19 03:24:16,647 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:16 WrapperNode [2019-12-19 03:24:16,647 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 03:24:16,648 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 03:24:16,648 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 03:24:16,649 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 03:24:16,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:16" (1/1) ... [2019-12-19 03:24:16,679 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:16" (1/1) ... [2019-12-19 03:24:16,723 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 03:24:16,723 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 03:24:16,723 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 03:24:16,723 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 03:24:16,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:16" (1/1) ... [2019-12-19 03:24:16,732 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:16" (1/1) ... [2019-12-19 03:24:16,736 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:16" (1/1) ... [2019-12-19 03:24:16,737 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:16" (1/1) ... [2019-12-19 03:24:16,747 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:16" (1/1) ... [2019-12-19 03:24:16,751 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:16" (1/1) ... [2019-12-19 03:24:16,754 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:16" (1/1) ... [2019-12-19 03:24:16,760 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 03:24:16,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 03:24:16,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 03:24:16,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 03:24:16,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:16" (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-19 03:24:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 03:24:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 03:24:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 03:24:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 03:24:16,832 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 03:24:16,833 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 03:24:16,833 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 03:24:16,833 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 03:24:16,833 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 03:24:16,833 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 03:24:16,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 03:24:16,836 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-19 03:24:17,602 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 03:24:17,603 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 03:24:17,606 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:24:17 BoogieIcfgContainer [2019-12-19 03:24:17,606 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 03:24:17,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 03:24:17,608 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 03:24:17,612 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 03:24:17,613 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 03:24:15" (1/3) ... [2019-12-19 03:24:17,614 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373dcc06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:24:17, skipping insertion in model container [2019-12-19 03:24:17,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 03:24:16" (2/3) ... [2019-12-19 03:24:17,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@373dcc06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 03:24:17, skipping insertion in model container [2019-12-19 03:24:17,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 03:24:17" (3/3) ... [2019-12-19 03:24:17,619 INFO L109 eAbstractionObserver]: Analyzing ICFG mix054_rmo.oepc.i [2019-12-19 03:24:17,630 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 03:24:17,630 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 03:24:17,638 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 03:24:17,639 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 03:24:17,679 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,680 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,680 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,680 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,681 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,681 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,691 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,692 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,703 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,706 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,707 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,708 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,709 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,710 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,723 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,724 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,725 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,725 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,726 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,726 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,726 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,733 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,752 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,753 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,753 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,754 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 03:24:17,771 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 03:24:17,795 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 03:24:17,796 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 03:24:17,796 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 03:24:17,796 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 03:24:17,796 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 03:24:17,796 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 03:24:17,796 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 03:24:17,796 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 03:24:17,811 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 146 places, 180 transitions [2019-12-19 03:24:20,128 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32590 states. [2019-12-19 03:24:20,130 INFO L276 IsEmpty]: Start isEmpty. Operand 32590 states. [2019-12-19 03:24:20,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-19 03:24:20,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:20,139 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] [2019-12-19 03:24:20,139 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:20,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:20,146 INFO L82 PathProgramCache]: Analyzing trace with hash -334571497, now seen corresponding path program 1 times [2019-12-19 03:24:20,155 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:20,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408497932] [2019-12-19 03:24:20,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:20,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:20,481 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-19 03:24:20,482 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408497932] [2019-12-19 03:24:20,483 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:20,483 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:24:20,484 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549391624] [2019-12-19 03:24:20,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:24:20,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:20,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:24:20,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:24:20,508 INFO L87 Difference]: Start difference. First operand 32590 states. Second operand 4 states. [2019-12-19 03:24:22,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:22,126 INFO L93 Difference]: Finished difference Result 33590 states and 129567 transitions. [2019-12-19 03:24:22,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:24:22,128 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-19 03:24:22,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:22,413 INFO L225 Difference]: With dead ends: 33590 [2019-12-19 03:24:22,414 INFO L226 Difference]: Without dead ends: 25702 [2019-12-19 03:24:22,424 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:24:22,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-12-19 03:24:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 25702. [2019-12-19 03:24:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25702 states. [2019-12-19 03:24:23,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25702 states to 25702 states and 99583 transitions. [2019-12-19 03:24:23,995 INFO L78 Accepts]: Start accepts. Automaton has 25702 states and 99583 transitions. Word has length 33 [2019-12-19 03:24:23,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:23,997 INFO L462 AbstractCegarLoop]: Abstraction has 25702 states and 99583 transitions. [2019-12-19 03:24:23,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:24:23,998 INFO L276 IsEmpty]: Start isEmpty. Operand 25702 states and 99583 transitions. [2019-12-19 03:24:24,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-19 03:24:24,016 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:24,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:24,017 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:24,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:24,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1021806200, now seen corresponding path program 1 times [2019-12-19 03:24:24,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:24,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716835734] [2019-12-19 03:24:24,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:24,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:24,384 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-19 03:24:24,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716835734] [2019-12-19 03:24:24,385 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:24,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:24:24,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108731088] [2019-12-19 03:24:24,387 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:24:24,387 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:24,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:24:24,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:24:24,388 INFO L87 Difference]: Start difference. First operand 25702 states and 99583 transitions. Second operand 5 states. [2019-12-19 03:24:25,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:25,324 INFO L93 Difference]: Finished difference Result 41080 states and 150430 transitions. [2019-12-19 03:24:25,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:24:25,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-19 03:24:25,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:25,536 INFO L225 Difference]: With dead ends: 41080 [2019-12-19 03:24:25,536 INFO L226 Difference]: Without dead ends: 40544 [2019-12-19 03:24:25,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:24:27,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40544 states. [2019-12-19 03:24:28,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40544 to 38924. [2019-12-19 03:24:28,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38924 states. [2019-12-19 03:24:28,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38924 states to 38924 states and 143580 transitions. [2019-12-19 03:24:28,168 INFO L78 Accepts]: Start accepts. Automaton has 38924 states and 143580 transitions. Word has length 45 [2019-12-19 03:24:28,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:28,170 INFO L462 AbstractCegarLoop]: Abstraction has 38924 states and 143580 transitions. [2019-12-19 03:24:28,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:24:28,170 INFO L276 IsEmpty]: Start isEmpty. Operand 38924 states and 143580 transitions. [2019-12-19 03:24:28,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-19 03:24:28,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:28,176 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:28,176 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:28,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:28,177 INFO L82 PathProgramCache]: Analyzing trace with hash -169129071, now seen corresponding path program 1 times [2019-12-19 03:24:28,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:28,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927857041] [2019-12-19 03:24:28,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:28,318 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-19 03:24:28,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927857041] [2019-12-19 03:24:28,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:28,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:24:28,320 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456964754] [2019-12-19 03:24:28,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:24:28,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:28,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:24:28,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:24:28,321 INFO L87 Difference]: Start difference. First operand 38924 states and 143580 transitions. Second operand 5 states. [2019-12-19 03:24:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:30,365 INFO L93 Difference]: Finished difference Result 49777 states and 180632 transitions. [2019-12-19 03:24:30,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:24:30,366 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-19 03:24:30,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:30,687 INFO L225 Difference]: With dead ends: 49777 [2019-12-19 03:24:30,687 INFO L226 Difference]: Without dead ends: 49273 [2019-12-19 03:24:30,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:24:31,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49273 states. [2019-12-19 03:24:31,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49273 to 42676. [2019-12-19 03:24:31,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42676 states. [2019-12-19 03:24:31,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42676 states to 42676 states and 156591 transitions. [2019-12-19 03:24:31,950 INFO L78 Accepts]: Start accepts. Automaton has 42676 states and 156591 transitions. Word has length 46 [2019-12-19 03:24:31,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:31,950 INFO L462 AbstractCegarLoop]: Abstraction has 42676 states and 156591 transitions. [2019-12-19 03:24:31,951 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:24:31,951 INFO L276 IsEmpty]: Start isEmpty. Operand 42676 states and 156591 transitions. [2019-12-19 03:24:31,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-19 03:24:31,960 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:31,960 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:31,960 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:31,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:31,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1646950391, now seen corresponding path program 1 times [2019-12-19 03:24:31,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:31,961 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780895837] [2019-12-19 03:24:31,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:32,033 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-19 03:24:32,034 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780895837] [2019-12-19 03:24:32,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:32,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:24:32,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558888056] [2019-12-19 03:24:32,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:24:32,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:32,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:24:32,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:24:32,036 INFO L87 Difference]: Start difference. First operand 42676 states and 156591 transitions. Second operand 3 states. [2019-12-19 03:24:34,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:34,043 INFO L93 Difference]: Finished difference Result 61086 states and 221429 transitions. [2019-12-19 03:24:34,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:24:34,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-12-19 03:24:34,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:34,231 INFO L225 Difference]: With dead ends: 61086 [2019-12-19 03:24:34,232 INFO L226 Difference]: Without dead ends: 61086 [2019-12-19 03:24:34,232 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-19 03:24:34,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61086 states. [2019-12-19 03:24:35,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61086 to 48015. [2019-12-19 03:24:35,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48015 states. [2019-12-19 03:24:35,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48015 states to 48015 states and 174178 transitions. [2019-12-19 03:24:35,778 INFO L78 Accepts]: Start accepts. Automaton has 48015 states and 174178 transitions. Word has length 48 [2019-12-19 03:24:35,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:35,778 INFO L462 AbstractCegarLoop]: Abstraction has 48015 states and 174178 transitions. [2019-12-19 03:24:35,778 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:24:35,779 INFO L276 IsEmpty]: Start isEmpty. Operand 48015 states and 174178 transitions. [2019-12-19 03:24:35,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 03:24:35,797 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:35,798 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:35,798 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:35,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:35,798 INFO L82 PathProgramCache]: Analyzing trace with hash 2087627749, now seen corresponding path program 1 times [2019-12-19 03:24:35,798 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:35,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399815312] [2019-12-19 03:24:35,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:35,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:35,916 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-19 03:24:35,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399815312] [2019-12-19 03:24:35,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:35,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:24:35,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082239234] [2019-12-19 03:24:35,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:24:35,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:35,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:24:35,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:24:35,919 INFO L87 Difference]: Start difference. First operand 48015 states and 174178 transitions. Second operand 6 states. [2019-12-19 03:24:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:36,785 INFO L93 Difference]: Finished difference Result 63755 states and 229378 transitions. [2019-12-19 03:24:36,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:24:36,787 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-19 03:24:36,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:37,407 INFO L225 Difference]: With dead ends: 63755 [2019-12-19 03:24:37,407 INFO L226 Difference]: Without dead ends: 63755 [2019-12-19 03:24:37,408 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:24:37,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63755 states. [2019-12-19 03:24:40,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63755 to 59948. [2019-12-19 03:24:40,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59948 states. [2019-12-19 03:24:41,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59948 states to 59948 states and 215671 transitions. [2019-12-19 03:24:41,010 INFO L78 Accepts]: Start accepts. Automaton has 59948 states and 215671 transitions. Word has length 52 [2019-12-19 03:24:41,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:41,010 INFO L462 AbstractCegarLoop]: Abstraction has 59948 states and 215671 transitions. [2019-12-19 03:24:41,010 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:24:41,010 INFO L276 IsEmpty]: Start isEmpty. Operand 59948 states and 215671 transitions. [2019-12-19 03:24:41,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 03:24:41,028 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:41,028 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:41,028 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:41,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:41,029 INFO L82 PathProgramCache]: Analyzing trace with hash 290676390, now seen corresponding path program 1 times [2019-12-19 03:24:41,029 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:41,029 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227395325] [2019-12-19 03:24:41,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:41,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:41,176 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-19 03:24:41,177 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227395325] [2019-12-19 03:24:41,177 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:41,177 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:24:41,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979129052] [2019-12-19 03:24:41,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:24:41,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:41,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:24:41,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:24:41,180 INFO L87 Difference]: Start difference. First operand 59948 states and 215671 transitions. Second operand 7 states. [2019-12-19 03:24:42,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:42,615 INFO L93 Difference]: Finished difference Result 83684 states and 290096 transitions. [2019-12-19 03:24:42,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 03:24:42,615 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-12-19 03:24:42,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:42,801 INFO L225 Difference]: With dead ends: 83684 [2019-12-19 03:24:42,801 INFO L226 Difference]: Without dead ends: 83684 [2019-12-19 03:24:42,802 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:24:43,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83684 states. [2019-12-19 03:24:47,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83684 to 71011. [2019-12-19 03:24:47,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71011 states. [2019-12-19 03:24:47,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71011 states to 71011 states and 249885 transitions. [2019-12-19 03:24:47,281 INFO L78 Accepts]: Start accepts. Automaton has 71011 states and 249885 transitions. Word has length 52 [2019-12-19 03:24:47,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:47,281 INFO L462 AbstractCegarLoop]: Abstraction has 71011 states and 249885 transitions. [2019-12-19 03:24:47,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:24:47,281 INFO L276 IsEmpty]: Start isEmpty. Operand 71011 states and 249885 transitions. [2019-12-19 03:24:47,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 03:24:47,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:47,294 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:47,294 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:47,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:47,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1178180071, now seen corresponding path program 1 times [2019-12-19 03:24:47,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:47,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073772163] [2019-12-19 03:24:47,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:47,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:47,377 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-19 03:24:47,377 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073772163] [2019-12-19 03:24:47,378 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:47,378 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:24:47,378 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228743057] [2019-12-19 03:24:47,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:24:47,379 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:47,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:24:47,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:24:47,380 INFO L87 Difference]: Start difference. First operand 71011 states and 249885 transitions. Second operand 4 states. [2019-12-19 03:24:47,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:47,448 INFO L93 Difference]: Finished difference Result 12158 states and 37828 transitions. [2019-12-19 03:24:47,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:24:47,449 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-12-19 03:24:47,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:47,469 INFO L225 Difference]: With dead ends: 12158 [2019-12-19 03:24:47,470 INFO L226 Difference]: Without dead ends: 10673 [2019-12-19 03:24:47,470 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:24:47,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10673 states. [2019-12-19 03:24:47,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10673 to 10624. [2019-12-19 03:24:47,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10624 states. [2019-12-19 03:24:47,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10624 states to 10624 states and 32590 transitions. [2019-12-19 03:24:47,616 INFO L78 Accepts]: Start accepts. Automaton has 10624 states and 32590 transitions. Word has length 52 [2019-12-19 03:24:47,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:47,616 INFO L462 AbstractCegarLoop]: Abstraction has 10624 states and 32590 transitions. [2019-12-19 03:24:47,616 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:24:47,616 INFO L276 IsEmpty]: Start isEmpty. Operand 10624 states and 32590 transitions. [2019-12-19 03:24:47,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-12-19 03:24:47,618 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:47,618 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:47,618 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:47,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:47,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1257036994, now seen corresponding path program 1 times [2019-12-19 03:24:47,619 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:47,619 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828901542] [2019-12-19 03:24:47,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:47,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:47,687 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-19 03:24:47,688 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828901542] [2019-12-19 03:24:47,688 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:47,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:24:47,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421024696] [2019-12-19 03:24:47,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:24:47,689 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:47,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:24:47,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:24:47,690 INFO L87 Difference]: Start difference. First operand 10624 states and 32590 transitions. Second operand 6 states. [2019-12-19 03:24:48,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:48,181 INFO L93 Difference]: Finished difference Result 13181 states and 39871 transitions. [2019-12-19 03:24:48,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 03:24:48,182 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-12-19 03:24:48,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:48,202 INFO L225 Difference]: With dead ends: 13181 [2019-12-19 03:24:48,202 INFO L226 Difference]: Without dead ends: 13118 [2019-12-19 03:24:48,202 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-12-19 03:24:48,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13118 states. [2019-12-19 03:24:48,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13118 to 11047. [2019-12-19 03:24:48,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11047 states. [2019-12-19 03:24:48,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11047 states to 11047 states and 33784 transitions. [2019-12-19 03:24:48,369 INFO L78 Accepts]: Start accepts. Automaton has 11047 states and 33784 transitions. Word has length 52 [2019-12-19 03:24:48,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:48,369 INFO L462 AbstractCegarLoop]: Abstraction has 11047 states and 33784 transitions. [2019-12-19 03:24:48,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:24:48,370 INFO L276 IsEmpty]: Start isEmpty. Operand 11047 states and 33784 transitions. [2019-12-19 03:24:48,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 03:24:48,373 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:48,373 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:48,373 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:48,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:48,374 INFO L82 PathProgramCache]: Analyzing trace with hash -575967074, now seen corresponding path program 1 times [2019-12-19 03:24:48,374 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:48,374 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581910739] [2019-12-19 03:24:48,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:48,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:48,429 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-19 03:24:48,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581910739] [2019-12-19 03:24:48,430 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:48,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:24:48,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637261156] [2019-12-19 03:24:48,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:24:48,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:48,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:24:48,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:24:48,431 INFO L87 Difference]: Start difference. First operand 11047 states and 33784 transitions. Second operand 4 states. [2019-12-19 03:24:48,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:48,587 INFO L93 Difference]: Finished difference Result 12861 states and 39390 transitions. [2019-12-19 03:24:48,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:24:48,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-12-19 03:24:48,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:48,619 INFO L225 Difference]: With dead ends: 12861 [2019-12-19 03:24:48,619 INFO L226 Difference]: Without dead ends: 12861 [2019-12-19 03:24:48,620 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:24:48,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-12-19 03:24:48,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 11692. [2019-12-19 03:24:48,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11692 states. [2019-12-19 03:24:48,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11692 states to 11692 states and 35761 transitions. [2019-12-19 03:24:48,917 INFO L78 Accepts]: Start accepts. Automaton has 11692 states and 35761 transitions. Word has length 60 [2019-12-19 03:24:48,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:48,918 INFO L462 AbstractCegarLoop]: Abstraction has 11692 states and 35761 transitions. [2019-12-19 03:24:48,918 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:24:48,918 INFO L276 IsEmpty]: Start isEmpty. Operand 11692 states and 35761 transitions. [2019-12-19 03:24:48,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-19 03:24:48,924 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:48,924 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:48,924 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:48,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:48,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1166843261, now seen corresponding path program 1 times [2019-12-19 03:24:48,925 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:48,925 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373026929] [2019-12-19 03:24:48,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:48,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:48,996 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-19 03:24:48,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373026929] [2019-12-19 03:24:48,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:48,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:24:48,997 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221374008] [2019-12-19 03:24:48,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:24:48,998 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:48,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:24:48,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:24:48,999 INFO L87 Difference]: Start difference. First operand 11692 states and 35761 transitions. Second operand 6 states. [2019-12-19 03:24:49,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:49,692 INFO L93 Difference]: Finished difference Result 14218 states and 42859 transitions. [2019-12-19 03:24:49,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 03:24:49,693 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-19 03:24:49,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:49,713 INFO L225 Difference]: With dead ends: 14218 [2019-12-19 03:24:49,713 INFO L226 Difference]: Without dead ends: 14157 [2019-12-19 03:24:49,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:24:49,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14157 states. [2019-12-19 03:24:49,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14157 to 13460. [2019-12-19 03:24:49,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13460 states. [2019-12-19 03:24:49,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13460 states to 13460 states and 40778 transitions. [2019-12-19 03:24:49,896 INFO L78 Accepts]: Start accepts. Automaton has 13460 states and 40778 transitions. Word has length 60 [2019-12-19 03:24:49,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:49,896 INFO L462 AbstractCegarLoop]: Abstraction has 13460 states and 40778 transitions. [2019-12-19 03:24:49,896 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:24:49,897 INFO L276 IsEmpty]: Start isEmpty. Operand 13460 states and 40778 transitions. [2019-12-19 03:24:49,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 03:24:49,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:49,904 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:49,905 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:49,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:49,905 INFO L82 PathProgramCache]: Analyzing trace with hash -365592073, now seen corresponding path program 1 times [2019-12-19 03:24:49,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:49,906 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191595463] [2019-12-19 03:24:49,906 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:49,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:49,961 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-19 03:24:49,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191595463] [2019-12-19 03:24:49,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:49,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:24:49,963 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374795486] [2019-12-19 03:24:49,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:24:49,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:49,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:24:49,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:24:49,964 INFO L87 Difference]: Start difference. First operand 13460 states and 40778 transitions. Second operand 4 states. [2019-12-19 03:24:50,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:50,271 INFO L93 Difference]: Finished difference Result 16502 states and 49370 transitions. [2019-12-19 03:24:50,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:24:50,272 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-12-19 03:24:50,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:50,295 INFO L225 Difference]: With dead ends: 16502 [2019-12-19 03:24:50,296 INFO L226 Difference]: Without dead ends: 16502 [2019-12-19 03:24:50,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:24:50,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16502 states. [2019-12-19 03:24:50,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16502 to 14981. [2019-12-19 03:24:50,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14981 states. [2019-12-19 03:24:50,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14981 states to 14981 states and 44959 transitions. [2019-12-19 03:24:50,507 INFO L78 Accepts]: Start accepts. Automaton has 14981 states and 44959 transitions. Word has length 64 [2019-12-19 03:24:50,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:50,507 INFO L462 AbstractCegarLoop]: Abstraction has 14981 states and 44959 transitions. [2019-12-19 03:24:50,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:24:50,508 INFO L276 IsEmpty]: Start isEmpty. Operand 14981 states and 44959 transitions. [2019-12-19 03:24:50,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-19 03:24:50,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:50,515 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:50,515 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:50,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:50,515 INFO L82 PathProgramCache]: Analyzing trace with hash 327509624, now seen corresponding path program 1 times [2019-12-19 03:24:50,515 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:50,516 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082551627] [2019-12-19 03:24:50,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:50,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:50,560 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-19 03:24:50,560 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082551627] [2019-12-19 03:24:50,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:50,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:24:50,561 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154544720] [2019-12-19 03:24:50,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:24:50,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:50,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:24:50,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:24:50,562 INFO L87 Difference]: Start difference. First operand 14981 states and 44959 transitions. Second operand 3 states. [2019-12-19 03:24:50,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:50,867 INFO L93 Difference]: Finished difference Result 15529 states and 46402 transitions. [2019-12-19 03:24:50,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:24:50,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-19 03:24:50,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:50,901 INFO L225 Difference]: With dead ends: 15529 [2019-12-19 03:24:50,901 INFO L226 Difference]: Without dead ends: 15529 [2019-12-19 03:24:50,902 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-19 03:24:50,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15529 states. [2019-12-19 03:24:51,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15529 to 15275. [2019-12-19 03:24:51,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15275 states. [2019-12-19 03:24:51,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15275 states to 15275 states and 45727 transitions. [2019-12-19 03:24:51,200 INFO L78 Accepts]: Start accepts. Automaton has 15275 states and 45727 transitions. Word has length 64 [2019-12-19 03:24:51,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:51,201 INFO L462 AbstractCegarLoop]: Abstraction has 15275 states and 45727 transitions. [2019-12-19 03:24:51,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:24:51,201 INFO L276 IsEmpty]: Start isEmpty. Operand 15275 states and 45727 transitions. [2019-12-19 03:24:51,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:24:51,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:51,213 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:51,213 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:51,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:51,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1571759684, now seen corresponding path program 1 times [2019-12-19 03:24:51,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:51,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100900465] [2019-12-19 03:24:51,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:51,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:51,296 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-19 03:24:51,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100900465] [2019-12-19 03:24:51,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:51,297 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:24:51,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753578879] [2019-12-19 03:24:51,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:24:51,297 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:51,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:24:51,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:24:51,298 INFO L87 Difference]: Start difference. First operand 15275 states and 45727 transitions. Second operand 6 states. [2019-12-19 03:24:51,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:51,890 INFO L93 Difference]: Finished difference Result 16272 states and 48102 transitions. [2019-12-19 03:24:51,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:24:51,890 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-19 03:24:51,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:51,912 INFO L225 Difference]: With dead ends: 16272 [2019-12-19 03:24:51,913 INFO L226 Difference]: Without dead ends: 16272 [2019-12-19 03:24:51,913 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:24:52,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16272 states. [2019-12-19 03:24:52,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16272 to 15848. [2019-12-19 03:24:52,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15848 states. [2019-12-19 03:24:52,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15848 states to 15848 states and 47024 transitions. [2019-12-19 03:24:52,375 INFO L78 Accepts]: Start accepts. Automaton has 15848 states and 47024 transitions. Word has length 66 [2019-12-19 03:24:52,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:52,375 INFO L462 AbstractCegarLoop]: Abstraction has 15848 states and 47024 transitions. [2019-12-19 03:24:52,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:24:52,375 INFO L276 IsEmpty]: Start isEmpty. Operand 15848 states and 47024 transitions. [2019-12-19 03:24:52,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:24:52,384 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:52,384 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:52,384 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:52,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:52,385 INFO L82 PathProgramCache]: Analyzing trace with hash -878657987, now seen corresponding path program 1 times [2019-12-19 03:24:52,385 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:52,385 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912327680] [2019-12-19 03:24:52,385 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:52,506 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-19 03:24:52,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912327680] [2019-12-19 03:24:52,509 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:52,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:24:52,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713228624] [2019-12-19 03:24:52,510 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:24:52,510 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:52,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:24:52,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:24:52,510 INFO L87 Difference]: Start difference. First operand 15848 states and 47024 transitions. Second operand 6 states. [2019-12-19 03:24:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:53,071 INFO L93 Difference]: Finished difference Result 18159 states and 52352 transitions. [2019-12-19 03:24:53,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 03:24:53,071 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-19 03:24:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:53,105 INFO L225 Difference]: With dead ends: 18159 [2019-12-19 03:24:53,105 INFO L226 Difference]: Without dead ends: 18159 [2019-12-19 03:24:53,107 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 03:24:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18159 states. [2019-12-19 03:24:53,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18159 to 16540. [2019-12-19 03:24:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16540 states. [2019-12-19 03:24:53,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16540 states to 16540 states and 48244 transitions. [2019-12-19 03:24:53,401 INFO L78 Accepts]: Start accepts. Automaton has 16540 states and 48244 transitions. Word has length 66 [2019-12-19 03:24:53,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:53,401 INFO L462 AbstractCegarLoop]: Abstraction has 16540 states and 48244 transitions. [2019-12-19 03:24:53,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:24:53,402 INFO L276 IsEmpty]: Start isEmpty. Operand 16540 states and 48244 transitions. [2019-12-19 03:24:53,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:24:53,411 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:53,411 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:53,411 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:53,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:53,412 INFO L82 PathProgramCache]: Analyzing trace with hash 1339099966, now seen corresponding path program 1 times [2019-12-19 03:24:53,412 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:53,412 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135628821] [2019-12-19 03:24:53,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:53,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:53,498 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-19 03:24:53,498 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135628821] [2019-12-19 03:24:53,499 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:53,499 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:24:53,499 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236894799] [2019-12-19 03:24:53,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:24:53,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:53,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:24:53,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:24:53,500 INFO L87 Difference]: Start difference. First operand 16540 states and 48244 transitions. Second operand 5 states. [2019-12-19 03:24:53,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:53,925 INFO L93 Difference]: Finished difference Result 21454 states and 62484 transitions. [2019-12-19 03:24:53,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:24:53,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-19 03:24:53,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:53,960 INFO L225 Difference]: With dead ends: 21454 [2019-12-19 03:24:53,960 INFO L226 Difference]: Without dead ends: 21454 [2019-12-19 03:24:53,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:24:53,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21454 states. [2019-12-19 03:24:54,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21454 to 19519. [2019-12-19 03:24:54,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19519 states. [2019-12-19 03:24:54,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19519 states to 19519 states and 56653 transitions. [2019-12-19 03:24:54,226 INFO L78 Accepts]: Start accepts. Automaton has 19519 states and 56653 transitions. Word has length 66 [2019-12-19 03:24:54,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:54,227 INFO L462 AbstractCegarLoop]: Abstraction has 19519 states and 56653 transitions. [2019-12-19 03:24:54,227 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:24:54,227 INFO L276 IsEmpty]: Start isEmpty. Operand 19519 states and 56653 transitions. [2019-12-19 03:24:54,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:24:54,238 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:54,238 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:54,239 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:54,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:54,239 INFO L82 PathProgramCache]: Analyzing trace with hash 828565789, now seen corresponding path program 1 times [2019-12-19 03:24:54,239 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:54,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182089329] [2019-12-19 03:24:54,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:54,303 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-19 03:24:54,304 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182089329] [2019-12-19 03:24:54,304 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:54,304 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:24:54,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320110557] [2019-12-19 03:24:54,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:24:54,305 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:54,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:24:54,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:24:54,305 INFO L87 Difference]: Start difference. First operand 19519 states and 56653 transitions. Second operand 5 states. [2019-12-19 03:24:54,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:54,800 INFO L93 Difference]: Finished difference Result 26406 states and 76311 transitions. [2019-12-19 03:24:54,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:24:54,801 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-19 03:24:54,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:54,837 INFO L225 Difference]: With dead ends: 26406 [2019-12-19 03:24:54,837 INFO L226 Difference]: Without dead ends: 26406 [2019-12-19 03:24:54,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:24:54,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26406 states. [2019-12-19 03:24:55,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26406 to 21407. [2019-12-19 03:24:55,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21407 states. [2019-12-19 03:24:55,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21407 states to 21407 states and 61927 transitions. [2019-12-19 03:24:55,420 INFO L78 Accepts]: Start accepts. Automaton has 21407 states and 61927 transitions. Word has length 66 [2019-12-19 03:24:55,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:55,421 INFO L462 AbstractCegarLoop]: Abstraction has 21407 states and 61927 transitions. [2019-12-19 03:24:55,421 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:24:55,421 INFO L276 IsEmpty]: Start isEmpty. Operand 21407 states and 61927 transitions. [2019-12-19 03:24:55,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:24:55,431 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:55,431 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:55,431 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:55,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:55,432 INFO L82 PathProgramCache]: Analyzing trace with hash -978888674, now seen corresponding path program 1 times [2019-12-19 03:24:55,432 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:55,432 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426061297] [2019-12-19 03:24:55,432 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:55,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:55,484 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-19 03:24:55,484 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426061297] [2019-12-19 03:24:55,484 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:55,485 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:24:55,485 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913085746] [2019-12-19 03:24:55,485 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:24:55,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:55,485 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:24:55,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:24:55,486 INFO L87 Difference]: Start difference. First operand 21407 states and 61927 transitions. Second operand 4 states. [2019-12-19 03:24:56,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:56,146 INFO L93 Difference]: Finished difference Result 27968 states and 81349 transitions. [2019-12-19 03:24:56,147 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:24:56,147 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-19 03:24:56,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:56,186 INFO L225 Difference]: With dead ends: 27968 [2019-12-19 03:24:56,187 INFO L226 Difference]: Without dead ends: 27833 [2019-12-19 03:24:56,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:24:56,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27833 states. [2019-12-19 03:24:56,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27833 to 25844. [2019-12-19 03:24:56,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25844 states. [2019-12-19 03:24:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25844 states to 25844 states and 75187 transitions. [2019-12-19 03:24:56,543 INFO L78 Accepts]: Start accepts. Automaton has 25844 states and 75187 transitions. Word has length 66 [2019-12-19 03:24:56,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:56,543 INFO L462 AbstractCegarLoop]: Abstraction has 25844 states and 75187 transitions. [2019-12-19 03:24:56,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:24:56,543 INFO L276 IsEmpty]: Start isEmpty. Operand 25844 states and 75187 transitions. [2019-12-19 03:24:56,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:24:56,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:56,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:56,552 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:56,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:56,553 INFO L82 PathProgramCache]: Analyzing trace with hash 1519127263, now seen corresponding path program 1 times [2019-12-19 03:24:56,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:56,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846044184] [2019-12-19 03:24:56,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:56,690 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-19 03:24:56,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846044184] [2019-12-19 03:24:56,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:56,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:24:56,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675494011] [2019-12-19 03:24:56,691 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:24:56,691 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:56,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:24:56,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:24:56,692 INFO L87 Difference]: Start difference. First operand 25844 states and 75187 transitions. Second operand 7 states. [2019-12-19 03:24:57,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:57,282 INFO L93 Difference]: Finished difference Result 23112 states and 64209 transitions. [2019-12-19 03:24:57,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 03:24:57,282 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-19 03:24:57,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:57,312 INFO L225 Difference]: With dead ends: 23112 [2019-12-19 03:24:57,312 INFO L226 Difference]: Without dead ends: 23112 [2019-12-19 03:24:57,312 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-12-19 03:24:57,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23112 states. [2019-12-19 03:24:57,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23112 to 18808. [2019-12-19 03:24:57,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18808 states. [2019-12-19 03:24:57,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18808 states to 18808 states and 52244 transitions. [2019-12-19 03:24:57,566 INFO L78 Accepts]: Start accepts. Automaton has 18808 states and 52244 transitions. Word has length 66 [2019-12-19 03:24:57,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:57,566 INFO L462 AbstractCegarLoop]: Abstraction has 18808 states and 52244 transitions. [2019-12-19 03:24:57,566 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:24:57,566 INFO L276 IsEmpty]: Start isEmpty. Operand 18808 states and 52244 transitions. [2019-12-19 03:24:57,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:24:57,920 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:57,920 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:57,920 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:57,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:57,921 INFO L82 PathProgramCache]: Analyzing trace with hash -1888336352, now seen corresponding path program 1 times [2019-12-19 03:24:57,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:57,921 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961341697] [2019-12-19 03:24:57,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:57,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:58,008 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-19 03:24:58,009 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961341697] [2019-12-19 03:24:58,009 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:58,009 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:24:58,010 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055307031] [2019-12-19 03:24:58,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:24:58,011 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:58,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:24:58,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:24:58,012 INFO L87 Difference]: Start difference. First operand 18808 states and 52244 transitions. Second operand 5 states. [2019-12-19 03:24:58,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:58,071 INFO L93 Difference]: Finished difference Result 6130 states and 14461 transitions. [2019-12-19 03:24:58,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:24:58,072 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-19 03:24:58,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:58,079 INFO L225 Difference]: With dead ends: 6130 [2019-12-19 03:24:58,079 INFO L226 Difference]: Without dead ends: 5260 [2019-12-19 03:24:58,080 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-19 03:24:58,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2019-12-19 03:24:58,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 4725. [2019-12-19 03:24:58,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-12-19 03:24:58,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 10820 transitions. [2019-12-19 03:24:58,141 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 10820 transitions. Word has length 66 [2019-12-19 03:24:58,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:58,142 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 10820 transitions. [2019-12-19 03:24:58,142 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:24:58,142 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 10820 transitions. [2019-12-19 03:24:58,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-19 03:24:58,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:58,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:58,146 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:58,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:58,146 INFO L82 PathProgramCache]: Analyzing trace with hash -1090796306, now seen corresponding path program 1 times [2019-12-19 03:24:58,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:58,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849064996] [2019-12-19 03:24:58,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:58,179 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-19 03:24:58,179 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849064996] [2019-12-19 03:24:58,179 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:58,180 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 03:24:58,180 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016746133] [2019-12-19 03:24:58,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 03:24:58,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:58,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 03:24:58,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 03:24:58,181 INFO L87 Difference]: Start difference. First operand 4725 states and 10820 transitions. Second operand 3 states. [2019-12-19 03:24:58,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:58,219 INFO L93 Difference]: Finished difference Result 5855 states and 13186 transitions. [2019-12-19 03:24:58,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 03:24:58,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-19 03:24:58,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:58,228 INFO L225 Difference]: With dead ends: 5855 [2019-12-19 03:24:58,229 INFO L226 Difference]: Without dead ends: 5855 [2019-12-19 03:24:58,229 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-19 03:24:58,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2019-12-19 03:24:58,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 4660. [2019-12-19 03:24:58,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-19 03:24:58,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 10382 transitions. [2019-12-19 03:24:58,313 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 10382 transitions. Word has length 66 [2019-12-19 03:24:58,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:58,313 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 10382 transitions. [2019-12-19 03:24:58,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 03:24:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 10382 transitions. [2019-12-19 03:24:58,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-19 03:24:58,319 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:58,320 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:58,320 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:58,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:58,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2889151, now seen corresponding path program 1 times [2019-12-19 03:24:58,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:58,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061305639] [2019-12-19 03:24:58,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:58,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:58,373 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-19 03:24:58,373 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061305639] [2019-12-19 03:24:58,373 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:58,373 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:24:58,374 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088543216] [2019-12-19 03:24:58,374 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:24:58,374 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:58,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:24:58,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:24:58,375 INFO L87 Difference]: Start difference. First operand 4660 states and 10382 transitions. Second operand 5 states. [2019-12-19 03:24:58,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:58,540 INFO L93 Difference]: Finished difference Result 5721 states and 12811 transitions. [2019-12-19 03:24:58,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 03:24:58,541 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-12-19 03:24:58,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:58,548 INFO L225 Difference]: With dead ends: 5721 [2019-12-19 03:24:58,548 INFO L226 Difference]: Without dead ends: 5721 [2019-12-19 03:24:58,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-19 03:24:58,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5721 states. [2019-12-19 03:24:58,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5721 to 5080. [2019-12-19 03:24:58,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5080 states. [2019-12-19 03:24:58,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 11340 transitions. [2019-12-19 03:24:58,599 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 11340 transitions. Word has length 72 [2019-12-19 03:24:58,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:58,600 INFO L462 AbstractCegarLoop]: Abstraction has 5080 states and 11340 transitions. [2019-12-19 03:24:58,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:24:58,600 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 11340 transitions. [2019-12-19 03:24:58,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-12-19 03:24:58,604 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:58,604 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 03:24:58,605 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:58,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:58,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1739921184, now seen corresponding path program 1 times [2019-12-19 03:24:58,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:58,605 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463180579] [2019-12-19 03:24:58,605 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:58,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:58,677 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-19 03:24:58,678 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463180579] [2019-12-19 03:24:58,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:58,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 03:24:58,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296049753] [2019-12-19 03:24:58,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 03:24:58,679 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:58,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 03:24:58,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:24:58,680 INFO L87 Difference]: Start difference. First operand 5080 states and 11340 transitions. Second operand 7 states. [2019-12-19 03:24:59,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:59,163 INFO L93 Difference]: Finished difference Result 5820 states and 12863 transitions. [2019-12-19 03:24:59,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 03:24:59,164 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-12-19 03:24:59,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:59,171 INFO L225 Difference]: With dead ends: 5820 [2019-12-19 03:24:59,171 INFO L226 Difference]: Without dead ends: 5767 [2019-12-19 03:24:59,172 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-12-19 03:24:59,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2019-12-19 03:24:59,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5167. [2019-12-19 03:24:59,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5167 states. [2019-12-19 03:24:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5167 states to 5167 states and 11429 transitions. [2019-12-19 03:24:59,224 INFO L78 Accepts]: Start accepts. Automaton has 5167 states and 11429 transitions. Word has length 72 [2019-12-19 03:24:59,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:59,224 INFO L462 AbstractCegarLoop]: Abstraction has 5167 states and 11429 transitions. [2019-12-19 03:24:59,224 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 03:24:59,224 INFO L276 IsEmpty]: Start isEmpty. Operand 5167 states and 11429 transitions. [2019-12-19 03:24:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 03:24:59,229 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:59,229 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:24:59,229 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:59,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:59,229 INFO L82 PathProgramCache]: Analyzing trace with hash 97446499, now seen corresponding path program 1 times [2019-12-19 03:24:59,229 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:59,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496399411] [2019-12-19 03:24:59,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:59,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:59,284 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-19 03:24:59,284 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496399411] [2019-12-19 03:24:59,284 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:59,285 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:24:59,285 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477857231] [2019-12-19 03:24:59,285 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:24:59,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:59,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:24:59,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:24:59,286 INFO L87 Difference]: Start difference. First operand 5167 states and 11429 transitions. Second operand 5 states. [2019-12-19 03:24:59,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:59,581 INFO L93 Difference]: Finished difference Result 6009 states and 13221 transitions. [2019-12-19 03:24:59,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 03:24:59,582 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-19 03:24:59,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:59,589 INFO L225 Difference]: With dead ends: 6009 [2019-12-19 03:24:59,589 INFO L226 Difference]: Without dead ends: 6009 [2019-12-19 03:24:59,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-12-19 03:24:59,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2019-12-19 03:24:59,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 5312. [2019-12-19 03:24:59,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5312 states. [2019-12-19 03:24:59,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5312 states to 5312 states and 11744 transitions. [2019-12-19 03:24:59,645 INFO L78 Accepts]: Start accepts. Automaton has 5312 states and 11744 transitions. Word has length 93 [2019-12-19 03:24:59,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:59,645 INFO L462 AbstractCegarLoop]: Abstraction has 5312 states and 11744 transitions. [2019-12-19 03:24:59,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:24:59,645 INFO L276 IsEmpty]: Start isEmpty. Operand 5312 states and 11744 transitions. [2019-12-19 03:24:59,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-19 03:24:59,651 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:59,651 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:24:59,651 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:59,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:59,652 INFO L82 PathProgramCache]: Analyzing trace with hash 835793363, now seen corresponding path program 1 times [2019-12-19 03:24:59,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:59,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416278601] [2019-12-19 03:24:59,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:59,712 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-19 03:24:59,712 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416278601] [2019-12-19 03:24:59,712 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:59,713 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:24:59,713 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [253422034] [2019-12-19 03:24:59,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:24:59,713 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:59,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:24:59,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:24:59,715 INFO L87 Difference]: Start difference. First operand 5312 states and 11744 transitions. Second operand 4 states. [2019-12-19 03:24:59,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:24:59,821 INFO L93 Difference]: Finished difference Result 6275 states and 13793 transitions. [2019-12-19 03:24:59,821 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 03:24:59,821 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-12-19 03:24:59,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:24:59,829 INFO L225 Difference]: With dead ends: 6275 [2019-12-19 03:24:59,829 INFO L226 Difference]: Without dead ends: 6275 [2019-12-19 03:24:59,830 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:24:59,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6275 states. [2019-12-19 03:24:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6275 to 5506. [2019-12-19 03:24:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5506 states. [2019-12-19 03:24:59,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5506 states to 5506 states and 12150 transitions. [2019-12-19 03:24:59,888 INFO L78 Accepts]: Start accepts. Automaton has 5506 states and 12150 transitions. Word has length 93 [2019-12-19 03:24:59,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:24:59,888 INFO L462 AbstractCegarLoop]: Abstraction has 5506 states and 12150 transitions. [2019-12-19 03:24:59,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:24:59,888 INFO L276 IsEmpty]: Start isEmpty. Operand 5506 states and 12150 transitions. [2019-12-19 03:24:59,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:24:59,893 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:24:59,893 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:24:59,894 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:24:59,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:24:59,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1017086667, now seen corresponding path program 1 times [2019-12-19 03:24:59,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:24:59,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044414190] [2019-12-19 03:24:59,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:24:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:24:59,961 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-19 03:24:59,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044414190] [2019-12-19 03:24:59,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:24:59,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 03:24:59,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392870902] [2019-12-19 03:24:59,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 03:24:59,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:24:59,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 03:24:59,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:24:59,963 INFO L87 Difference]: Start difference. First operand 5506 states and 12150 transitions. Second operand 5 states. [2019-12-19 03:25:00,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:00,065 INFO L93 Difference]: Finished difference Result 5976 states and 13174 transitions. [2019-12-19 03:25:00,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 03:25:00,066 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-19 03:25:00,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:00,073 INFO L225 Difference]: With dead ends: 5976 [2019-12-19 03:25:00,073 INFO L226 Difference]: Without dead ends: 5976 [2019-12-19 03:25:00,073 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-19 03:25:00,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5976 states. [2019-12-19 03:25:00,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5976 to 4606. [2019-12-19 03:25:00,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4606 states. [2019-12-19 03:25:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4606 states to 4606 states and 10151 transitions. [2019-12-19 03:25:00,122 INFO L78 Accepts]: Start accepts. Automaton has 4606 states and 10151 transitions. Word has length 95 [2019-12-19 03:25:00,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:00,122 INFO L462 AbstractCegarLoop]: Abstraction has 4606 states and 10151 transitions. [2019-12-19 03:25:00,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 03:25:00,123 INFO L276 IsEmpty]: Start isEmpty. Operand 4606 states and 10151 transitions. [2019-12-19 03:25:00,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:25:00,129 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:00,130 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:25:00,130 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:00,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:00,130 INFO L82 PathProgramCache]: Analyzing trace with hash 1028402794, now seen corresponding path program 1 times [2019-12-19 03:25:00,130 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:00,130 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374025265] [2019-12-19 03:25:00,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:00,240 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-19 03:25:00,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374025265] [2019-12-19 03:25:00,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:00,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 03:25:00,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154327096] [2019-12-19 03:25:00,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 03:25:00,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:00,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 03:25:00,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:25:00,242 INFO L87 Difference]: Start difference. First operand 4606 states and 10151 transitions. Second operand 6 states. [2019-12-19 03:25:00,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:00,391 INFO L93 Difference]: Finished difference Result 5090 states and 11138 transitions. [2019-12-19 03:25:00,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 03:25:00,392 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-12-19 03:25:00,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:00,398 INFO L225 Difference]: With dead ends: 5090 [2019-12-19 03:25:00,399 INFO L226 Difference]: Without dead ends: 5090 [2019-12-19 03:25:00,399 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 03:25:00,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5090 states. [2019-12-19 03:25:00,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5090 to 4500. [2019-12-19 03:25:00,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4500 states. [2019-12-19 03:25:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4500 states to 4500 states and 9960 transitions. [2019-12-19 03:25:00,443 INFO L78 Accepts]: Start accepts. Automaton has 4500 states and 9960 transitions. Word has length 95 [2019-12-19 03:25:00,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:00,443 INFO L462 AbstractCegarLoop]: Abstraction has 4500 states and 9960 transitions. [2019-12-19 03:25:00,443 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 03:25:00,443 INFO L276 IsEmpty]: Start isEmpty. Operand 4500 states and 9960 transitions. [2019-12-19 03:25:00,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:25:00,447 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:00,447 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:25:00,447 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:00,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:00,447 INFO L82 PathProgramCache]: Analyzing trace with hash 70745997, now seen corresponding path program 1 times [2019-12-19 03:25:00,448 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:00,448 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064060821] [2019-12-19 03:25:00,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:00,522 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-19 03:25:00,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064060821] [2019-12-19 03:25:00,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:00,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 03:25:00,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302726124] [2019-12-19 03:25:00,523 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 03:25:00,523 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:00,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 03:25:00,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 03:25:00,524 INFO L87 Difference]: Start difference. First operand 4500 states and 9960 transitions. Second operand 4 states. [2019-12-19 03:25:00,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:00,869 INFO L93 Difference]: Finished difference Result 5715 states and 12587 transitions. [2019-12-19 03:25:00,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 03:25:00,869 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-12-19 03:25:00,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:00,877 INFO L225 Difference]: With dead ends: 5715 [2019-12-19 03:25:00,878 INFO L226 Difference]: Without dead ends: 5659 [2019-12-19 03:25:00,878 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-19 03:25:00,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5659 states. [2019-12-19 03:25:00,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5659 to 5354. [2019-12-19 03:25:00,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5354 states. [2019-12-19 03:25:00,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5354 states to 5354 states and 11818 transitions. [2019-12-19 03:25:00,988 INFO L78 Accepts]: Start accepts. Automaton has 5354 states and 11818 transitions. Word has length 95 [2019-12-19 03:25:00,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:00,989 INFO L462 AbstractCegarLoop]: Abstraction has 5354 states and 11818 transitions. [2019-12-19 03:25:00,989 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 03:25:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 5354 states and 11818 transitions. [2019-12-19 03:25:00,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:25:00,997 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:00,997 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:25:00,997 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:00,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:00,998 INFO L82 PathProgramCache]: Analyzing trace with hash -2006463346, now seen corresponding path program 1 times [2019-12-19 03:25:00,998 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:00,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928602863] [2019-12-19 03:25:00,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:01,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:01,263 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-19 03:25:01,264 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928602863] [2019-12-19 03:25:01,264 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:01,264 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-12-19 03:25:01,264 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812376122] [2019-12-19 03:25:01,265 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-19 03:25:01,265 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:01,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-19 03:25:01,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2019-12-19 03:25:01,266 INFO L87 Difference]: Start difference. First operand 5354 states and 11818 transitions. Second operand 13 states. [2019-12-19 03:25:03,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:03,023 INFO L93 Difference]: Finished difference Result 7876 states and 17095 transitions. [2019-12-19 03:25:03,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-19 03:25:03,024 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2019-12-19 03:25:03,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:03,035 INFO L225 Difference]: With dead ends: 7876 [2019-12-19 03:25:03,035 INFO L226 Difference]: Without dead ends: 7876 [2019-12-19 03:25:03,036 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=715, Unknown=0, NotChecked=0, Total=870 [2019-12-19 03:25:03,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7876 states. [2019-12-19 03:25:03,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7876 to 5915. [2019-12-19 03:25:03,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5915 states. [2019-12-19 03:25:03,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5915 states to 5915 states and 13012 transitions. [2019-12-19 03:25:03,138 INFO L78 Accepts]: Start accepts. Automaton has 5915 states and 13012 transitions. Word has length 95 [2019-12-19 03:25:03,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:03,138 INFO L462 AbstractCegarLoop]: Abstraction has 5915 states and 13012 transitions. [2019-12-19 03:25:03,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-19 03:25:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 5915 states and 13012 transitions. [2019-12-19 03:25:03,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:25:03,146 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:03,146 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:25:03,146 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:03,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:03,147 INFO L82 PathProgramCache]: Analyzing trace with hash -907608752, now seen corresponding path program 1 times [2019-12-19 03:25:03,147 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:03,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529811049] [2019-12-19 03:25:03,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:03,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 03:25:03,357 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-19 03:25:03,358 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529811049] [2019-12-19 03:25:03,358 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 03:25:03,359 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 03:25:03,359 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616576832] [2019-12-19 03:25:03,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 03:25:03,359 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 03:25:03,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 03:25:03,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 03:25:03,360 INFO L87 Difference]: Start difference. First operand 5915 states and 13012 transitions. Second operand 10 states. [2019-12-19 03:25:04,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 03:25:04,031 INFO L93 Difference]: Finished difference Result 17852 states and 39828 transitions. [2019-12-19 03:25:04,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 03:25:04,032 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-12-19 03:25:04,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 03:25:04,052 INFO L225 Difference]: With dead ends: 17852 [2019-12-19 03:25:04,052 INFO L226 Difference]: Without dead ends: 11878 [2019-12-19 03:25:04,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-12-19 03:25:04,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11878 states. [2019-12-19 03:25:04,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11878 to 5886. [2019-12-19 03:25:04,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5886 states. [2019-12-19 03:25:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5886 states to 5886 states and 12872 transitions. [2019-12-19 03:25:04,194 INFO L78 Accepts]: Start accepts. Automaton has 5886 states and 12872 transitions. Word has length 95 [2019-12-19 03:25:04,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 03:25:04,194 INFO L462 AbstractCegarLoop]: Abstraction has 5886 states and 12872 transitions. [2019-12-19 03:25:04,194 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 03:25:04,194 INFO L276 IsEmpty]: Start isEmpty. Operand 5886 states and 12872 transitions. [2019-12-19 03:25:04,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-19 03:25:04,202 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 03:25:04,202 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 03:25:04,202 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 03:25:04,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 03:25:04,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1770172980, now seen corresponding path program 2 times [2019-12-19 03:25:04,203 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 03:25:04,203 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535983432] [2019-12-19 03:25:04,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 03:25:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:25:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 03:25:04,361 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 03:25:04,361 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 03:25:04,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 03:25:04 BasicIcfg [2019-12-19 03:25:04,657 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 03:25:04,663 INFO L168 Benchmark]: Toolchain (without parser) took 48757.50 ms. Allocated memory was 144.2 MB in the beginning and 2.4 GB in the end (delta: 2.3 GB). Free memory was 100.2 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-19 03:25:04,663 INFO L168 Benchmark]: CDTParser took 0.51 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-19 03:25:04,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 744.53 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 100.0 MB in the beginning and 155.4 MB in the end (delta: -55.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. [2019-12-19 03:25:04,665 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.53 ms. Allocated memory is still 200.8 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-19 03:25:04,665 INFO L168 Benchmark]: Boogie Preprocessor took 36.92 ms. Allocated memory is still 200.8 MB. Free memory was 152.7 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-19 03:25:04,669 INFO L168 Benchmark]: RCFGBuilder took 845.96 ms. Allocated memory is still 200.8 MB. Free memory was 150.0 MB in the beginning and 106.1 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. [2019-12-19 03:25:04,670 INFO L168 Benchmark]: TraceAbstraction took 47049.68 ms. Allocated memory was 200.8 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 106.1 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-19 03:25:04,678 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.51 ms. Allocated memory is still 144.2 MB. Free memory was 120.5 MB in the beginning and 120.3 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 744.53 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 100.0 MB in the beginning and 155.4 MB in the end (delta: -55.5 MB). Peak memory consumption was 21.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.53 ms. Allocated memory is still 200.8 MB. Free memory was 155.4 MB in the beginning and 152.7 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.92 ms. Allocated memory is still 200.8 MB. Free memory was 152.7 MB in the beginning and 150.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 845.96 ms. Allocated memory is still 200.8 MB. Free memory was 150.0 MB in the beginning and 106.1 MB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47049.68 ms. Allocated memory was 200.8 MB in the beginning and 2.4 GB in the end (delta: 2.2 GB). Free memory was 106.1 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L694] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L696] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L697] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0] [L698] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L700] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L702] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L703] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L704] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L705] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L706] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L707] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L708] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L709] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L710] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L711] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L712] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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}] [L713] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L714] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L715] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L716] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L717] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=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] [L718] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L791] 0 pthread_t t1449; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L792] FCALL, FORK 0 pthread_create(&t1449, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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] [L722] 1 y$w_buff1 = y$w_buff0 [L723] 1 y$w_buff0 = 1 [L724] 1 y$w_buff1_used = y$w_buff0_used [L725] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L727] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L728] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L729] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L730] 1 y$r_buff0_thd1 = (_Bool)1 [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t1450; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t1450, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L750] 2 x = 2 [L753] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L754] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L755] 2 y$flush_delayed = weak$$choice2 [L756] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L736] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L737] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L757] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L737] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L758] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L758] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L759] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L760] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L763] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L764] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y = y$flush_delayed ? y$mem_tmp : y [L766] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] 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_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] 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_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L769] 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) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] 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 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L796] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L800] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L801] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 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 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L807] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 140 locations, 2 error locations. Result: UNSAFE, OverallTime: 46.5s, OverallIterations: 30, TraceHistogramMax: 1, AutomataDifference: 20.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8299 SDtfs, 8720 SDslu, 19134 SDs, 0 SdLazy, 7753 SolverSat, 465 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 290 GetRequests, 81 SyntacticMatches, 16 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 2.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71011occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.3s AutomataMinimizationTime, 29 MinimizatonAttempts, 73454 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2056 NumberOfCodeBlocks, 2056 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 1932 ConstructedInterpolants, 0 QuantifiedInterpolants, 319860 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 29 InterpolantComputations, 29 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...