/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/mix034_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-19 02:08:52,655 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-19 02:08:52,657 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-19 02:08:52,670 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-19 02:08:52,671 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-19 02:08:52,672 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-19 02:08:52,674 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-19 02:08:52,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-19 02:08:52,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-19 02:08:52,686 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-19 02:08:52,687 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-19 02:08:52,689 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-19 02:08:52,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-19 02:08:52,692 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-19 02:08:52,693 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-19 02:08:52,694 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-19 02:08:52,694 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-19 02:08:52,698 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-19 02:08:52,699 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-19 02:08:52,701 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-19 02:08:52,702 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-19 02:08:52,703 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-19 02:08:52,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-19 02:08:52,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-19 02:08:52,706 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-19 02:08:52,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-19 02:08:52,707 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-19 02:08:52,708 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-19 02:08:52,708 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-19 02:08:52,709 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-19 02:08:52,709 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-19 02:08:52,710 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-19 02:08:52,710 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-19 02:08:52,711 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-19 02:08:52,712 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-19 02:08:52,712 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-19 02:08:52,713 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-19 02:08:52,713 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-19 02:08:52,713 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-19 02:08:52,714 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-19 02:08:52,715 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-19 02:08:52,716 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 02:08:52,729 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-19 02:08:52,729 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-19 02:08:52,731 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-19 02:08:52,733 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-19 02:08:52,733 INFO L138 SettingsManager]: * Use SBE=true [2019-12-19 02:08:52,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-19 02:08:52,733 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-19 02:08:52,734 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-19 02:08:52,734 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-19 02:08:52,734 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-19 02:08:52,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-19 02:08:52,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-19 02:08:52,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-19 02:08:52,735 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-19 02:08:52,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-19 02:08:52,735 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-19 02:08:52,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-19 02:08:52,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-19 02:08:52,736 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-19 02:08:52,736 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-19 02:08:52,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-19 02:08:52,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-19 02:08:52,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-19 02:08:52,740 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-19 02:08:52,740 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-19 02:08:52,740 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-19 02:08:52,740 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-19 02:08:52,740 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-19 02:08:52,741 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-19 02:08:52,741 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-19 02:08:53,004 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-19 02:08:53,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-19 02:08:53,024 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-19 02:08:53,026 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-19 02:08:53,026 INFO L275 PluginConnector]: CDTParser initialized [2019-12-19 02:08:53,027 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix034_rmo.oepc.i [2019-12-19 02:08:53,097 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7b250b7/1a3e9a98addb4e6a8e7db69aed466083/FLAG5f7a2d47d [2019-12-19 02:08:53,667 INFO L306 CDTParser]: Found 1 translation units. [2019-12-19 02:08:53,668 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix034_rmo.oepc.i [2019-12-19 02:08:53,681 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7b250b7/1a3e9a98addb4e6a8e7db69aed466083/FLAG5f7a2d47d [2019-12-19 02:08:53,911 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c7b250b7/1a3e9a98addb4e6a8e7db69aed466083 [2019-12-19 02:08:53,921 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-19 02:08:53,923 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-19 02:08:53,924 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-19 02:08:53,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-19 02:08:53,932 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-19 02:08:53,933 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:08:53" (1/1) ... [2019-12-19 02:08:53,935 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4dd22070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:53, skipping insertion in model container [2019-12-19 02:08:53,936 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.12 02:08:53" (1/1) ... [2019-12-19 02:08:53,943 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-19 02:08:54,000 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-19 02:08:54,541 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:08:54,557 INFO L203 MainTranslator]: Completed pre-run [2019-12-19 02:08:54,638 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-19 02:08:54,718 INFO L208 MainTranslator]: Completed translation [2019-12-19 02:08:54,719 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:54 WrapperNode [2019-12-19 02:08:54,719 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-19 02:08:54,720 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-19 02:08:54,720 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-19 02:08:54,720 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-19 02:08:54,729 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:54" (1/1) ... [2019-12-19 02:08:54,749 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:54" (1/1) ... [2019-12-19 02:08:54,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-19 02:08:54,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-19 02:08:54,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-19 02:08:54,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-19 02:08:54,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:54" (1/1) ... [2019-12-19 02:08:54,789 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:54" (1/1) ... [2019-12-19 02:08:54,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:54" (1/1) ... [2019-12-19 02:08:54,795 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:54" (1/1) ... [2019-12-19 02:08:54,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:54" (1/1) ... [2019-12-19 02:08:54,826 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:54" (1/1) ... [2019-12-19 02:08:54,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:54" (1/1) ... [2019-12-19 02:08:54,837 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-19 02:08:54,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-19 02:08:54,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-19 02:08:54,838 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-19 02:08:54,839 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:54" (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 02:08:54,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-19 02:08:54,898 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-19 02:08:54,898 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-19 02:08:54,898 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-19 02:08:54,898 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-19 02:08:54,898 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-19 02:08:54,899 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-19 02:08:54,899 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-19 02:08:54,899 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-19 02:08:54,899 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-19 02:08:54,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-19 02:08:54,901 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 02:08:55,638 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-19 02:08:55,638 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-19 02:08:55,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:08:55 BoogieIcfgContainer [2019-12-19 02:08:55,640 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-19 02:08:55,641 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-19 02:08:55,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-19 02:08:55,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-19 02:08:55,644 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.12 02:08:53" (1/3) ... [2019-12-19 02:08:55,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fd5053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:08:55, skipping insertion in model container [2019-12-19 02:08:55,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.12 02:08:54" (2/3) ... [2019-12-19 02:08:55,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42fd5053 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.12 02:08:55, skipping insertion in model container [2019-12-19 02:08:55,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.12 02:08:55" (3/3) ... [2019-12-19 02:08:55,648 INFO L109 eAbstractionObserver]: Analyzing ICFG mix034_rmo.oepc.i [2019-12-19 02:08:55,658 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-19 02:08:55,658 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-19 02:08:55,666 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-19 02:08:55,667 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-19 02:08:55,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,710 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,710 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,710 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,711 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,711 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,711 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,712 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,713 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,714 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,715 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,716 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,717 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,718 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,719 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,721 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,721 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,738 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,739 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,740 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,741 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,742 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,743 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,744 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,745 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,749 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,754 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,755 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,755 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,764 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,767 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-19 02:08:55,802 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-19 02:08:55,821 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-19 02:08:55,822 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-19 02:08:55,822 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-19 02:08:55,822 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-19 02:08:55,822 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-19 02:08:55,822 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-19 02:08:55,822 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-19 02:08:55,823 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-19 02:08:55,836 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 149 places, 183 transitions [2019-12-19 02:08:57,698 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32593 states. [2019-12-19 02:08:57,700 INFO L276 IsEmpty]: Start isEmpty. Operand 32593 states. [2019-12-19 02:08:57,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-19 02:08:57,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:08:57,709 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] [2019-12-19 02:08:57,710 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:08:57,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:08:57,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1674583442, now seen corresponding path program 1 times [2019-12-19 02:08:57,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:08:57,723 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922078502] [2019-12-19 02:08:57,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:08:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:08:58,010 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 02:08:58,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922078502] [2019-12-19 02:08:58,012 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:08:58,013 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:08:58,014 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497499763] [2019-12-19 02:08:58,019 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:08:58,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:08:58,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:08:58,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:08:58,038 INFO L87 Difference]: Start difference. First operand 32593 states. Second operand 4 states. [2019-12-19 02:08:59,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:08:59,014 INFO L93 Difference]: Finished difference Result 33593 states and 129570 transitions. [2019-12-19 02:08:59,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:08:59,016 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2019-12-19 02:08:59,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:08:59,241 INFO L225 Difference]: With dead ends: 33593 [2019-12-19 02:08:59,242 INFO L226 Difference]: Without dead ends: 25705 [2019-12-19 02:08:59,243 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 02:09:00,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25705 states. [2019-12-19 02:09:01,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25705 to 25705. [2019-12-19 02:09:01,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25705 states. [2019-12-19 02:09:01,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25705 states to 25705 states and 99586 transitions. [2019-12-19 02:09:01,916 INFO L78 Accepts]: Start accepts. Automaton has 25705 states and 99586 transitions. Word has length 36 [2019-12-19 02:09:01,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:01,917 INFO L462 AbstractCegarLoop]: Abstraction has 25705 states and 99586 transitions. [2019-12-19 02:09:01,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:01,917 INFO L276 IsEmpty]: Start isEmpty. Operand 25705 states and 99586 transitions. [2019-12-19 02:09:01,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-19 02:09:01,940 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:01,940 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 02:09:01,941 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:01,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:01,941 INFO L82 PathProgramCache]: Analyzing trace with hash -196337745, now seen corresponding path program 1 times [2019-12-19 02:09:01,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:01,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068916765] [2019-12-19 02:09:01,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:02,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:02,128 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 02:09:02,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068916765] [2019-12-19 02:09:02,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:02,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:02,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294908268] [2019-12-19 02:09:02,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:02,132 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:02,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:02,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:02,132 INFO L87 Difference]: Start difference. First operand 25705 states and 99586 transitions. Second operand 5 states. [2019-12-19 02:09:03,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:03,977 INFO L93 Difference]: Finished difference Result 41083 states and 150433 transitions. [2019-12-19 02:09:03,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:03,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2019-12-19 02:09:03,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:04,178 INFO L225 Difference]: With dead ends: 41083 [2019-12-19 02:09:04,178 INFO L226 Difference]: Without dead ends: 40547 [2019-12-19 02:09:04,179 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 02:09:04,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40547 states. [2019-12-19 02:09:05,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40547 to 38927. [2019-12-19 02:09:05,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38927 states. [2019-12-19 02:09:05,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38927 states to 38927 states and 143583 transitions. [2019-12-19 02:09:05,968 INFO L78 Accepts]: Start accepts. Automaton has 38927 states and 143583 transitions. Word has length 48 [2019-12-19 02:09:05,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:05,970 INFO L462 AbstractCegarLoop]: Abstraction has 38927 states and 143583 transitions. [2019-12-19 02:09:05,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:05,970 INFO L276 IsEmpty]: Start isEmpty. Operand 38927 states and 143583 transitions. [2019-12-19 02:09:05,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-12-19 02:09:05,976 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:05,977 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] [2019-12-19 02:09:05,977 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:05,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:05,977 INFO L82 PathProgramCache]: Analyzing trace with hash -207257985, now seen corresponding path program 1 times [2019-12-19 02:09:05,978 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:05,978 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794557641] [2019-12-19 02:09:05,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:05,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:06,061 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 02:09:06,062 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794557641] [2019-12-19 02:09:06,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:06,063 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:06,063 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074275786] [2019-12-19 02:09:06,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:06,064 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:06,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:06,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:06,065 INFO L87 Difference]: Start difference. First operand 38927 states and 143583 transitions. Second operand 5 states. [2019-12-19 02:09:06,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:06,705 INFO L93 Difference]: Finished difference Result 49780 states and 180635 transitions. [2019-12-19 02:09:06,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:06,706 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 49 [2019-12-19 02:09:06,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:06,892 INFO L225 Difference]: With dead ends: 49780 [2019-12-19 02:09:06,892 INFO L226 Difference]: Without dead ends: 49276 [2019-12-19 02:09:06,893 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 02:09:08,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49276 states. [2019-12-19 02:09:09,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49276 to 42679. [2019-12-19 02:09:09,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42679 states. [2019-12-19 02:09:09,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42679 states to 42679 states and 156594 transitions. [2019-12-19 02:09:09,943 INFO L78 Accepts]: Start accepts. Automaton has 42679 states and 156594 transitions. Word has length 49 [2019-12-19 02:09:09,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:09,944 INFO L462 AbstractCegarLoop]: Abstraction has 42679 states and 156594 transitions. [2019-12-19 02:09:09,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:09,944 INFO L276 IsEmpty]: Start isEmpty. Operand 42679 states and 156594 transitions. [2019-12-19 02:09:09,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-12-19 02:09:09,953 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:09,953 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:09:09,953 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:09,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:09,954 INFO L82 PathProgramCache]: Analyzing trace with hash -635197403, now seen corresponding path program 1 times [2019-12-19 02:09:09,954 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:09,954 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695890037] [2019-12-19 02:09:09,954 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:10,000 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 02:09:10,000 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695890037] [2019-12-19 02:09:10,001 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:10,001 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:09:10,001 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912491261] [2019-12-19 02:09:10,001 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:09:10,002 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:10,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:09:10,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:09:10,003 INFO L87 Difference]: Start difference. First operand 42679 states and 156594 transitions. Second operand 3 states. [2019-12-19 02:09:10,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:10,304 INFO L93 Difference]: Finished difference Result 61089 states and 221432 transitions. [2019-12-19 02:09:10,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:09:10,304 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-12-19 02:09:10,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:10,525 INFO L225 Difference]: With dead ends: 61089 [2019-12-19 02:09:10,525 INFO L226 Difference]: Without dead ends: 61089 [2019-12-19 02:09:10,526 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 02:09:12,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61089 states. [2019-12-19 02:09:13,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61089 to 48018. [2019-12-19 02:09:13,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48018 states. [2019-12-19 02:09:13,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48018 states to 48018 states and 174181 transitions. [2019-12-19 02:09:13,836 INFO L78 Accepts]: Start accepts. Automaton has 48018 states and 174181 transitions. Word has length 51 [2019-12-19 02:09:13,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:13,837 INFO L462 AbstractCegarLoop]: Abstraction has 48018 states and 174181 transitions. [2019-12-19 02:09:13,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:09:13,837 INFO L276 IsEmpty]: Start isEmpty. Operand 48018 states and 174181 transitions. [2019-12-19 02:09:13,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 02:09:13,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:13,853 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] [2019-12-19 02:09:13,853 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:13,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:13,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1064293156, now seen corresponding path program 1 times [2019-12-19 02:09:13,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:13,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101536293] [2019-12-19 02:09:13,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:13,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:13,978 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 02:09:13,979 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101536293] [2019-12-19 02:09:13,979 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:13,979 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:13,979 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018718946] [2019-12-19 02:09:13,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:13,980 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:13,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:13,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:13,980 INFO L87 Difference]: Start difference. First operand 48018 states and 174181 transitions. Second operand 6 states. [2019-12-19 02:09:14,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:14,841 INFO L93 Difference]: Finished difference Result 63758 states and 229381 transitions. [2019-12-19 02:09:14,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:14,841 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-19 02:09:14,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:14,980 INFO L225 Difference]: With dead ends: 63758 [2019-12-19 02:09:14,980 INFO L226 Difference]: Without dead ends: 63758 [2019-12-19 02:09:14,980 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 02:09:15,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63758 states. [2019-12-19 02:09:16,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63758 to 59951. [2019-12-19 02:09:16,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59951 states. [2019-12-19 02:09:16,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59951 states to 59951 states and 215674 transitions. [2019-12-19 02:09:16,567 INFO L78 Accepts]: Start accepts. Automaton has 59951 states and 215674 transitions. Word has length 55 [2019-12-19 02:09:16,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:16,567 INFO L462 AbstractCegarLoop]: Abstraction has 59951 states and 215674 transitions. [2019-12-19 02:09:16,567 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:16,567 INFO L276 IsEmpty]: Start isEmpty. Operand 59951 states and 215674 transitions. [2019-12-19 02:09:16,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 02:09:16,585 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:16,585 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] [2019-12-19 02:09:16,586 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:16,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:16,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1433722781, now seen corresponding path program 1 times [2019-12-19 02:09:16,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:16,587 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019145778] [2019-12-19 02:09:16,587 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:19,093 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 02:09:19,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019145778] [2019-12-19 02:09:19,094 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:19,094 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:09:19,094 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094344826] [2019-12-19 02:09:19,095 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:09:19,095 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:19,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:09:19,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:09:19,096 INFO L87 Difference]: Start difference. First operand 59951 states and 215674 transitions. Second operand 7 states. [2019-12-19 02:09:20,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:20,325 INFO L93 Difference]: Finished difference Result 83687 states and 290099 transitions. [2019-12-19 02:09:20,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-19 02:09:20,325 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2019-12-19 02:09:20,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:20,503 INFO L225 Difference]: With dead ends: 83687 [2019-12-19 02:09:20,503 INFO L226 Difference]: Without dead ends: 83687 [2019-12-19 02:09:20,504 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 02:09:20,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83687 states. [2019-12-19 02:09:21,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83687 to 71014. [2019-12-19 02:09:21,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71014 states. [2019-12-19 02:09:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71014 states to 71014 states and 249888 transitions. [2019-12-19 02:09:22,139 INFO L78 Accepts]: Start accepts. Automaton has 71014 states and 249888 transitions. Word has length 55 [2019-12-19 02:09:22,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:22,140 INFO L462 AbstractCegarLoop]: Abstraction has 71014 states and 249888 transitions. [2019-12-19 02:09:22,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:09:22,140 INFO L276 IsEmpty]: Start isEmpty. Operand 71014 states and 249888 transitions. [2019-12-19 02:09:22,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 02:09:22,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:22,153 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] [2019-12-19 02:09:22,153 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:22,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:22,153 INFO L82 PathProgramCache]: Analyzing trace with hash -1973740834, now seen corresponding path program 1 times [2019-12-19 02:09:22,153 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:22,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3676132] [2019-12-19 02:09:22,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:22,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:22,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3676132] [2019-12-19 02:09:22,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:22,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:09:22,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034492381] [2019-12-19 02:09:22,239 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:09:22,239 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:22,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:09:22,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:22,240 INFO L87 Difference]: Start difference. First operand 71014 states and 249888 transitions. Second operand 4 states. [2019-12-19 02:09:22,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:22,317 INFO L93 Difference]: Finished difference Result 12161 states and 37831 transitions. [2019-12-19 02:09:22,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:09:22,317 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 55 [2019-12-19 02:09:22,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:22,339 INFO L225 Difference]: With dead ends: 12161 [2019-12-19 02:09:22,339 INFO L226 Difference]: Without dead ends: 10676 [2019-12-19 02:09:22,339 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 02:09:22,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10676 states. [2019-12-19 02:09:22,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10676 to 10627. [2019-12-19 02:09:22,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10627 states. [2019-12-19 02:09:22,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10627 states to 10627 states and 32593 transitions. [2019-12-19 02:09:22,956 INFO L78 Accepts]: Start accepts. Automaton has 10627 states and 32593 transitions. Word has length 55 [2019-12-19 02:09:22,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:22,957 INFO L462 AbstractCegarLoop]: Abstraction has 10627 states and 32593 transitions. [2019-12-19 02:09:22,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:22,957 INFO L276 IsEmpty]: Start isEmpty. Operand 10627 states and 32593 transitions. [2019-12-19 02:09:22,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-19 02:09:22,959 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:22,959 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] [2019-12-19 02:09:22,959 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:22,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:22,959 INFO L82 PathProgramCache]: Analyzing trace with hash -984017040, now seen corresponding path program 1 times [2019-12-19 02:09:22,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:22,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123083919] [2019-12-19 02:09:22,960 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:23,024 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 02:09:23,025 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123083919] [2019-12-19 02:09:23,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:23,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:23,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582812136] [2019-12-19 02:09:23,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:23,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:23,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:23,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:23,027 INFO L87 Difference]: Start difference. First operand 10627 states and 32593 transitions. Second operand 6 states. [2019-12-19 02:09:23,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:23,483 INFO L93 Difference]: Finished difference Result 13184 states and 39874 transitions. [2019-12-19 02:09:23,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:09:23,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 55 [2019-12-19 02:09:23,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:23,502 INFO L225 Difference]: With dead ends: 13184 [2019-12-19 02:09:23,502 INFO L226 Difference]: Without dead ends: 13121 [2019-12-19 02:09:23,502 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 02:09:23,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13121 states. [2019-12-19 02:09:23,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13121 to 11050. [2019-12-19 02:09:23,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11050 states. [2019-12-19 02:09:23,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11050 states to 11050 states and 33787 transitions. [2019-12-19 02:09:23,658 INFO L78 Accepts]: Start accepts. Automaton has 11050 states and 33787 transitions. Word has length 55 [2019-12-19 02:09:23,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:23,658 INFO L462 AbstractCegarLoop]: Abstraction has 11050 states and 33787 transitions. [2019-12-19 02:09:23,658 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:23,658 INFO L276 IsEmpty]: Start isEmpty. Operand 11050 states and 33787 transitions. [2019-12-19 02:09:23,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-19 02:09:23,663 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:23,663 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] [2019-12-19 02:09:23,663 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:23,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:23,664 INFO L82 PathProgramCache]: Analyzing trace with hash 721551436, now seen corresponding path program 1 times [2019-12-19 02:09:23,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:23,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967437541] [2019-12-19 02:09:23,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:23,717 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 02:09:23,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967437541] [2019-12-19 02:09:23,718 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:23,718 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:09:23,718 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262892799] [2019-12-19 02:09:23,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:09:23,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:23,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:09:23,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:23,719 INFO L87 Difference]: Start difference. First operand 11050 states and 33787 transitions. Second operand 4 states. [2019-12-19 02:09:23,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:23,882 INFO L93 Difference]: Finished difference Result 12864 states and 39393 transitions. [2019-12-19 02:09:23,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:09:23,883 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-12-19 02:09:23,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:23,914 INFO L225 Difference]: With dead ends: 12864 [2019-12-19 02:09:23,915 INFO L226 Difference]: Without dead ends: 12864 [2019-12-19 02:09:23,915 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 02:09:23,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12864 states. [2019-12-19 02:09:24,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12864 to 11695. [2019-12-19 02:09:24,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11695 states. [2019-12-19 02:09:24,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11695 states to 11695 states and 35764 transitions. [2019-12-19 02:09:24,182 INFO L78 Accepts]: Start accepts. Automaton has 11695 states and 35764 transitions. Word has length 63 [2019-12-19 02:09:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:24,183 INFO L462 AbstractCegarLoop]: Abstraction has 11695 states and 35764 transitions. [2019-12-19 02:09:24,183 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand 11695 states and 35764 transitions. [2019-12-19 02:09:24,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-12-19 02:09:24,188 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:24,188 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:09:24,188 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:24,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:24,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1830605525, now seen corresponding path program 1 times [2019-12-19 02:09:24,189 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:24,189 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375099951] [2019-12-19 02:09:24,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:24,292 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 02:09:24,292 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375099951] [2019-12-19 02:09:24,292 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:24,292 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:24,293 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114862926] [2019-12-19 02:09:24,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:24,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:24,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:24,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:24,294 INFO L87 Difference]: Start difference. First operand 11695 states and 35764 transitions. Second operand 6 states. [2019-12-19 02:09:24,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:24,733 INFO L93 Difference]: Finished difference Result 14221 states and 42862 transitions. [2019-12-19 02:09:24,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-19 02:09:24,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-12-19 02:09:24,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:24,753 INFO L225 Difference]: With dead ends: 14221 [2019-12-19 02:09:24,753 INFO L226 Difference]: Without dead ends: 14160 [2019-12-19 02:09:24,754 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 02:09:24,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14160 states. [2019-12-19 02:09:24,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14160 to 13463. [2019-12-19 02:09:24,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13463 states. [2019-12-19 02:09:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13463 states to 13463 states and 40781 transitions. [2019-12-19 02:09:24,942 INFO L78 Accepts]: Start accepts. Automaton has 13463 states and 40781 transitions. Word has length 63 [2019-12-19 02:09:24,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:24,942 INFO L462 AbstractCegarLoop]: Abstraction has 13463 states and 40781 transitions. [2019-12-19 02:09:24,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:24,942 INFO L276 IsEmpty]: Start isEmpty. Operand 13463 states and 40781 transitions. [2019-12-19 02:09:24,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 02:09:24,950 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:24,950 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] [2019-12-19 02:09:24,950 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:24,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:24,950 INFO L82 PathProgramCache]: Analyzing trace with hash -827165457, now seen corresponding path program 1 times [2019-12-19 02:09:24,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:24,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186922273] [2019-12-19 02:09:24,951 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:24,997 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 02:09:24,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186922273] [2019-12-19 02:09:24,998 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:24,998 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:09:24,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942552435] [2019-12-19 02:09:24,998 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:09:24,999 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:24,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:09:24,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:09:24,999 INFO L87 Difference]: Start difference. First operand 13463 states and 40781 transitions. Second operand 3 states. [2019-12-19 02:09:25,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:25,304 INFO L93 Difference]: Finished difference Result 14051 states and 42317 transitions. [2019-12-19 02:09:25,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:09:25,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-19 02:09:25,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:25,329 INFO L225 Difference]: With dead ends: 14051 [2019-12-19 02:09:25,329 INFO L226 Difference]: Without dead ends: 14051 [2019-12-19 02:09:25,330 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 02:09:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14051 states. [2019-12-19 02:09:25,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14051 to 13757. [2019-12-19 02:09:25,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13757 states. [2019-12-19 02:09:25,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13757 states to 13757 states and 41549 transitions. [2019-12-19 02:09:25,507 INFO L78 Accepts]: Start accepts. Automaton has 13757 states and 41549 transitions. Word has length 67 [2019-12-19 02:09:25,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:25,507 INFO L462 AbstractCegarLoop]: Abstraction has 13757 states and 41549 transitions. [2019-12-19 02:09:25,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:09:25,507 INFO L276 IsEmpty]: Start isEmpty. Operand 13757 states and 41549 transitions. [2019-12-19 02:09:25,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-19 02:09:25,513 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:25,514 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] [2019-12-19 02:09:25,514 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:25,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:25,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1250043886, now seen corresponding path program 1 times [2019-12-19 02:09:25,514 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:25,515 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202531880] [2019-12-19 02:09:25,515 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:25,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:25,589 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 02:09:25,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202531880] [2019-12-19 02:09:25,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:25,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:09:25,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832951534] [2019-12-19 02:09:25,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:09:25,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:25,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:09:25,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:25,591 INFO L87 Difference]: Start difference. First operand 13757 states and 41549 transitions. Second operand 4 states. [2019-12-19 02:09:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:25,897 INFO L93 Difference]: Finished difference Result 16799 states and 50141 transitions. [2019-12-19 02:09:25,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:09:25,897 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-12-19 02:09:25,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:25,920 INFO L225 Difference]: With dead ends: 16799 [2019-12-19 02:09:25,921 INFO L226 Difference]: Without dead ends: 16799 [2019-12-19 02:09:25,921 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 02:09:25,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16799 states. [2019-12-19 02:09:26,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16799 to 15278. [2019-12-19 02:09:26,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15278 states. [2019-12-19 02:09:26,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15278 states to 15278 states and 45730 transitions. [2019-12-19 02:09:26,129 INFO L78 Accepts]: Start accepts. Automaton has 15278 states and 45730 transitions. Word has length 67 [2019-12-19 02:09:26,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:26,130 INFO L462 AbstractCegarLoop]: Abstraction has 15278 states and 45730 transitions. [2019-12-19 02:09:26,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:26,130 INFO L276 IsEmpty]: Start isEmpty. Operand 15278 states and 45730 transitions. [2019-12-19 02:09:26,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:26,138 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:26,138 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] [2019-12-19 02:09:26,138 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:26,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:26,139 INFO L82 PathProgramCache]: Analyzing trace with hash -750353405, now seen corresponding path program 1 times [2019-12-19 02:09:26,139 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:26,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338808777] [2019-12-19 02:09:26,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:26,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:26,241 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 02:09:26,242 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338808777] [2019-12-19 02:09:26,242 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:26,242 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:26,242 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64837934] [2019-12-19 02:09:26,243 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:26,243 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:26,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:26,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:26,243 INFO L87 Difference]: Start difference. First operand 15278 states and 45730 transitions. Second operand 6 states. [2019-12-19 02:09:26,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:26,857 INFO L93 Difference]: Finished difference Result 16275 states and 48105 transitions. [2019-12-19 02:09:26,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:26,858 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-19 02:09:26,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:26,880 INFO L225 Difference]: With dead ends: 16275 [2019-12-19 02:09:26,881 INFO L226 Difference]: Without dead ends: 16275 [2019-12-19 02:09:26,881 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 02:09:26,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16275 states. [2019-12-19 02:09:27,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16275 to 15851. [2019-12-19 02:09:27,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15851 states. [2019-12-19 02:09:27,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15851 states to 15851 states and 47027 transitions. [2019-12-19 02:09:27,092 INFO L78 Accepts]: Start accepts. Automaton has 15851 states and 47027 transitions. Word has length 69 [2019-12-19 02:09:27,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:27,092 INFO L462 AbstractCegarLoop]: Abstraction has 15851 states and 47027 transitions. [2019-12-19 02:09:27,093 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:27,093 INFO L276 IsEmpty]: Start isEmpty. Operand 15851 states and 47027 transitions. [2019-12-19 02:09:27,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:27,101 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:27,102 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] [2019-12-19 02:09:27,102 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:27,102 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:27,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1467404548, now seen corresponding path program 1 times [2019-12-19 02:09:27,102 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:27,102 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326512062] [2019-12-19 02:09:27,103 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:27,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:27,203 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 02:09:27,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326512062] [2019-12-19 02:09:27,204 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:27,204 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:27,204 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019662236] [2019-12-19 02:09:27,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:27,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:27,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:27,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:27,205 INFO L87 Difference]: Start difference. First operand 15851 states and 47027 transitions. Second operand 6 states. [2019-12-19 02:09:27,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:27,770 INFO L93 Difference]: Finished difference Result 18162 states and 52355 transitions. [2019-12-19 02:09:27,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:09:27,770 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-19 02:09:27,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:27,793 INFO L225 Difference]: With dead ends: 18162 [2019-12-19 02:09:27,793 INFO L226 Difference]: Without dead ends: 18162 [2019-12-19 02:09:27,793 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-12-19 02:09:27,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18162 states. [2019-12-19 02:09:27,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18162 to 16543. [2019-12-19 02:09:27,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16543 states. [2019-12-19 02:09:28,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16543 states to 16543 states and 48247 transitions. [2019-12-19 02:09:28,019 INFO L78 Accepts]: Start accepts. Automaton has 16543 states and 48247 transitions. Word has length 69 [2019-12-19 02:09:28,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:28,019 INFO L462 AbstractCegarLoop]: Abstraction has 16543 states and 48247 transitions. [2019-12-19 02:09:28,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:28,019 INFO L276 IsEmpty]: Start isEmpty. Operand 16543 states and 48247 transitions. [2019-12-19 02:09:28,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:28,030 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:28,030 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] [2019-12-19 02:09:28,030 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:28,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:28,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1678755461, now seen corresponding path program 1 times [2019-12-19 02:09:28,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:28,031 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588003062] [2019-12-19 02:09:28,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:28,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:28,102 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 02:09:28,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588003062] [2019-12-19 02:09:28,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:28,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:28,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349452781] [2019-12-19 02:09:28,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:28,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:28,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:28,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:28,104 INFO L87 Difference]: Start difference. First operand 16543 states and 48247 transitions. Second operand 5 states. [2019-12-19 02:09:28,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:28,510 INFO L93 Difference]: Finished difference Result 21457 states and 62487 transitions. [2019-12-19 02:09:28,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:09:28,510 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 02:09:28,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:28,539 INFO L225 Difference]: With dead ends: 21457 [2019-12-19 02:09:28,539 INFO L226 Difference]: Without dead ends: 21457 [2019-12-19 02:09:28,539 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 02:09:28,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21457 states. [2019-12-19 02:09:28,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21457 to 19522. [2019-12-19 02:09:28,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19522 states. [2019-12-19 02:09:28,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19522 states to 19522 states and 56656 transitions. [2019-12-19 02:09:28,790 INFO L78 Accepts]: Start accepts. Automaton has 19522 states and 56656 transitions. Word has length 69 [2019-12-19 02:09:28,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:28,790 INFO L462 AbstractCegarLoop]: Abstraction has 19522 states and 56656 transitions. [2019-12-19 02:09:28,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:28,790 INFO L276 IsEmpty]: Start isEmpty. Operand 19522 states and 56656 transitions. [2019-12-19 02:09:28,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:28,801 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:28,801 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-19 02:09:28,801 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:28,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:28,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1168221284, now seen corresponding path program 1 times [2019-12-19 02:09:28,802 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:28,802 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690391551] [2019-12-19 02:09:28,802 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:28,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:28,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-19 02:09:28,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690391551] [2019-12-19 02:09:28,877 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:28,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:28,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591264073] [2019-12-19 02:09:28,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:28,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:28,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:28,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:28,880 INFO L87 Difference]: Start difference. First operand 19522 states and 56656 transitions. Second operand 5 states. [2019-12-19 02:09:29,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:29,419 INFO L93 Difference]: Finished difference Result 26409 states and 76314 transitions. [2019-12-19 02:09:29,420 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:29,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 02:09:29,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:29,456 INFO L225 Difference]: With dead ends: 26409 [2019-12-19 02:09:29,456 INFO L226 Difference]: Without dead ends: 26409 [2019-12-19 02:09:29,457 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 02:09:29,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26409 states. [2019-12-19 02:09:29,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26409 to 21410. [2019-12-19 02:09:29,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21410 states. [2019-12-19 02:09:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21410 states to 21410 states and 61930 transitions. [2019-12-19 02:09:30,007 INFO L78 Accepts]: Start accepts. Automaton has 21410 states and 61930 transitions. Word has length 69 [2019-12-19 02:09:30,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:30,007 INFO L462 AbstractCegarLoop]: Abstraction has 21410 states and 61930 transitions. [2019-12-19 02:09:30,007 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:30,007 INFO L276 IsEmpty]: Start isEmpty. Operand 21410 states and 61930 transitions. [2019-12-19 02:09:30,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:30,018 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:30,018 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] [2019-12-19 02:09:30,018 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:30,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:30,018 INFO L82 PathProgramCache]: Analyzing trace with hash -639233179, now seen corresponding path program 1 times [2019-12-19 02:09:30,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:30,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596458700] [2019-12-19 02:09:30,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:30,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:30,087 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 02:09:30,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596458700] [2019-12-19 02:09:30,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:30,087 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:09:30,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125247446] [2019-12-19 02:09:30,088 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:09:30,088 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:30,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:09:30,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:30,089 INFO L87 Difference]: Start difference. First operand 21410 states and 61930 transitions. Second operand 4 states. [2019-12-19 02:09:30,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:30,782 INFO L93 Difference]: Finished difference Result 27971 states and 81352 transitions. [2019-12-19 02:09:30,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:09:30,783 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-12-19 02:09:30,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:30,821 INFO L225 Difference]: With dead ends: 27971 [2019-12-19 02:09:30,821 INFO L226 Difference]: Without dead ends: 27836 [2019-12-19 02:09:30,822 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 02:09:30,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27836 states. [2019-12-19 02:09:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27836 to 25847. [2019-12-19 02:09:31,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25847 states. [2019-12-19 02:09:31,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25847 states to 25847 states and 75190 transitions. [2019-12-19 02:09:31,189 INFO L78 Accepts]: Start accepts. Automaton has 25847 states and 75190 transitions. Word has length 69 [2019-12-19 02:09:31,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:31,189 INFO L462 AbstractCegarLoop]: Abstraction has 25847 states and 75190 transitions. [2019-12-19 02:09:31,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:31,189 INFO L276 IsEmpty]: Start isEmpty. Operand 25847 states and 75190 transitions. [2019-12-19 02:09:31,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:31,199 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:31,199 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] [2019-12-19 02:09:31,199 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:31,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:31,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1858782758, now seen corresponding path program 1 times [2019-12-19 02:09:31,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:31,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13623807] [2019-12-19 02:09:31,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:31,290 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 02:09:31,290 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13623807] [2019-12-19 02:09:31,290 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:31,290 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:31,291 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302562753] [2019-12-19 02:09:31,291 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:31,291 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:31,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:31,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:31,292 INFO L87 Difference]: Start difference. First operand 25847 states and 75190 transitions. Second operand 5 states. [2019-12-19 02:09:31,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:31,424 INFO L93 Difference]: Finished difference Result 22415 states and 61757 transitions. [2019-12-19 02:09:31,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:09:31,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 02:09:31,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:31,455 INFO L225 Difference]: With dead ends: 22415 [2019-12-19 02:09:31,455 INFO L226 Difference]: Without dead ends: 22415 [2019-12-19 02:09:31,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:31,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22415 states. [2019-12-19 02:09:31,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22415 to 17791. [2019-12-19 02:09:31,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17791 states. [2019-12-19 02:09:31,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17791 states to 17791 states and 48969 transitions. [2019-12-19 02:09:31,704 INFO L78 Accepts]: Start accepts. Automaton has 17791 states and 48969 transitions. Word has length 69 [2019-12-19 02:09:31,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:31,704 INFO L462 AbstractCegarLoop]: Abstraction has 17791 states and 48969 transitions. [2019-12-19 02:09:31,704 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:31,704 INFO L276 IsEmpty]: Start isEmpty. Operand 17791 states and 48969 transitions. [2019-12-19 02:09:31,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:31,712 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:31,712 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] [2019-12-19 02:09:31,712 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:31,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:31,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1548680857, now seen corresponding path program 1 times [2019-12-19 02:09:31,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:31,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233611375] [2019-12-19 02:09:31,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:31,776 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 02:09:31,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233611375] [2019-12-19 02:09:31,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:31,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:31,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354578267] [2019-12-19 02:09:31,777 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:31,777 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:31,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:31,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:31,778 INFO L87 Difference]: Start difference. First operand 17791 states and 48969 transitions. Second operand 5 states. [2019-12-19 02:09:31,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:31,843 INFO L93 Difference]: Finished difference Result 5962 states and 14065 transitions. [2019-12-19 02:09:31,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:09:31,844 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-19 02:09:31,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:31,851 INFO L225 Difference]: With dead ends: 5962 [2019-12-19 02:09:31,852 INFO L226 Difference]: Without dead ends: 5119 [2019-12-19 02:09:31,852 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 02:09:31,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5119 states. [2019-12-19 02:09:31,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5119 to 4539. [2019-12-19 02:09:31,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4539 states. [2019-12-19 02:09:31,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4539 states to 4539 states and 10382 transitions. [2019-12-19 02:09:31,930 INFO L78 Accepts]: Start accepts. Automaton has 4539 states and 10382 transitions. Word has length 69 [2019-12-19 02:09:31,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:31,931 INFO L462 AbstractCegarLoop]: Abstraction has 4539 states and 10382 transitions. [2019-12-19 02:09:31,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:31,931 INFO L276 IsEmpty]: Start isEmpty. Operand 4539 states and 10382 transitions. [2019-12-19 02:09:31,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-19 02:09:31,936 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:31,936 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] [2019-12-19 02:09:31,937 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:31,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:31,937 INFO L82 PathProgramCache]: Analyzing trace with hash -839136164, now seen corresponding path program 1 times [2019-12-19 02:09:31,937 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:31,937 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484650867] [2019-12-19 02:09:31,937 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:31,966 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 02:09:31,966 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484650867] [2019-12-19 02:09:31,966 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:31,966 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-19 02:09:31,967 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783941788] [2019-12-19 02:09:31,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-19 02:09:31,967 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:31,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-19 02:09:31,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-19 02:09:31,968 INFO L87 Difference]: Start difference. First operand 4539 states and 10382 transitions. Second operand 3 states. [2019-12-19 02:09:32,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:32,004 INFO L93 Difference]: Finished difference Result 5480 states and 12307 transitions. [2019-12-19 02:09:32,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-19 02:09:32,005 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-19 02:09:32,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:32,012 INFO L225 Difference]: With dead ends: 5480 [2019-12-19 02:09:32,012 INFO L226 Difference]: Without dead ends: 5480 [2019-12-19 02:09:32,012 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 02:09:32,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5480 states. [2019-12-19 02:09:32,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5480 to 4474. [2019-12-19 02:09:32,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4474 states. [2019-12-19 02:09:32,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4474 states to 4474 states and 9944 transitions. [2019-12-19 02:09:32,083 INFO L78 Accepts]: Start accepts. Automaton has 4474 states and 9944 transitions. Word has length 69 [2019-12-19 02:09:32,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:32,084 INFO L462 AbstractCegarLoop]: Abstraction has 4474 states and 9944 transitions. [2019-12-19 02:09:32,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-19 02:09:32,084 INFO L276 IsEmpty]: Start isEmpty. Operand 4474 states and 9944 transitions. [2019-12-19 02:09:32,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 02:09:32,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:32,089 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] [2019-12-19 02:09:32,090 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:32,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:32,090 INFO L82 PathProgramCache]: Analyzing trace with hash -537618065, now seen corresponding path program 1 times [2019-12-19 02:09:32,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:32,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202957974] [2019-12-19 02:09:32,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:32,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:32,151 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 02:09:32,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202957974] [2019-12-19 02:09:32,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:32,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:32,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784681483] [2019-12-19 02:09:32,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:32,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:32,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:32,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:32,155 INFO L87 Difference]: Start difference. First operand 4474 states and 9944 transitions. Second operand 5 states. [2019-12-19 02:09:32,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:32,329 INFO L93 Difference]: Finished difference Result 5531 states and 12361 transitions. [2019-12-19 02:09:32,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-19 02:09:32,329 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-12-19 02:09:32,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:32,336 INFO L225 Difference]: With dead ends: 5531 [2019-12-19 02:09:32,336 INFO L226 Difference]: Without dead ends: 5531 [2019-12-19 02:09:32,337 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 02:09:32,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5531 states. [2019-12-19 02:09:32,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5531 to 4894. [2019-12-19 02:09:32,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4894 states. [2019-12-19 02:09:32,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4894 states to 4894 states and 10902 transitions. [2019-12-19 02:09:32,419 INFO L78 Accepts]: Start accepts. Automaton has 4894 states and 10902 transitions. Word has length 75 [2019-12-19 02:09:32,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:32,420 INFO L462 AbstractCegarLoop]: Abstraction has 4894 states and 10902 transitions. [2019-12-19 02:09:32,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:32,420 INFO L276 IsEmpty]: Start isEmpty. Operand 4894 states and 10902 transitions. [2019-12-19 02:09:32,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-19 02:09:32,425 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:32,425 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] [2019-12-19 02:09:32,425 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:32,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:32,425 INFO L82 PathProgramCache]: Analyzing trace with hash 1205192270, now seen corresponding path program 1 times [2019-12-19 02:09:32,426 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:32,426 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887150883] [2019-12-19 02:09:32,426 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:32,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:32,504 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 02:09:32,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887150883] [2019-12-19 02:09:32,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:32,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:09:32,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14254593] [2019-12-19 02:09:32,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:09:32,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:32,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:09:32,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:09:32,508 INFO L87 Difference]: Start difference. First operand 4894 states and 10902 transitions. Second operand 7 states. [2019-12-19 02:09:32,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:32,970 INFO L93 Difference]: Finished difference Result 5667 states and 12506 transitions. [2019-12-19 02:09:32,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-19 02:09:32,971 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 75 [2019-12-19 02:09:32,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:32,978 INFO L225 Difference]: With dead ends: 5667 [2019-12-19 02:09:32,979 INFO L226 Difference]: Without dead ends: 5614 [2019-12-19 02:09:32,979 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 02:09:32,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5614 states. [2019-12-19 02:09:33,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5614 to 4981. [2019-12-19 02:09:33,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4981 states. [2019-12-19 02:09:33,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4981 states to 4981 states and 10991 transitions. [2019-12-19 02:09:33,034 INFO L78 Accepts]: Start accepts. Automaton has 4981 states and 10991 transitions. Word has length 75 [2019-12-19 02:09:33,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:33,034 INFO L462 AbstractCegarLoop]: Abstraction has 4981 states and 10991 transitions. [2019-12-19 02:09:33,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:09:33,034 INFO L276 IsEmpty]: Start isEmpty. Operand 4981 states and 10991 transitions. [2019-12-19 02:09:33,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 02:09:33,039 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:33,039 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, 1] [2019-12-19 02:09:33,039 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:33,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:33,040 INFO L82 PathProgramCache]: Analyzing trace with hash -1936985037, now seen corresponding path program 1 times [2019-12-19 02:09:33,040 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:33,040 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870728455] [2019-12-19 02:09:33,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:33,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:33,102 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 02:09:33,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870728455] [2019-12-19 02:09:33,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:33,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:33,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190309949] [2019-12-19 02:09:33,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:33,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:33,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:33,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:33,104 INFO L87 Difference]: Start difference. First operand 4981 states and 10991 transitions. Second operand 5 states. [2019-12-19 02:09:33,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:33,419 INFO L93 Difference]: Finished difference Result 5856 states and 12864 transitions. [2019-12-19 02:09:33,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:33,420 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-19 02:09:33,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:33,427 INFO L225 Difference]: With dead ends: 5856 [2019-12-19 02:09:33,428 INFO L226 Difference]: Without dead ends: 5856 [2019-12-19 02:09:33,428 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 02:09:33,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5856 states. [2019-12-19 02:09:33,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5856 to 5103. [2019-12-19 02:09:33,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5103 states. [2019-12-19 02:09:33,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5103 states to 5103 states and 11257 transitions. [2019-12-19 02:09:33,485 INFO L78 Accepts]: Start accepts. Automaton has 5103 states and 11257 transitions. Word has length 96 [2019-12-19 02:09:33,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:33,485 INFO L462 AbstractCegarLoop]: Abstraction has 5103 states and 11257 transitions. [2019-12-19 02:09:33,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:33,485 INFO L276 IsEmpty]: Start isEmpty. Operand 5103 states and 11257 transitions. [2019-12-19 02:09:33,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-19 02:09:33,491 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:33,491 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, 1] [2019-12-19 02:09:33,491 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:33,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:33,492 INFO L82 PathProgramCache]: Analyzing trace with hash -825871511, now seen corresponding path program 2 times [2019-12-19 02:09:33,492 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:33,492 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643964810] [2019-12-19 02:09:33,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:33,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:33,545 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 02:09:33,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643964810] [2019-12-19 02:09:33,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:33,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:09:33,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271749727] [2019-12-19 02:09:33,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:09:33,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:33,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:09:33,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:33,548 INFO L87 Difference]: Start difference. First operand 5103 states and 11257 transitions. Second operand 4 states. [2019-12-19 02:09:33,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:33,640 INFO L93 Difference]: Finished difference Result 6030 states and 13225 transitions. [2019-12-19 02:09:33,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-19 02:09:33,641 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-19 02:09:33,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:33,649 INFO L225 Difference]: With dead ends: 6030 [2019-12-19 02:09:33,649 INFO L226 Difference]: Without dead ends: 6030 [2019-12-19 02:09:33,649 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 02:09:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6030 states. [2019-12-19 02:09:33,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6030 to 5297. [2019-12-19 02:09:33,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5297 states. [2019-12-19 02:09:33,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5297 states to 5297 states and 11663 transitions. [2019-12-19 02:09:33,716 INFO L78 Accepts]: Start accepts. Automaton has 5297 states and 11663 transitions. Word has length 96 [2019-12-19 02:09:33,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:33,716 INFO L462 AbstractCegarLoop]: Abstraction has 5297 states and 11663 transitions. [2019-12-19 02:09:33,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:33,717 INFO L276 IsEmpty]: Start isEmpty. Operand 5297 states and 11663 transitions. [2019-12-19 02:09:33,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:33,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:33,721 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, 1, 1, 1] [2019-12-19 02:09:33,722 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:33,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:33,722 INFO L82 PathProgramCache]: Analyzing trace with hash 568283355, now seen corresponding path program 1 times [2019-12-19 02:09:33,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:33,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211222610] [2019-12-19 02:09:33,722 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:33,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:33,781 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 02:09:33,781 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211222610] [2019-12-19 02:09:33,781 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:33,782 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:33,782 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510706566] [2019-12-19 02:09:33,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:33,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:33,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:33,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:33,783 INFO L87 Difference]: Start difference. First operand 5297 states and 11663 transitions. Second operand 5 states. [2019-12-19 02:09:33,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:33,903 INFO L93 Difference]: Finished difference Result 5706 states and 12546 transitions. [2019-12-19 02:09:33,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:09:33,903 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-12-19 02:09:33,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:33,913 INFO L225 Difference]: With dead ends: 5706 [2019-12-19 02:09:33,913 INFO L226 Difference]: Without dead ends: 5706 [2019-12-19 02:09:33,913 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 02:09:33,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5706 states. [2019-12-19 02:09:33,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5706 to 4397. [2019-12-19 02:09:33,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4397 states. [2019-12-19 02:09:34,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4397 states to 4397 states and 9665 transitions. [2019-12-19 02:09:34,004 INFO L78 Accepts]: Start accepts. Automaton has 4397 states and 9665 transitions. Word has length 98 [2019-12-19 02:09:34,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:34,004 INFO L462 AbstractCegarLoop]: Abstraction has 4397 states and 9665 transitions. [2019-12-19 02:09:34,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:34,005 INFO L276 IsEmpty]: Start isEmpty. Operand 4397 states and 9665 transitions. [2019-12-19 02:09:34,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:34,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:34,013 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, 1, 1, 1] [2019-12-19 02:09:34,013 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:34,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:34,014 INFO L82 PathProgramCache]: Analyzing trace with hash 579599482, now seen corresponding path program 1 times [2019-12-19 02:09:34,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:34,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052780837] [2019-12-19 02:09:34,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:34,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:34,139 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 02:09:34,139 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052780837] [2019-12-19 02:09:34,140 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:34,140 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:34,140 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994301898] [2019-12-19 02:09:34,141 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:34,141 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:34,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:34,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:34,142 INFO L87 Difference]: Start difference. First operand 4397 states and 9665 transitions. Second operand 6 states. [2019-12-19 02:09:34,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:34,361 INFO L93 Difference]: Finished difference Result 4883 states and 10656 transitions. [2019-12-19 02:09:34,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:09:34,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-19 02:09:34,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:34,370 INFO L225 Difference]: With dead ends: 4883 [2019-12-19 02:09:34,370 INFO L226 Difference]: Without dead ends: 4883 [2019-12-19 02:09:34,371 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 02:09:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4883 states. [2019-12-19 02:09:34,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4883 to 4293. [2019-12-19 02:09:34,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4293 states. [2019-12-19 02:09:34,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4293 states to 4293 states and 9478 transitions. [2019-12-19 02:09:34,438 INFO L78 Accepts]: Start accepts. Automaton has 4293 states and 9478 transitions. Word has length 98 [2019-12-19 02:09:34,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:34,438 INFO L462 AbstractCegarLoop]: Abstraction has 4293 states and 9478 transitions. [2019-12-19 02:09:34,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 4293 states and 9478 transitions. [2019-12-19 02:09:34,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:34,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:34,445 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, 1, 1, 1] [2019-12-19 02:09:34,445 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:34,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:34,445 INFO L82 PathProgramCache]: Analyzing trace with hash 2041249915, now seen corresponding path program 1 times [2019-12-19 02:09:34,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:34,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469186311] [2019-12-19 02:09:34,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:34,501 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 02:09:34,501 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469186311] [2019-12-19 02:09:34,501 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:34,502 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-19 02:09:34,502 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529811049] [2019-12-19 02:09:34,502 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-19 02:09:34,502 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:34,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-19 02:09:34,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-19 02:09:34,503 INFO L87 Difference]: Start difference. First operand 4293 states and 9478 transitions. Second operand 4 states. [2019-12-19 02:09:34,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:34,740 INFO L93 Difference]: Finished difference Result 5464 states and 12023 transitions. [2019-12-19 02:09:34,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-19 02:09:34,741 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-12-19 02:09:34,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:34,747 INFO L225 Difference]: With dead ends: 5464 [2019-12-19 02:09:34,747 INFO L226 Difference]: Without dead ends: 5426 [2019-12-19 02:09:34,747 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 02:09:34,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5426 states. [2019-12-19 02:09:34,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5426 to 5141. [2019-12-19 02:09:34,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5141 states. [2019-12-19 02:09:34,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5141 states to 5141 states and 11323 transitions. [2019-12-19 02:09:34,796 INFO L78 Accepts]: Start accepts. Automaton has 5141 states and 11323 transitions. Word has length 98 [2019-12-19 02:09:34,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:34,796 INFO L462 AbstractCegarLoop]: Abstraction has 5141 states and 11323 transitions. [2019-12-19 02:09:34,796 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-19 02:09:34,797 INFO L276 IsEmpty]: Start isEmpty. Operand 5141 states and 11323 transitions. [2019-12-19 02:09:34,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:34,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:34,802 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, 1, 1, 1] [2019-12-19 02:09:34,803 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:34,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:34,803 INFO L82 PathProgramCache]: Analyzing trace with hash -35959428, now seen corresponding path program 1 times [2019-12-19 02:09:34,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:34,804 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864475050] [2019-12-19 02:09:34,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:34,907 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 02:09:34,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864475050] [2019-12-19 02:09:34,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:34,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-19 02:09:34,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103106541] [2019-12-19 02:09:34,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-19 02:09:34,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:34,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-19 02:09:34,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:09:34,909 INFO L87 Difference]: Start difference. First operand 5141 states and 11323 transitions. Second operand 7 states. [2019-12-19 02:09:35,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:35,051 INFO L93 Difference]: Finished difference Result 5936 states and 12970 transitions. [2019-12-19 02:09:35,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:09:35,052 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 98 [2019-12-19 02:09:35,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:35,058 INFO L225 Difference]: With dead ends: 5936 [2019-12-19 02:09:35,058 INFO L226 Difference]: Without dead ends: 5936 [2019-12-19 02:09:35,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:09:35,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5936 states. [2019-12-19 02:09:35,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5936 to 4961. [2019-12-19 02:09:35,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4961 states. [2019-12-19 02:09:35,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4961 states to 4961 states and 10845 transitions. [2019-12-19 02:09:35,107 INFO L78 Accepts]: Start accepts. Automaton has 4961 states and 10845 transitions. Word has length 98 [2019-12-19 02:09:35,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:35,107 INFO L462 AbstractCegarLoop]: Abstraction has 4961 states and 10845 transitions. [2019-12-19 02:09:35,107 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-19 02:09:35,108 INFO L276 IsEmpty]: Start isEmpty. Operand 4961 states and 10845 transitions. [2019-12-19 02:09:35,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:35,112 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:35,112 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, 1, 1, 1] [2019-12-19 02:09:35,113 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:35,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:35,113 INFO L82 PathProgramCache]: Analyzing trace with hash 175391485, now seen corresponding path program 1 times [2019-12-19 02:09:35,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:35,113 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971641664] [2019-12-19 02:09:35,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:35,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:35,293 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 02:09:35,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971641664] [2019-12-19 02:09:35,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:35,294 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-19 02:09:35,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718811115] [2019-12-19 02:09:35,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-19 02:09:35,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:35,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-19 02:09:35,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-12-19 02:09:35,296 INFO L87 Difference]: Start difference. First operand 4961 states and 10845 transitions. Second operand 10 states. [2019-12-19 02:09:35,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:35,927 INFO L93 Difference]: Finished difference Result 15160 states and 33702 transitions. [2019-12-19 02:09:35,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-19 02:09:35,928 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 98 [2019-12-19 02:09:35,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:35,941 INFO L225 Difference]: With dead ends: 15160 [2019-12-19 02:09:35,941 INFO L226 Difference]: Without dead ends: 9993 [2019-12-19 02:09:35,943 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 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 02:09:35,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9993 states. [2019-12-19 02:09:36,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9993 to 4971. [2019-12-19 02:09:36,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4971 states. [2019-12-19 02:09:36,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4971 states to 4971 states and 10783 transitions. [2019-12-19 02:09:36,046 INFO L78 Accepts]: Start accepts. Automaton has 4971 states and 10783 transitions. Word has length 98 [2019-12-19 02:09:36,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:36,046 INFO L462 AbstractCegarLoop]: Abstraction has 4971 states and 10783 transitions. [2019-12-19 02:09:36,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-19 02:09:36,047 INFO L276 IsEmpty]: Start isEmpty. Operand 4971 states and 10783 transitions. [2019-12-19 02:09:36,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:36,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:36,054 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 02:09:36,054 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:36,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:36,055 INFO L82 PathProgramCache]: Analyzing trace with hash -1383760123, now seen corresponding path program 1 times [2019-12-19 02:09:36,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:36,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332671832] [2019-12-19 02:09:36,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:36,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:36,199 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 02:09:36,199 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332671832] [2019-12-19 02:09:36,199 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:36,199 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:36,200 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64354964] [2019-12-19 02:09:36,200 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:36,200 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:36,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:36,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:36,201 INFO L87 Difference]: Start difference. First operand 4971 states and 10783 transitions. Second operand 5 states. [2019-12-19 02:09:36,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:36,501 INFO L93 Difference]: Finished difference Result 4343 states and 9366 transitions. [2019-12-19 02:09:36,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-19 02:09:36,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-12-19 02:09:36,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:36,506 INFO L225 Difference]: With dead ends: 4343 [2019-12-19 02:09:36,506 INFO L226 Difference]: Without dead ends: 4343 [2019-12-19 02:09:36,507 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:36,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4343 states. [2019-12-19 02:09:36,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4343 to 3995. [2019-12-19 02:09:36,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3995 states. [2019-12-19 02:09:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3995 states to 3995 states and 8658 transitions. [2019-12-19 02:09:36,546 INFO L78 Accepts]: Start accepts. Automaton has 3995 states and 8658 transitions. Word has length 98 [2019-12-19 02:09:36,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:36,546 INFO L462 AbstractCegarLoop]: Abstraction has 3995 states and 8658 transitions. [2019-12-19 02:09:36,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:36,546 INFO L276 IsEmpty]: Start isEmpty. Operand 3995 states and 8658 transitions. [2019-12-19 02:09:36,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:36,550 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:36,550 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, 1, 1, 1] [2019-12-19 02:09:36,551 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:36,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:36,551 INFO L82 PathProgramCache]: Analyzing trace with hash -919272570, now seen corresponding path program 1 times [2019-12-19 02:09:36,551 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:36,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673668619] [2019-12-19 02:09:36,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:36,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:36,671 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 02:09:36,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673668619] [2019-12-19 02:09:36,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:36,672 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:36,672 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182386118] [2019-12-19 02:09:36,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:36,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:36,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:36,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:36,673 INFO L87 Difference]: Start difference. First operand 3995 states and 8658 transitions. Second operand 6 states. [2019-12-19 02:09:36,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:36,837 INFO L93 Difference]: Finished difference Result 4582 states and 9854 transitions. [2019-12-19 02:09:36,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-19 02:09:36,837 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-19 02:09:36,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:36,843 INFO L225 Difference]: With dead ends: 4582 [2019-12-19 02:09:36,843 INFO L226 Difference]: Without dead ends: 4553 [2019-12-19 02:09:36,844 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-12-19 02:09:36,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4553 states. [2019-12-19 02:09:36,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4553 to 4000. [2019-12-19 02:09:36,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4000 states. [2019-12-19 02:09:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4000 states to 4000 states and 8611 transitions. [2019-12-19 02:09:36,915 INFO L78 Accepts]: Start accepts. Automaton has 4000 states and 8611 transitions. Word has length 98 [2019-12-19 02:09:36,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:36,915 INFO L462 AbstractCegarLoop]: Abstraction has 4000 states and 8611 transitions. [2019-12-19 02:09:36,916 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:36,916 INFO L276 IsEmpty]: Start isEmpty. Operand 4000 states and 8611 transitions. [2019-12-19 02:09:36,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:36,922 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:36,922 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, 1, 1, 1] [2019-12-19 02:09:36,923 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:36,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:36,924 INFO L82 PathProgramCache]: Analyzing trace with hash 633647940, now seen corresponding path program 1 times [2019-12-19 02:09:36,924 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:36,924 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640343105] [2019-12-19 02:09:36,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:37,007 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 02:09:37,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640343105] [2019-12-19 02:09:37,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:37,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-19 02:09:37,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176049465] [2019-12-19 02:09:37,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-19 02:09:37,008 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:37,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-19 02:09:37,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-19 02:09:37,009 INFO L87 Difference]: Start difference. First operand 4000 states and 8611 transitions. Second operand 5 states. [2019-12-19 02:09:37,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:37,250 INFO L93 Difference]: Finished difference Result 4731 states and 10131 transitions. [2019-12-19 02:09:37,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:37,251 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-12-19 02:09:37,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:37,257 INFO L225 Difference]: With dead ends: 4731 [2019-12-19 02:09:37,257 INFO L226 Difference]: Without dead ends: 4670 [2019-12-19 02:09:37,258 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 02:09:37,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4670 states. [2019-12-19 02:09:37,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4670 to 4155. [2019-12-19 02:09:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4155 states. [2019-12-19 02:09:37,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4155 states to 4155 states and 8933 transitions. [2019-12-19 02:09:37,323 INFO L78 Accepts]: Start accepts. Automaton has 4155 states and 8933 transitions. Word has length 98 [2019-12-19 02:09:37,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:37,323 INFO L462 AbstractCegarLoop]: Abstraction has 4155 states and 8933 transitions. [2019-12-19 02:09:37,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-19 02:09:37,323 INFO L276 IsEmpty]: Start isEmpty. Operand 4155 states and 8933 transitions. [2019-12-19 02:09:37,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:37,328 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:37,328 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, 1, 1, 1] [2019-12-19 02:09:37,329 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:37,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:37,329 INFO L82 PathProgramCache]: Analyzing trace with hash -750459706, now seen corresponding path program 2 times [2019-12-19 02:09:37,329 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:37,330 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066746332] [2019-12-19 02:09:37,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-19 02:09:37,404 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 02:09:37,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066746332] [2019-12-19 02:09:37,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-19 02:09:37,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-19 02:09:37,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768952548] [2019-12-19 02:09:37,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-19 02:09:37,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-19 02:09:37,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-19 02:09:37,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-19 02:09:37,406 INFO L87 Difference]: Start difference. First operand 4155 states and 8933 transitions. Second operand 6 states. [2019-12-19 02:09:37,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-19 02:09:37,637 INFO L93 Difference]: Finished difference Result 4247 states and 9116 transitions. [2019-12-19 02:09:37,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-19 02:09:37,638 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 98 [2019-12-19 02:09:37,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-19 02:09:37,645 INFO L225 Difference]: With dead ends: 4247 [2019-12-19 02:09:37,645 INFO L226 Difference]: Without dead ends: 4247 [2019-12-19 02:09:37,645 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-12-19 02:09:37,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4247 states. [2019-12-19 02:09:37,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4247 to 4085. [2019-12-19 02:09:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4085 states. [2019-12-19 02:09:37,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4085 states to 4085 states and 8782 transitions. [2019-12-19 02:09:37,724 INFO L78 Accepts]: Start accepts. Automaton has 4085 states and 8782 transitions. Word has length 98 [2019-12-19 02:09:37,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-19 02:09:37,725 INFO L462 AbstractCegarLoop]: Abstraction has 4085 states and 8782 transitions. [2019-12-19 02:09:37,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-19 02:09:37,725 INFO L276 IsEmpty]: Start isEmpty. Operand 4085 states and 8782 transitions. [2019-12-19 02:09:37,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-19 02:09:37,732 INFO L403 BasicCegarLoop]: Found error trace [2019-12-19 02:09:37,732 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, 1, 1, 1] [2019-12-19 02:09:37,732 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-19 02:09:37,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-19 02:09:37,732 INFO L82 PathProgramCache]: Analyzing trace with hash -589506809, now seen corresponding path program 2 times [2019-12-19 02:09:37,733 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-19 02:09:37,733 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338694178] [2019-12-19 02:09:37,733 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-19 02:09:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:09:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-19 02:09:37,867 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-19 02:09:37,868 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-19 02:09:38,172 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.12 02:09:38 BasicIcfg [2019-12-19 02:09:38,172 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-19 02:09:38,182 INFO L168 Benchmark]: Toolchain (without parser) took 44251.88 ms. Allocated memory was 136.3 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 100.0 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 920.5 MB. Max. memory is 7.1 GB. [2019-12-19 02:09:38,183 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-19 02:09:38,183 INFO L168 Benchmark]: CACSL2BoogieTranslator took 795.33 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 99.6 MB in the beginning and 156.2 MB in the end (delta: -56.7 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. [2019-12-19 02:09:38,186 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.47 ms. Allocated memory is still 200.8 MB. Free memory was 156.2 MB in the beginning and 153.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. [2019-12-19 02:09:38,186 INFO L168 Benchmark]: Boogie Preprocessor took 56.64 ms. Allocated memory is still 200.8 MB. Free memory was 153.2 MB in the beginning and 151.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-12-19 02:09:38,187 INFO L168 Benchmark]: RCFGBuilder took 802.46 ms. Allocated memory is still 200.8 MB. Free memory was 151.1 MB in the beginning and 106.4 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. [2019-12-19 02:09:38,187 INFO L168 Benchmark]: TraceAbstraction took 42531.73 ms. Allocated memory was 200.8 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 106.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 862.5 MB. Max. memory is 7.1 GB. [2019-12-19 02:09:38,190 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 136.3 MB. Free memory was 119.5 MB in the beginning and 119.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 795.33 ms. Allocated memory was 136.3 MB in the beginning and 200.8 MB in the end (delta: 64.5 MB). Free memory was 99.6 MB in the beginning and 156.2 MB in the end (delta: -56.7 MB). Peak memory consumption was 27.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.47 ms. Allocated memory is still 200.8 MB. Free memory was 156.2 MB in the beginning and 153.2 MB in the end (delta: 3.0 MB). Peak memory consumption was 3.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 56.64 ms. Allocated memory is still 200.8 MB. Free memory was 153.2 MB in the beginning and 151.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 802.46 ms. Allocated memory is still 200.8 MB. Free memory was 151.1 MB in the beginning and 106.4 MB in the end (delta: 44.7 MB). Peak memory consumption was 44.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42531.73 ms. Allocated memory was 200.8 MB in the beginning and 2.1 GB in the end (delta: 1.9 GB). Free memory was 106.4 MB in the beginning and 1.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 862.5 MB. 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L698] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L700] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L701] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L702] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L704] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L708] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L709] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L710] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L711] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L712] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L713] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L714] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0] [L715] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L716] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L717] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0] [L718] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L719] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L720] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L721] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L722] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L723] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L724] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L803] 0 pthread_t t905; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L804] FCALL, FORK 0 pthread_create(&t905, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L805] 0 pthread_t t906; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L728] 1 z$w_buff1 = z$w_buff0 [L729] 1 z$w_buff0 = 1 [L730] 1 z$w_buff1_used = z$w_buff0_used [L731] 1 z$w_buff0_used = (_Bool)1 [L806] FCALL, FORK 0 pthread_create(&t906, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L734] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L735] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 1 [L759] 2 y = 1 [L762] 2 __unbuffered_p1_EAX = y [L765] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L766] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L767] 2 z$flush_delayed = weak$$choice2 [L768] 2 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] EXPR 2 !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L769] 2 z = !z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff1) [L770] EXPR 2 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : z$w_buff0)) [L771] EXPR 2 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff1 : z$w_buff1)) [L772] EXPR 2 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used)) [L773] EXPR 2 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L774] EXPR 2 weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 z$r_buff0_thd2 = weak$$choice2 ? z$r_buff0_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff0_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2)) [L775] EXPR 2 weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 z$r_buff1_thd2 = weak$$choice2 ? z$r_buff1_thd2 : (!z$w_buff0_used || !z$r_buff0_thd2 && !z$w_buff1_used || !z$r_buff0_thd2 && !z$r_buff1_thd2 ? z$r_buff1_thd2 : (z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L776] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] EXPR 2 z$flush_delayed ? z$mem_tmp : z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$flush_delayed ? z$mem_tmp : z=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 2 z = z$flush_delayed ? z$mem_tmp : z [L778] 2 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L745] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L745] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L781] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=1] [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=1, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=1] [L781] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L782] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L783] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L783] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L784] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L784] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L785] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L788] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L808] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L812] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L813] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L813] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L814] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L814] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L816] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L816] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L819] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 143 locations, 2 error locations. Result: UNSAFE, OverallTime: 42.0s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 15.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9115 SDtfs, 9437 SDslu, 18984 SDs, 0 SdLazy, 6704 SolverSat, 450 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 7.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 298 GetRequests, 88 SyntacticMatches, 22 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71014occurred 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: 18.5s AutomataMinimizationTime, 33 MinimizatonAttempts, 73260 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2538 NumberOfCodeBlocks, 2538 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2407 ConstructedInterpolants, 0 QuantifiedInterpolants, 462379 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 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...