/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-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-28 03:38:23,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-28 03:38:23,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-28 03:38:23,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-28 03:38:23,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-28 03:38:23,761 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-28 03:38:23,763 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-28 03:38:23,765 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-28 03:38:23,766 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-28 03:38:23,767 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-28 03:38:23,768 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-28 03:38:23,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-28 03:38:23,770 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-28 03:38:23,770 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-28 03:38:23,771 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-28 03:38:23,772 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-28 03:38:23,773 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-28 03:38:23,774 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-28 03:38:23,776 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-28 03:38:23,777 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-28 03:38:23,779 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-28 03:38:23,780 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-28 03:38:23,781 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-28 03:38:23,782 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-28 03:38:23,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-28 03:38:23,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-28 03:38:23,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-28 03:38:23,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-28 03:38:23,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-28 03:38:23,787 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-28 03:38:23,787 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-28 03:38:23,788 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-28 03:38:23,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-28 03:38:23,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-28 03:38:23,790 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-28 03:38:23,790 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-28 03:38:23,791 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-28 03:38:23,791 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-28 03:38:23,791 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-28 03:38:23,792 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-28 03:38:23,793 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-28 03:38:23,794 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-MCR.epf [2019-12-28 03:38:23,808 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-28 03:38:23,808 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-28 03:38:23,809 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-28 03:38:23,809 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-28 03:38:23,809 INFO L138 SettingsManager]: * Use SBE=true [2019-12-28 03:38:23,810 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-28 03:38:23,810 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-28 03:38:23,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-28 03:38:23,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-28 03:38:23,810 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-28 03:38:23,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-28 03:38:23,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-28 03:38:23,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-28 03:38:23,811 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-28 03:38:23,811 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-28 03:38:23,812 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-28 03:38:23,812 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-28 03:38:23,812 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-28 03:38:23,812 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-28 03:38:23,812 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-28 03:38:23,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-28 03:38:23,813 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-28 03:38:23,813 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-28 03:38:23,813 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-28 03:38:23,813 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-28 03:38:23,814 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-28 03:38:23,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-28 03:38:23,814 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-28 03:38:23,814 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2019-12-28 03:38:23,814 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-28 03:38:23,815 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-28 03:38:23,815 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-28 03:38:24,174 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-28 03:38:24,189 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-28 03:38:24,193 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-28 03:38:24,195 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-28 03:38:24,196 INFO L275 PluginConnector]: CDTParser initialized [2019-12-28 03:38:24,196 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2019-12-28 03:38:24,260 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a28a72d/2e565260cca14080a95c1de2650d045d/FLAG850a61778 [2019-12-28 03:38:24,777 INFO L306 CDTParser]: Found 1 translation units. [2019-12-28 03:38:24,778 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi000_pso.opt.i [2019-12-28 03:38:24,794 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a28a72d/2e565260cca14080a95c1de2650d045d/FLAG850a61778 [2019-12-28 03:38:25,093 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71a28a72d/2e565260cca14080a95c1de2650d045d [2019-12-28 03:38:25,101 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-28 03:38:25,103 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-28 03:38:25,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-28 03:38:25,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-28 03:38:25,108 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-28 03:38:25,109 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:38:25" (1/1) ... [2019-12-28 03:38:25,112 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fdaac8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:38:25, skipping insertion in model container [2019-12-28 03:38:25,112 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 03:38:25" (1/1) ... [2019-12-28 03:38:25,119 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-28 03:38:25,184 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-28 03:38:25,717 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:38:25,735 INFO L203 MainTranslator]: Completed pre-run [2019-12-28 03:38:25,797 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-28 03:38:25,887 INFO L208 MainTranslator]: Completed translation [2019-12-28 03:38:25,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:38:25 WrapperNode [2019-12-28 03:38:25,888 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-28 03:38:25,889 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-28 03:38:25,890 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-28 03:38:25,891 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-28 03:38:25,901 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:38:25" (1/1) ... [2019-12-28 03:38:25,923 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:38:25" (1/1) ... [2019-12-28 03:38:25,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-28 03:38:25,961 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-28 03:38:25,961 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-28 03:38:25,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-28 03:38:25,972 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:38:25" (1/1) ... [2019-12-28 03:38:25,973 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:38:25" (1/1) ... [2019-12-28 03:38:25,981 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:38:25" (1/1) ... [2019-12-28 03:38:25,983 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:38:25" (1/1) ... [2019-12-28 03:38:26,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:38:25" (1/1) ... [2019-12-28 03:38:26,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:38:25" (1/1) ... [2019-12-28 03:38:26,017 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:38:25" (1/1) ... [2019-12-28 03:38:26,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-28 03:38:26,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-28 03:38:26,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-28 03:38:26,023 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-28 03:38:26,024 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:38:25" (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-28 03:38:26,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-28 03:38:26,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-28 03:38:26,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-28 03:38:26,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-28 03:38:26,095 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-28 03:38:26,095 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-28 03:38:26,095 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-28 03:38:26,096 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-28 03:38:26,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-28 03:38:26,096 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-28 03:38:26,096 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-28 03:38:26,098 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-28 03:38:26,840 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-28 03:38:26,841 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-28 03:38:26,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:38:26 BoogieIcfgContainer [2019-12-28 03:38:26,843 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-28 03:38:26,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-28 03:38:26,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-28 03:38:26,848 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-28 03:38:26,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 03:38:25" (1/3) ... [2019-12-28 03:38:26,849 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57557ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:38:26, skipping insertion in model container [2019-12-28 03:38:26,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 03:38:25" (2/3) ... [2019-12-28 03:38:26,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57557ae6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 03:38:26, skipping insertion in model container [2019-12-28 03:38:26,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 03:38:26" (3/3) ... [2019-12-28 03:38:26,852 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi000_pso.opt.i [2019-12-28 03:38:26,864 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-28 03:38:26,864 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-28 03:38:26,873 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-28 03:38:26,874 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-28 03:38:26,910 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,911 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,911 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,911 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,912 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,913 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,914 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,915 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,916 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,917 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,918 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,919 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,920 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,920 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,920 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,921 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,921 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,921 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,922 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,923 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,924 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,925 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,926 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,927 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,928 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,929 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,934 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,935 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,935 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,935 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,938 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,938 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,939 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,939 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,940 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,941 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-28 03:38:26,957 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-28 03:38:26,978 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-28 03:38:26,979 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-28 03:38:26,979 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-28 03:38:26,979 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-28 03:38:26,979 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-28 03:38:26,979 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-28 03:38:26,980 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-28 03:38:26,980 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-28 03:38:27,010 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 147 places, 181 transitions [2019-12-28 03:38:28,314 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22495 states. [2019-12-28 03:38:28,317 INFO L276 IsEmpty]: Start isEmpty. Operand 22495 states. [2019-12-28 03:38:28,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-12-28 03:38:28,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:38:28,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] [2019-12-28 03:38:28,329 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:38:28,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:38:28,335 INFO L82 PathProgramCache]: Analyzing trace with hash -2000435447, now seen corresponding path program 1 times [2019-12-28 03:38:28,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:38:28,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208143306] [2019-12-28 03:38:28,348 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:38:28,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:38:28,649 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-28 03:38:28,650 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208143306] [2019-12-28 03:38:28,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:38:28,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:38:28,652 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [280704635] [2019-12-28 03:38:28,653 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:38:28,660 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:38:28,680 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 39 states and 38 transitions. [2019-12-28 03:38:28,681 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:38:28,685 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:38:28,685 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:38:28,686 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:38:28,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:38:28,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:38:28,703 INFO L87 Difference]: Start difference. First operand 22495 states. Second operand 4 states. [2019-12-28 03:38:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:38:29,267 INFO L93 Difference]: Finished difference Result 23447 states and 91748 transitions. [2019-12-28 03:38:29,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:38:29,269 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-12-28 03:38:29,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:38:29,521 INFO L225 Difference]: With dead ends: 23447 [2019-12-28 03:38:29,522 INFO L226 Difference]: Without dead ends: 21271 [2019-12-28 03:38:29,527 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-28 03:38:30,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21271 states. [2019-12-28 03:38:31,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21271 to 21271. [2019-12-28 03:38:31,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21271 states. [2019-12-28 03:38:31,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21271 states to 21271 states and 83772 transitions. [2019-12-28 03:38:31,566 INFO L78 Accepts]: Start accepts. Automaton has 21271 states and 83772 transitions. Word has length 38 [2019-12-28 03:38:31,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:38:31,568 INFO L462 AbstractCegarLoop]: Abstraction has 21271 states and 83772 transitions. [2019-12-28 03:38:31,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:38:31,569 INFO L276 IsEmpty]: Start isEmpty. Operand 21271 states and 83772 transitions. [2019-12-28 03:38:31,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-12-28 03:38:31,582 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:38:31,583 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:38:31,583 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:38:31,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:38:31,584 INFO L82 PathProgramCache]: Analyzing trace with hash -1983291850, now seen corresponding path program 1 times [2019-12-28 03:38:31,584 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:38:31,585 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450699558] [2019-12-28 03:38:31,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:38:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:38:31,744 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-28 03:38:31,745 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450699558] [2019-12-28 03:38:31,745 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:38:31,746 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:38:31,746 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [259366100] [2019-12-28 03:38:31,746 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:38:31,757 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:38:31,772 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 74 states and 101 transitions. [2019-12-28 03:38:31,773 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:38:31,788 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:38:31,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:38:31,790 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:38:31,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:38:31,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:38:31,791 INFO L87 Difference]: Start difference. First operand 21271 states and 83772 transitions. Second operand 5 states. [2019-12-28 03:38:32,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:38:32,893 INFO L93 Difference]: Finished difference Result 34705 states and 129064 transitions. [2019-12-28 03:38:32,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:38:32,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-12-28 03:38:32,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:38:33,048 INFO L225 Difference]: With dead ends: 34705 [2019-12-28 03:38:33,048 INFO L226 Difference]: Without dead ends: 34561 [2019-12-28 03:38:33,049 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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-28 03:38:33,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34561 states. [2019-12-28 03:38:35,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34561 to 33061. [2019-12-28 03:38:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33061 states. [2019-12-28 03:38:35,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33061 states to 33061 states and 123952 transitions. [2019-12-28 03:38:35,540 INFO L78 Accepts]: Start accepts. Automaton has 33061 states and 123952 transitions. Word has length 45 [2019-12-28 03:38:35,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:38:35,544 INFO L462 AbstractCegarLoop]: Abstraction has 33061 states and 123952 transitions. [2019-12-28 03:38:35,544 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:38:35,544 INFO L276 IsEmpty]: Start isEmpty. Operand 33061 states and 123952 transitions. [2019-12-28 03:38:35,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-12-28 03:38:35,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:38:35,551 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:38:35,552 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:38:35,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:38:35,552 INFO L82 PathProgramCache]: Analyzing trace with hash -523564923, now seen corresponding path program 1 times [2019-12-28 03:38:35,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:38:35,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593347103] [2019-12-28 03:38:35,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:38:35,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:38:35,653 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-28 03:38:35,654 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593347103] [2019-12-28 03:38:35,654 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:38:35,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:38:35,655 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1139702760] [2019-12-28 03:38:35,655 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:38:35,659 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:38:35,663 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 47 states and 46 transitions. [2019-12-28 03:38:35,663 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:38:35,664 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:38:35,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:38:35,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:38:35,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:38:35,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:38:35,665 INFO L87 Difference]: Start difference. First operand 33061 states and 123952 transitions. Second operand 5 states. [2019-12-28 03:38:36,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:38:36,291 INFO L93 Difference]: Finished difference Result 40213 states and 148621 transitions. [2019-12-28 03:38:36,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:38:36,291 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-12-28 03:38:36,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:38:36,419 INFO L225 Difference]: With dead ends: 40213 [2019-12-28 03:38:36,420 INFO L226 Difference]: Without dead ends: 40053 [2019-12-28 03:38:36,421 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-28 03:38:37,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40053 states. [2019-12-28 03:38:39,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40053 to 34634. [2019-12-28 03:38:39,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34634 states. [2019-12-28 03:38:39,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34634 states to 34634 states and 129248 transitions. [2019-12-28 03:38:39,432 INFO L78 Accepts]: Start accepts. Automaton has 34634 states and 129248 transitions. Word has length 46 [2019-12-28 03:38:39,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:38:39,433 INFO L462 AbstractCegarLoop]: Abstraction has 34634 states and 129248 transitions. [2019-12-28 03:38:39,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:38:39,433 INFO L276 IsEmpty]: Start isEmpty. Operand 34634 states and 129248 transitions. [2019-12-28 03:38:39,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-12-28 03:38:39,445 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:38:39,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] [2019-12-28 03:38:39,445 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:38:39,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:38:39,446 INFO L82 PathProgramCache]: Analyzing trace with hash 207237168, now seen corresponding path program 1 times [2019-12-28 03:38:39,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:38:39,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748458075] [2019-12-28 03:38:39,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:38:39,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:38:39,538 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-28 03:38:39,538 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748458075] [2019-12-28 03:38:39,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:38:39,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:38:39,539 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2140646084] [2019-12-28 03:38:39,539 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:38:39,546 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:38:39,560 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 117 states and 179 transitions. [2019-12-28 03:38:39,560 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:38:39,562 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:38:39,562 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:38:39,562 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:38:39,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:38:39,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:38:39,563 INFO L87 Difference]: Start difference. First operand 34634 states and 129248 transitions. Second operand 6 states. [2019-12-28 03:38:40,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:38:40,717 INFO L93 Difference]: Finished difference Result 45662 states and 166142 transitions. [2019-12-28 03:38:40,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-28 03:38:40,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-12-28 03:38:40,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:38:40,842 INFO L225 Difference]: With dead ends: 45662 [2019-12-28 03:38:40,842 INFO L226 Difference]: Without dead ends: 45518 [2019-12-28 03:38:40,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-12-28 03:38:41,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45518 states. [2019-12-28 03:38:43,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45518 to 33597. [2019-12-28 03:38:43,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33597 states. [2019-12-28 03:38:43,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33597 states to 33597 states and 125403 transitions. [2019-12-28 03:38:43,406 INFO L78 Accepts]: Start accepts. Automaton has 33597 states and 125403 transitions. Word has length 53 [2019-12-28 03:38:43,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:38:43,406 INFO L462 AbstractCegarLoop]: Abstraction has 33597 states and 125403 transitions. [2019-12-28 03:38:43,407 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:38:43,407 INFO L276 IsEmpty]: Start isEmpty. Operand 33597 states and 125403 transitions. [2019-12-28 03:38:43,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-28 03:38:43,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:38:43,440 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:38:43,440 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:38:43,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:38:43,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1087106870, now seen corresponding path program 1 times [2019-12-28 03:38:43,441 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:38:43,441 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147373038] [2019-12-28 03:38:43,441 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:38:43,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:38:43,601 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-28 03:38:43,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147373038] [2019-12-28 03:38:43,602 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:38:43,602 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:38:43,602 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1230611800] [2019-12-28 03:38:43,602 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:38:43,611 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:38:43,622 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 60 transitions. [2019-12-28 03:38:43,622 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:38:43,622 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:38:43,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:38:43,623 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:38:43,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:38:43,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:38:43,624 INFO L87 Difference]: Start difference. First operand 33597 states and 125403 transitions. Second operand 6 states. [2019-12-28 03:38:44,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:38:44,350 INFO L93 Difference]: Finished difference Result 46069 states and 167836 transitions. [2019-12-28 03:38:44,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:38:44,350 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-12-28 03:38:44,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:38:44,485 INFO L225 Difference]: With dead ends: 46069 [2019-12-28 03:38:44,486 INFO L226 Difference]: Without dead ends: 45829 [2019-12-28 03:38:44,486 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:38:45,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45829 states. [2019-12-28 03:38:45,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45829 to 39958. [2019-12-28 03:38:45,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39958 states. [2019-12-28 03:38:45,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39958 states to 39958 states and 147327 transitions. [2019-12-28 03:38:45,646 INFO L78 Accepts]: Start accepts. Automaton has 39958 states and 147327 transitions. Word has length 60 [2019-12-28 03:38:45,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:38:45,647 INFO L462 AbstractCegarLoop]: Abstraction has 39958 states and 147327 transitions. [2019-12-28 03:38:45,647 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:38:45,647 INFO L276 IsEmpty]: Start isEmpty. Operand 39958 states and 147327 transitions. [2019-12-28 03:38:45,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2019-12-28 03:38:45,683 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:38:45,683 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] [2019-12-28 03:38:45,683 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:38:45,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:38:45,684 INFO L82 PathProgramCache]: Analyzing trace with hash -2146511321, now seen corresponding path program 1 times [2019-12-28 03:38:45,684 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:38:45,684 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682397387] [2019-12-28 03:38:45,685 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:38:45,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:38:45,735 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-28 03:38:45,736 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682397387] [2019-12-28 03:38:45,736 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:38:45,736 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:38:45,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [623860540] [2019-12-28 03:38:45,737 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:38:45,746 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:38:46,052 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 63 states and 62 transitions. [2019-12-28 03:38:46,053 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:38:46,053 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:38:46,053 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:38:46,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:38:46,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:38:46,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:38:46,054 INFO L87 Difference]: Start difference. First operand 39958 states and 147327 transitions. Second operand 3 states. [2019-12-28 03:38:46,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:38:46,295 INFO L93 Difference]: Finished difference Result 50256 states and 182162 transitions. [2019-12-28 03:38:46,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:38:46,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2019-12-28 03:38:46,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:38:46,416 INFO L225 Difference]: With dead ends: 50256 [2019-12-28 03:38:46,416 INFO L226 Difference]: Without dead ends: 50256 [2019-12-28 03:38:46,417 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-28 03:38:46,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50256 states. [2019-12-28 03:38:48,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50256 to 43888. [2019-12-28 03:38:48,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43888 states. [2019-12-28 03:38:48,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43888 states to 43888 states and 160765 transitions. [2019-12-28 03:38:48,912 INFO L78 Accepts]: Start accepts. Automaton has 43888 states and 160765 transitions. Word has length 62 [2019-12-28 03:38:48,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:38:48,913 INFO L462 AbstractCegarLoop]: Abstraction has 43888 states and 160765 transitions. [2019-12-28 03:38:48,913 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:38:48,913 INFO L276 IsEmpty]: Start isEmpty. Operand 43888 states and 160765 transitions. [2019-12-28 03:38:48,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-28 03:38:48,948 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:38:48,948 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-28 03:38:48,948 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:38:48,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:38:48,949 INFO L82 PathProgramCache]: Analyzing trace with hash 388648113, now seen corresponding path program 1 times [2019-12-28 03:38:48,949 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:38:48,950 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124852977] [2019-12-28 03:38:48,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:38:48,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:38:49,039 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-28 03:38:49,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124852977] [2019-12-28 03:38:49,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:38:49,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:38:49,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [324460776] [2019-12-28 03:38:49,041 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:38:49,051 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:38:49,063 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 66 transitions. [2019-12-28 03:38:49,064 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:38:49,064 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:38:49,065 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:38:49,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:38:49,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:38:49,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:38:49,065 INFO L87 Difference]: Start difference. First operand 43888 states and 160765 transitions. Second operand 7 states. [2019-12-28 03:38:50,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:38:50,060 INFO L93 Difference]: Finished difference Result 55884 states and 200499 transitions. [2019-12-28 03:38:50,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 03:38:50,061 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-28 03:38:50,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:38:50,585 INFO L225 Difference]: With dead ends: 55884 [2019-12-28 03:38:50,585 INFO L226 Difference]: Without dead ends: 55644 [2019-12-28 03:38:50,586 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-12-28 03:38:50,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55644 states. [2019-12-28 03:38:51,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55644 to 45114. [2019-12-28 03:38:51,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45114 states. [2019-12-28 03:38:51,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45114 states to 45114 states and 164932 transitions. [2019-12-28 03:38:51,398 INFO L78 Accepts]: Start accepts. Automaton has 45114 states and 164932 transitions. Word has length 66 [2019-12-28 03:38:51,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:38:51,398 INFO L462 AbstractCegarLoop]: Abstraction has 45114 states and 164932 transitions. [2019-12-28 03:38:51,398 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:38:51,398 INFO L276 IsEmpty]: Start isEmpty. Operand 45114 states and 164932 transitions. [2019-12-28 03:38:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-28 03:38:51,432 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:38:51,432 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-28 03:38:51,433 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:38:51,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:38:51,433 INFO L82 PathProgramCache]: Analyzing trace with hash -119877727, now seen corresponding path program 1 times [2019-12-28 03:38:51,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:38:51,434 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442804953] [2019-12-28 03:38:51,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:38:51,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:38:51,926 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-28 03:38:51,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442804953] [2019-12-28 03:38:51,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:38:51,927 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:38:51,927 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1379897667] [2019-12-28 03:38:51,927 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:38:51,939 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:38:51,969 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 131 states and 191 transitions. [2019-12-28 03:38:51,969 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:38:51,970 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:38:51,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:38:51,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:38:51,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:38:51,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:38:51,972 INFO L87 Difference]: Start difference. First operand 45114 states and 164932 transitions. Second operand 7 states. [2019-12-28 03:38:53,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:38:53,122 INFO L93 Difference]: Finished difference Result 55098 states and 197676 transitions. [2019-12-28 03:38:53,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 03:38:53,122 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 67 [2019-12-28 03:38:53,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:38:53,240 INFO L225 Difference]: With dead ends: 55098 [2019-12-28 03:38:53,241 INFO L226 Difference]: Without dead ends: 54898 [2019-12-28 03:38:53,241 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-12-28 03:38:53,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54898 states. [2019-12-28 03:38:55,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54898 to 45992. [2019-12-28 03:38:55,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45992 states. [2019-12-28 03:38:55,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45992 states to 45992 states and 167803 transitions. [2019-12-28 03:38:55,982 INFO L78 Accepts]: Start accepts. Automaton has 45992 states and 167803 transitions. Word has length 67 [2019-12-28 03:38:55,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:38:55,982 INFO L462 AbstractCegarLoop]: Abstraction has 45992 states and 167803 transitions. [2019-12-28 03:38:55,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:38:55,983 INFO L276 IsEmpty]: Start isEmpty. Operand 45992 states and 167803 transitions. [2019-12-28 03:38:56,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:38:56,015 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:38:56,016 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-28 03:38:56,016 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:38:56,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:38:56,016 INFO L82 PathProgramCache]: Analyzing trace with hash 847444268, now seen corresponding path program 1 times [2019-12-28 03:38:56,016 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:38:56,017 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781801863] [2019-12-28 03:38:56,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:38:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:38:56,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-28 03:38:56,061 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781801863] [2019-12-28 03:38:56,062 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:38:56,062 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:38:56,062 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [898515359] [2019-12-28 03:38:56,062 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:38:56,072 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:38:56,085 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 73 transitions. [2019-12-28 03:38:56,085 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:38:56,086 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:38:56,086 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:38:56,086 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:38:56,087 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:38:56,087 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:38:56,087 INFO L87 Difference]: Start difference. First operand 45992 states and 167803 transitions. Second operand 3 states. [2019-12-28 03:38:56,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:38:56,534 INFO L93 Difference]: Finished difference Result 61486 states and 224137 transitions. [2019-12-28 03:38:56,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:38:56,534 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 69 [2019-12-28 03:38:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:38:56,679 INFO L225 Difference]: With dead ends: 61486 [2019-12-28 03:38:56,679 INFO L226 Difference]: Without dead ends: 61486 [2019-12-28 03:38:56,679 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-28 03:38:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61486 states. [2019-12-28 03:38:57,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61486 to 53433. [2019-12-28 03:38:57,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53433 states. [2019-12-28 03:38:58,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53433 states to 53433 states and 195616 transitions. [2019-12-28 03:38:58,088 INFO L78 Accepts]: Start accepts. Automaton has 53433 states and 195616 transitions. Word has length 69 [2019-12-28 03:38:58,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:38:58,088 INFO L462 AbstractCegarLoop]: Abstraction has 53433 states and 195616 transitions. [2019-12-28 03:38:58,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:38:58,088 INFO L276 IsEmpty]: Start isEmpty. Operand 53433 states and 195616 transitions. [2019-12-28 03:38:58,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:38:58,137 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:38:58,137 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-28 03:38:58,137 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:38:58,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:38:58,138 INFO L82 PathProgramCache]: Analyzing trace with hash -1922866772, now seen corresponding path program 1 times [2019-12-28 03:38:58,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:38:58,139 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452795657] [2019-12-28 03:38:58,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:38:58,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:38:58,257 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-28 03:38:58,258 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452795657] [2019-12-28 03:38:58,258 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:38:58,258 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:38:58,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [333897025] [2019-12-28 03:38:58,260 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:38:58,271 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:38:58,283 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 73 transitions. [2019-12-28 03:38:58,283 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:38:58,284 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:38:58,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:38:58,284 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:38:58,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:38:58,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:38:58,285 INFO L87 Difference]: Start difference. First operand 53433 states and 195616 transitions. Second operand 6 states. [2019-12-28 03:38:58,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:38:58,996 INFO L93 Difference]: Finished difference Result 65982 states and 238830 transitions. [2019-12-28 03:38:58,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-28 03:38:58,996 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-12-28 03:38:58,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:38:59,798 INFO L225 Difference]: With dead ends: 65982 [2019-12-28 03:38:59,798 INFO L226 Difference]: Without dead ends: 65338 [2019-12-28 03:38:59,798 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-28 03:39:00,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65338 states. [2019-12-28 03:39:00,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65338 to 56042. [2019-12-28 03:39:00,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56042 states. [2019-12-28 03:39:00,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56042 states to 56042 states and 204333 transitions. [2019-12-28 03:39:00,832 INFO L78 Accepts]: Start accepts. Automaton has 56042 states and 204333 transitions. Word has length 69 [2019-12-28 03:39:00,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:00,833 INFO L462 AbstractCegarLoop]: Abstraction has 56042 states and 204333 transitions. [2019-12-28 03:39:00,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:39:00,833 INFO L276 IsEmpty]: Start isEmpty. Operand 56042 states and 204333 transitions. [2019-12-28 03:39:00,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:39:00,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:00,890 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-28 03:39:00,890 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:00,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:00,891 INFO L82 PathProgramCache]: Analyzing trace with hash -961252755, now seen corresponding path program 1 times [2019-12-28 03:39:00,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:00,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816279335] [2019-12-28 03:39:00,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:00,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:00,994 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-28 03:39:00,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816279335] [2019-12-28 03:39:00,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:00,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:39:00,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1548714921] [2019-12-28 03:39:00,996 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:01,008 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:01,025 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 73 transitions. [2019-12-28 03:39:01,026 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:01,026 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:39:01,027 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:39:01,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:01,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:39:01,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:39:01,028 INFO L87 Difference]: Start difference. First operand 56042 states and 204333 transitions. Second operand 7 states. [2019-12-28 03:39:02,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:02,576 INFO L93 Difference]: Finished difference Result 83030 states and 292761 transitions. [2019-12-28 03:39:02,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-28 03:39:02,576 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 69 [2019-12-28 03:39:02,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:02,750 INFO L225 Difference]: With dead ends: 83030 [2019-12-28 03:39:02,750 INFO L226 Difference]: Without dead ends: 83030 [2019-12-28 03:39:02,750 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:39:03,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83030 states. [2019-12-28 03:39:06,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83030 to 76079. [2019-12-28 03:39:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76079 states. [2019-12-28 03:39:06,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76079 states to 76079 states and 270628 transitions. [2019-12-28 03:39:06,714 INFO L78 Accepts]: Start accepts. Automaton has 76079 states and 270628 transitions. Word has length 69 [2019-12-28 03:39:06,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:06,715 INFO L462 AbstractCegarLoop]: Abstraction has 76079 states and 270628 transitions. [2019-12-28 03:39:06,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:39:06,715 INFO L276 IsEmpty]: Start isEmpty. Operand 76079 states and 270628 transitions. [2019-12-28 03:39:06,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-12-28 03:39:06,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:06,773 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-28 03:39:06,773 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:06,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:06,773 INFO L82 PathProgramCache]: Analyzing trace with hash 283511726, now seen corresponding path program 1 times [2019-12-28 03:39:06,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:06,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819896119] [2019-12-28 03:39:06,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:06,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:06,881 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-28 03:39:06,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819896119] [2019-12-28 03:39:06,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:06,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:39:06,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [422053079] [2019-12-28 03:39:06,884 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:06,894 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:06,905 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 72 states and 73 transitions. [2019-12-28 03:39:06,905 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:06,910 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:39:06,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:39:06,911 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:06,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:39:06,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:39:06,911 INFO L87 Difference]: Start difference. First operand 76079 states and 270628 transitions. Second operand 5 states. [2019-12-28 03:39:06,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:06,998 INFO L93 Difference]: Finished difference Result 17224 states and 54506 transitions. [2019-12-28 03:39:06,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:39:06,998 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 69 [2019-12-28 03:39:06,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:07,023 INFO L225 Difference]: With dead ends: 17224 [2019-12-28 03:39:07,023 INFO L226 Difference]: Without dead ends: 16746 [2019-12-28 03:39:07,024 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:39:07,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16746 states. [2019-12-28 03:39:07,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16746 to 16734. [2019-12-28 03:39:07,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16734 states. [2019-12-28 03:39:07,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16734 states to 16734 states and 53001 transitions. [2019-12-28 03:39:07,245 INFO L78 Accepts]: Start accepts. Automaton has 16734 states and 53001 transitions. Word has length 69 [2019-12-28 03:39:07,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:07,245 INFO L462 AbstractCegarLoop]: Abstraction has 16734 states and 53001 transitions. [2019-12-28 03:39:07,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:39:07,245 INFO L276 IsEmpty]: Start isEmpty. Operand 16734 states and 53001 transitions. [2019-12-28 03:39:07,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-28 03:39:07,258 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:07,258 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] [2019-12-28 03:39:07,259 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:07,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:07,259 INFO L82 PathProgramCache]: Analyzing trace with hash 1251978840, now seen corresponding path program 1 times [2019-12-28 03:39:07,259 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:07,260 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872505446] [2019-12-28 03:39:07,260 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:39:07,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872505446] [2019-12-28 03:39:07,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:07,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:39:07,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1619799019] [2019-12-28 03:39:07,319 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:07,359 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:07,411 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 183 transitions. [2019-12-28 03:39:07,411 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:07,492 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-28 03:39:07,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:39:07,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:07,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:39:07,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:39:07,493 INFO L87 Difference]: Start difference. First operand 16734 states and 53001 transitions. Second operand 6 states. [2019-12-28 03:39:07,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:07,903 INFO L93 Difference]: Finished difference Result 22098 states and 69082 transitions. [2019-12-28 03:39:07,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:39:07,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 79 [2019-12-28 03:39:07,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:07,947 INFO L225 Difference]: With dead ends: 22098 [2019-12-28 03:39:07,947 INFO L226 Difference]: Without dead ends: 22098 [2019-12-28 03:39:07,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 9 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:39:07,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22098 states. [2019-12-28 03:39:08,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22098 to 17610. [2019-12-28 03:39:08,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17610 states. [2019-12-28 03:39:08,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17610 states to 17610 states and 55560 transitions. [2019-12-28 03:39:08,773 INFO L78 Accepts]: Start accepts. Automaton has 17610 states and 55560 transitions. Word has length 79 [2019-12-28 03:39:08,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:08,773 INFO L462 AbstractCegarLoop]: Abstraction has 17610 states and 55560 transitions. [2019-12-28 03:39:08,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:39:08,773 INFO L276 IsEmpty]: Start isEmpty. Operand 17610 states and 55560 transitions. [2019-12-28 03:39:08,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-12-28 03:39:08,786 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:08,786 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] [2019-12-28 03:39:08,786 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:08,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:08,787 INFO L82 PathProgramCache]: Analyzing trace with hash 997242295, now seen corresponding path program 1 times [2019-12-28 03:39:08,787 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:08,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64031864] [2019-12-28 03:39:08,788 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:08,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:08,923 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-28 03:39:08,924 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64031864] [2019-12-28 03:39:08,924 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:08,924 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:39:08,924 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1624903897] [2019-12-28 03:39:08,924 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:08,941 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:08,985 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 132 states and 183 transitions. [2019-12-28 03:39:08,985 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:08,987 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:39:08,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:39:08,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:08,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:39:08,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:39:08,988 INFO L87 Difference]: Start difference. First operand 17610 states and 55560 transitions. Second operand 8 states. [2019-12-28 03:39:10,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:10,107 INFO L93 Difference]: Finished difference Result 19704 states and 61636 transitions. [2019-12-28 03:39:10,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-28 03:39:10,107 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 79 [2019-12-28 03:39:10,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:10,137 INFO L225 Difference]: With dead ends: 19704 [2019-12-28 03:39:10,138 INFO L226 Difference]: Without dead ends: 19656 [2019-12-28 03:39:10,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-12-28 03:39:10,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19656 states. [2019-12-28 03:39:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19656 to 15528. [2019-12-28 03:39:10,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15528 states. [2019-12-28 03:39:10,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15528 states to 15528 states and 49294 transitions. [2019-12-28 03:39:10,374 INFO L78 Accepts]: Start accepts. Automaton has 15528 states and 49294 transitions. Word has length 79 [2019-12-28 03:39:10,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:10,375 INFO L462 AbstractCegarLoop]: Abstraction has 15528 states and 49294 transitions. [2019-12-28 03:39:10,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:39:10,375 INFO L276 IsEmpty]: Start isEmpty. Operand 15528 states and 49294 transitions. [2019-12-28 03:39:10,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2019-12-28 03:39:10,389 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:10,389 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] [2019-12-28 03:39:10,389 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:10,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:10,389 INFO L82 PathProgramCache]: Analyzing trace with hash -2069735898, now seen corresponding path program 1 times [2019-12-28 03:39:10,390 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:10,390 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314898379] [2019-12-28 03:39:10,390 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:10,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:10,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:39:10,429 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314898379] [2019-12-28 03:39:10,429 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:10,430 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:39:10,430 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [285757287] [2019-12-28 03:39:10,430 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:10,445 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:10,471 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 86 states and 90 transitions. [2019-12-28 03:39:10,471 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:10,472 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:39:10,472 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:39:10,473 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:10,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:39:10,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:39:10,473 INFO L87 Difference]: Start difference. First operand 15528 states and 49294 transitions. Second operand 3 states. [2019-12-28 03:39:10,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:10,742 INFO L93 Difference]: Finished difference Result 16792 states and 53007 transitions. [2019-12-28 03:39:10,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:39:10,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 80 [2019-12-28 03:39:10,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:10,768 INFO L225 Difference]: With dead ends: 16792 [2019-12-28 03:39:10,769 INFO L226 Difference]: Without dead ends: 16792 [2019-12-28 03:39:10,769 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-28 03:39:10,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16792 states. [2019-12-28 03:39:10,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16792 to 16144. [2019-12-28 03:39:10,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16144 states. [2019-12-28 03:39:10,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16144 states to 16144 states and 51108 transitions. [2019-12-28 03:39:10,992 INFO L78 Accepts]: Start accepts. Automaton has 16144 states and 51108 transitions. Word has length 80 [2019-12-28 03:39:10,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:10,992 INFO L462 AbstractCegarLoop]: Abstraction has 16144 states and 51108 transitions. [2019-12-28 03:39:10,992 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:39:10,992 INFO L276 IsEmpty]: Start isEmpty. Operand 16144 states and 51108 transitions. [2019-12-28 03:39:11,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-28 03:39:11,005 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:11,006 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] [2019-12-28 03:39:11,006 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:11,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:11,006 INFO L82 PathProgramCache]: Analyzing trace with hash 1939928702, now seen corresponding path program 1 times [2019-12-28 03:39:11,007 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:11,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667690525] [2019-12-28 03:39:11,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:11,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:39:11,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667690525] [2019-12-28 03:39:11,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:11,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:39:11,072 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [598074110] [2019-12-28 03:39:11,072 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:11,087 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:11,109 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 81 transitions. [2019-12-28 03:39:11,110 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:11,110 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:39:11,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:39:11,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:11,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:39:11,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:39:11,111 INFO L87 Difference]: Start difference. First operand 16144 states and 51108 transitions. Second operand 4 states. [2019-12-28 03:39:11,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:11,403 INFO L93 Difference]: Finished difference Result 19272 states and 60154 transitions. [2019-12-28 03:39:11,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-28 03:39:11,404 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 81 [2019-12-28 03:39:11,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:11,433 INFO L225 Difference]: With dead ends: 19272 [2019-12-28 03:39:11,433 INFO L226 Difference]: Without dead ends: 19272 [2019-12-28 03:39:11,433 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-28 03:39:11,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19272 states. [2019-12-28 03:39:11,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19272 to 18249. [2019-12-28 03:39:11,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18249 states. [2019-12-28 03:39:12,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18249 states to 18249 states and 57270 transitions. [2019-12-28 03:39:12,033 INFO L78 Accepts]: Start accepts. Automaton has 18249 states and 57270 transitions. Word has length 81 [2019-12-28 03:39:12,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:12,033 INFO L462 AbstractCegarLoop]: Abstraction has 18249 states and 57270 transitions. [2019-12-28 03:39:12,033 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:39:12,033 INFO L276 IsEmpty]: Start isEmpty. Operand 18249 states and 57270 transitions. [2019-12-28 03:39:12,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-12-28 03:39:12,049 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:12,049 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] [2019-12-28 03:39:12,049 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:12,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:12,049 INFO L82 PathProgramCache]: Analyzing trace with hash 4268415, now seen corresponding path program 1 times [2019-12-28 03:39:12,050 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:12,050 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648380887] [2019-12-28 03:39:12,050 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:12,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-28 03:39:12,088 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648380887] [2019-12-28 03:39:12,088 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:12,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:39:12,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1293115661] [2019-12-28 03:39:12,088 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:12,104 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:12,125 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 82 states and 81 transitions. [2019-12-28 03:39:12,125 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:12,126 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:39:12,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:39:12,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:12,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:39:12,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:39:12,127 INFO L87 Difference]: Start difference. First operand 18249 states and 57270 transitions. Second operand 3 states. [2019-12-28 03:39:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:12,369 INFO L93 Difference]: Finished difference Result 19580 states and 61169 transitions. [2019-12-28 03:39:12,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:39:12,370 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-12-28 03:39:12,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:12,397 INFO L225 Difference]: With dead ends: 19580 [2019-12-28 03:39:12,397 INFO L226 Difference]: Without dead ends: 19580 [2019-12-28 03:39:12,398 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-28 03:39:12,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19580 states. [2019-12-28 03:39:12,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19580 to 18921. [2019-12-28 03:39:12,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18921 states. [2019-12-28 03:39:12,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18921 states to 18921 states and 59234 transitions. [2019-12-28 03:39:12,656 INFO L78 Accepts]: Start accepts. Automaton has 18921 states and 59234 transitions. Word has length 81 [2019-12-28 03:39:12,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:12,656 INFO L462 AbstractCegarLoop]: Abstraction has 18921 states and 59234 transitions. [2019-12-28 03:39:12,656 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:39:12,656 INFO L276 IsEmpty]: Start isEmpty. Operand 18921 states and 59234 transitions. [2019-12-28 03:39:12,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 03:39:12,673 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:12,673 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] [2019-12-28 03:39:12,673 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:12,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:12,674 INFO L82 PathProgramCache]: Analyzing trace with hash 523555130, now seen corresponding path program 1 times [2019-12-28 03:39:12,674 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:12,675 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192606685] [2019-12-28 03:39:12,675 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:12,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:12,764 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-28 03:39:12,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192606685] [2019-12-28 03:39:12,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:12,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:39:12,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1201051619] [2019-12-28 03:39:12,765 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:12,779 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:12,812 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 138 transitions. [2019-12-28 03:39:12,812 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:12,813 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:39:12,813 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:39:12,813 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:12,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:39:12,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:39:12,814 INFO L87 Difference]: Start difference. First operand 18921 states and 59234 transitions. Second operand 6 states. [2019-12-28 03:39:13,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:13,626 INFO L93 Difference]: Finished difference Result 27780 states and 85390 transitions. [2019-12-28 03:39:13,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:39:13,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-12-28 03:39:13,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:13,668 INFO L225 Difference]: With dead ends: 27780 [2019-12-28 03:39:13,669 INFO L226 Difference]: Without dead ends: 27474 [2019-12-28 03:39:13,669 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:39:13,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27474 states. [2019-12-28 03:39:13,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27474 to 21951. [2019-12-28 03:39:13,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21951 states. [2019-12-28 03:39:14,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21951 states to 21951 states and 68574 transitions. [2019-12-28 03:39:14,021 INFO L78 Accepts]: Start accepts. Automaton has 21951 states and 68574 transitions. Word has length 82 [2019-12-28 03:39:14,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:14,022 INFO L462 AbstractCegarLoop]: Abstraction has 21951 states and 68574 transitions. [2019-12-28 03:39:14,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:39:14,022 INFO L276 IsEmpty]: Start isEmpty. Operand 21951 states and 68574 transitions. [2019-12-28 03:39:14,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 03:39:14,042 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:14,042 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] [2019-12-28 03:39:14,042 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:14,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:14,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1485169147, now seen corresponding path program 1 times [2019-12-28 03:39:14,043 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:14,044 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634053114] [2019-12-28 03:39:14,044 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:14,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:14,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:39:14,125 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634053114] [2019-12-28 03:39:14,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:14,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:39:14,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [617939495] [2019-12-28 03:39:14,126 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:14,139 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:14,170 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 138 transitions. [2019-12-28 03:39:14,170 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:14,171 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:39:14,171 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:39:14,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:14,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:39:14,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:39:14,172 INFO L87 Difference]: Start difference. First operand 21951 states and 68574 transitions. Second operand 7 states. [2019-12-28 03:39:15,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:15,347 INFO L93 Difference]: Finished difference Result 39374 states and 118841 transitions. [2019-12-28 03:39:15,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-28 03:39:15,348 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-12-28 03:39:15,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:15,402 INFO L225 Difference]: With dead ends: 39374 [2019-12-28 03:39:15,403 INFO L226 Difference]: Without dead ends: 39302 [2019-12-28 03:39:15,403 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2019-12-28 03:39:15,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39302 states. [2019-12-28 03:39:15,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39302 to 23772. [2019-12-28 03:39:15,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23772 states. [2019-12-28 03:39:15,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23772 states to 23772 states and 73008 transitions. [2019-12-28 03:39:15,794 INFO L78 Accepts]: Start accepts. Automaton has 23772 states and 73008 transitions. Word has length 82 [2019-12-28 03:39:15,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:15,794 INFO L462 AbstractCegarLoop]: Abstraction has 23772 states and 73008 transitions. [2019-12-28 03:39:15,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:39:15,794 INFO L276 IsEmpty]: Start isEmpty. Operand 23772 states and 73008 transitions. [2019-12-28 03:39:15,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 03:39:15,812 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:15,813 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] [2019-12-28 03:39:15,813 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:15,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:15,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1235267907, now seen corresponding path program 1 times [2019-12-28 03:39:15,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:15,814 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818937207] [2019-12-28 03:39:15,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:15,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:15,891 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-28 03:39:15,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818937207] [2019-12-28 03:39:15,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:15,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:39:15,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1083945062] [2019-12-28 03:39:15,892 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:15,906 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:15,940 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 138 transitions. [2019-12-28 03:39:15,940 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:15,942 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:39:15,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:39:15,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:15,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:39:15,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:39:15,943 INFO L87 Difference]: Start difference. First operand 23772 states and 73008 transitions. Second operand 7 states. [2019-12-28 03:39:17,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:17,032 INFO L93 Difference]: Finished difference Result 43589 states and 131824 transitions. [2019-12-28 03:39:17,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-28 03:39:17,032 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-12-28 03:39:17,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:17,097 INFO L225 Difference]: With dead ends: 43589 [2019-12-28 03:39:17,097 INFO L226 Difference]: Without dead ends: 43043 [2019-12-28 03:39:17,097 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:39:17,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43043 states. [2019-12-28 03:39:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43043 to 25974. [2019-12-28 03:39:17,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25974 states. [2019-12-28 03:39:17,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25974 states to 25974 states and 79400 transitions. [2019-12-28 03:39:17,538 INFO L78 Accepts]: Start accepts. Automaton has 25974 states and 79400 transitions. Word has length 82 [2019-12-28 03:39:17,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:17,538 INFO L462 AbstractCegarLoop]: Abstraction has 25974 states and 79400 transitions. [2019-12-28 03:39:17,538 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:39:17,538 INFO L276 IsEmpty]: Start isEmpty. Operand 25974 states and 79400 transitions. [2019-12-28 03:39:17,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 03:39:17,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:17,560 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] [2019-12-28 03:39:17,561 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:17,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:17,561 INFO L82 PathProgramCache]: Analyzing trace with hash -69362692, now seen corresponding path program 1 times [2019-12-28 03:39:17,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:17,562 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846250723] [2019-12-28 03:39:17,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:17,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:17,708 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-28 03:39:17,708 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846250723] [2019-12-28 03:39:17,709 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:17,709 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:39:17,709 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [546125386] [2019-12-28 03:39:17,709 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:17,720 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:17,749 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 138 transitions. [2019-12-28 03:39:17,749 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:17,750 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:39:17,751 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:39:17,751 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:17,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:39:17,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:39:17,751 INFO L87 Difference]: Start difference. First operand 25974 states and 79400 transitions. Second operand 8 states. [2019-12-28 03:39:19,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:19,683 INFO L93 Difference]: Finished difference Result 39161 states and 116420 transitions. [2019-12-28 03:39:19,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-28 03:39:19,683 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-12-28 03:39:19,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:19,736 INFO L225 Difference]: With dead ends: 39161 [2019-12-28 03:39:19,737 INFO L226 Difference]: Without dead ends: 38675 [2019-12-28 03:39:19,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2019-12-28 03:39:19,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38675 states. [2019-12-28 03:39:20,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38675 to 25238. [2019-12-28 03:39:20,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25238 states. [2019-12-28 03:39:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25238 states to 25238 states and 76713 transitions. [2019-12-28 03:39:20,161 INFO L78 Accepts]: Start accepts. Automaton has 25238 states and 76713 transitions. Word has length 82 [2019-12-28 03:39:20,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:20,162 INFO L462 AbstractCegarLoop]: Abstraction has 25238 states and 76713 transitions. [2019-12-28 03:39:20,162 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:39:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 25238 states and 76713 transitions. [2019-12-28 03:39:20,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 03:39:20,182 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:20,183 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] [2019-12-28 03:39:20,183 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:20,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:20,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2137015806, now seen corresponding path program 1 times [2019-12-28 03:39:20,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:20,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646109181] [2019-12-28 03:39:20,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:20,309 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-28 03:39:20,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646109181] [2019-12-28 03:39:20,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:20,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-28 03:39:20,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1557000592] [2019-12-28 03:39:20,312 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:20,335 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:20,379 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 138 transitions. [2019-12-28 03:39:20,379 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:20,391 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:39:20,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-28 03:39:20,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:20,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-28 03:39:20,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:39:20,392 INFO L87 Difference]: Start difference. First operand 25238 states and 76713 transitions. Second operand 8 states. [2019-12-28 03:39:21,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:21,956 INFO L93 Difference]: Finished difference Result 30029 states and 90504 transitions. [2019-12-28 03:39:21,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-28 03:39:21,956 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 82 [2019-12-28 03:39:21,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:21,999 INFO L225 Difference]: With dead ends: 30029 [2019-12-28 03:39:21,999 INFO L226 Difference]: Without dead ends: 30029 [2019-12-28 03:39:21,999 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2019-12-28 03:39:22,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30029 states. [2019-12-28 03:39:22,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30029 to 21541. [2019-12-28 03:39:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21541 states. [2019-12-28 03:39:22,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21541 states to 21541 states and 65601 transitions. [2019-12-28 03:39:22,328 INFO L78 Accepts]: Start accepts. Automaton has 21541 states and 65601 transitions. Word has length 82 [2019-12-28 03:39:22,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:22,328 INFO L462 AbstractCegarLoop]: Abstraction has 21541 states and 65601 transitions. [2019-12-28 03:39:22,328 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-28 03:39:22,328 INFO L276 IsEmpty]: Start isEmpty. Operand 21541 states and 65601 transitions. [2019-12-28 03:39:22,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 03:39:22,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:22,344 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] [2019-12-28 03:39:22,344 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:22,345 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:22,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1677235074, now seen corresponding path program 1 times [2019-12-28 03:39:22,345 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:22,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095809766] [2019-12-28 03:39:22,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:22,479 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-28 03:39:22,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095809766] [2019-12-28 03:39:22,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:22,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-28 03:39:22,480 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [822632452] [2019-12-28 03:39:22,480 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:22,489 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:22,514 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 138 transitions. [2019-12-28 03:39:22,514 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:22,515 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-28 03:39:22,515 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-28 03:39:22,515 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:22,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-28 03:39:22,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:39:22,516 INFO L87 Difference]: Start difference. First operand 21541 states and 65601 transitions. Second operand 9 states. [2019-12-28 03:39:24,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:24,635 INFO L93 Difference]: Finished difference Result 31828 states and 94326 transitions. [2019-12-28 03:39:24,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-28 03:39:24,635 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 82 [2019-12-28 03:39:24,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:24,683 INFO L225 Difference]: With dead ends: 31828 [2019-12-28 03:39:24,683 INFO L226 Difference]: Without dead ends: 31828 [2019-12-28 03:39:24,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2019-12-28 03:39:24,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31828 states. [2019-12-28 03:39:25,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31828 to 23842. [2019-12-28 03:39:25,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23842 states. [2019-12-28 03:39:25,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23842 states to 23842 states and 72403 transitions. [2019-12-28 03:39:25,043 INFO L78 Accepts]: Start accepts. Automaton has 23842 states and 72403 transitions. Word has length 82 [2019-12-28 03:39:25,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:25,044 INFO L462 AbstractCegarLoop]: Abstraction has 23842 states and 72403 transitions. [2019-12-28 03:39:25,044 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-28 03:39:25,044 INFO L276 IsEmpty]: Start isEmpty. Operand 23842 states and 72403 transitions. [2019-12-28 03:39:25,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-12-28 03:39:25,063 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:25,063 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] [2019-12-28 03:39:25,063 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:25,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:25,064 INFO L82 PathProgramCache]: Analyzing trace with hash -432470593, now seen corresponding path program 1 times [2019-12-28 03:39:25,064 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:25,064 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001983665] [2019-12-28 03:39:25,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:25,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-28 03:39:25,137 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001983665] [2019-12-28 03:39:25,137 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:25,137 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-28 03:39:25,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1675050575] [2019-12-28 03:39:25,137 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:25,147 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:25,182 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 111 states and 138 transitions. [2019-12-28 03:39:25,182 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:25,183 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:39:25,183 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-28 03:39:25,183 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:25,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-28 03:39:25,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:39:25,185 INFO L87 Difference]: Start difference. First operand 23842 states and 72403 transitions. Second operand 3 states. [2019-12-28 03:39:25,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:25,371 INFO L93 Difference]: Finished difference Result 20089 states and 60643 transitions. [2019-12-28 03:39:25,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-28 03:39:25,372 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-12-28 03:39:25,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:25,416 INFO L225 Difference]: With dead ends: 20089 [2019-12-28 03:39:25,416 INFO L226 Difference]: Without dead ends: 20011 [2019-12-28 03:39:25,418 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-28 03:39:25,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20011 states. [2019-12-28 03:39:25,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20011 to 18754. [2019-12-28 03:39:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18754 states. [2019-12-28 03:39:25,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18754 states to 18754 states and 56837 transitions. [2019-12-28 03:39:25,843 INFO L78 Accepts]: Start accepts. Automaton has 18754 states and 56837 transitions. Word has length 82 [2019-12-28 03:39:25,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:25,843 INFO L462 AbstractCegarLoop]: Abstraction has 18754 states and 56837 transitions. [2019-12-28 03:39:25,843 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-28 03:39:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 18754 states and 56837 transitions. [2019-12-28 03:39:25,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 03:39:25,862 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:25,862 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] [2019-12-28 03:39:25,862 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:25,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:25,863 INFO L82 PathProgramCache]: Analyzing trace with hash 473956646, now seen corresponding path program 1 times [2019-12-28 03:39:25,863 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:25,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905276502] [2019-12-28 03:39:25,864 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:25,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:25,977 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-28 03:39:25,977 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905276502] [2019-12-28 03:39:25,978 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:25,978 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:39:25,978 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1558165152] [2019-12-28 03:39:25,978 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:25,990 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:26,034 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 187 transitions. [2019-12-28 03:39:26,034 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:26,056 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:39:26,056 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-28 03:39:26,056 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:26,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-28 03:39:26,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:39:26,057 INFO L87 Difference]: Start difference. First operand 18754 states and 56837 transitions. Second operand 7 states. [2019-12-28 03:39:26,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:26,939 INFO L93 Difference]: Finished difference Result 34141 states and 101990 transitions. [2019-12-28 03:39:26,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:39:26,939 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 83 [2019-12-28 03:39:26,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:26,991 INFO L225 Difference]: With dead ends: 34141 [2019-12-28 03:39:26,992 INFO L226 Difference]: Without dead ends: 33997 [2019-12-28 03:39:26,992 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-12-28 03:39:27,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33997 states. [2019-12-28 03:39:27,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33997 to 25660. [2019-12-28 03:39:27,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25660 states. [2019-12-28 03:39:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25660 states to 25660 states and 78066 transitions. [2019-12-28 03:39:27,586 INFO L78 Accepts]: Start accepts. Automaton has 25660 states and 78066 transitions. Word has length 83 [2019-12-28 03:39:27,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:27,586 INFO L462 AbstractCegarLoop]: Abstraction has 25660 states and 78066 transitions. [2019-12-28 03:39:27,586 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-28 03:39:27,586 INFO L276 IsEmpty]: Start isEmpty. Operand 25660 states and 78066 transitions. [2019-12-28 03:39:27,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-12-28 03:39:27,606 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:27,606 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] [2019-12-28 03:39:27,606 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:27,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:27,606 INFO L82 PathProgramCache]: Analyzing trace with hash 1718721127, now seen corresponding path program 1 times [2019-12-28 03:39:27,607 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:27,607 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877724572] [2019-12-28 03:39:27,607 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:27,664 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-28 03:39:27,665 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877724572] [2019-12-28 03:39:27,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:27,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:39:27,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [130432939] [2019-12-28 03:39:27,665 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:27,676 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:27,713 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 136 states and 187 transitions. [2019-12-28 03:39:27,714 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:27,729 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:39:27,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:39:27,730 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:27,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:39:27,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:39:27,730 INFO L87 Difference]: Start difference. First operand 25660 states and 78066 transitions. Second operand 6 states. [2019-12-28 03:39:27,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:27,774 INFO L93 Difference]: Finished difference Result 3295 states and 7992 transitions. [2019-12-28 03:39:27,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:39:27,774 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 83 [2019-12-28 03:39:27,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:27,776 INFO L225 Difference]: With dead ends: 3295 [2019-12-28 03:39:27,776 INFO L226 Difference]: Without dead ends: 2914 [2019-12-28 03:39:27,777 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-28 03:39:27,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2914 states. [2019-12-28 03:39:27,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2914 to 2791. [2019-12-28 03:39:27,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2791 states. [2019-12-28 03:39:27,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2791 states to 2791 states and 6731 transitions. [2019-12-28 03:39:27,800 INFO L78 Accepts]: Start accepts. Automaton has 2791 states and 6731 transitions. Word has length 83 [2019-12-28 03:39:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:27,800 INFO L462 AbstractCegarLoop]: Abstraction has 2791 states and 6731 transitions. [2019-12-28 03:39:27,800 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:39:27,800 INFO L276 IsEmpty]: Start isEmpty. Operand 2791 states and 6731 transitions. [2019-12-28 03:39:27,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 03:39:27,802 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:27,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] [2019-12-28 03:39:27,802 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:27,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:27,802 INFO L82 PathProgramCache]: Analyzing trace with hash -2025726540, now seen corresponding path program 1 times [2019-12-28 03:39:27,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:27,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154353723] [2019-12-28 03:39:27,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:27,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:27,863 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-28 03:39:27,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154353723] [2019-12-28 03:39:27,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:27,864 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:39:27,864 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1055365845] [2019-12-28 03:39:27,864 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:27,880 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:27,945 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 188 transitions. [2019-12-28 03:39:27,945 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:27,973 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-28 03:39:27,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:39:27,974 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:27,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:39:27,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:39:27,974 INFO L87 Difference]: Start difference. First operand 2791 states and 6731 transitions. Second operand 6 states. [2019-12-28 03:39:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:28,469 INFO L93 Difference]: Finished difference Result 4645 states and 11335 transitions. [2019-12-28 03:39:28,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-28 03:39:28,469 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-28 03:39:28,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:28,475 INFO L225 Difference]: With dead ends: 4645 [2019-12-28 03:39:28,476 INFO L226 Difference]: Without dead ends: 4645 [2019-12-28 03:39:28,476 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-28 03:39:28,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4645 states. [2019-12-28 03:39:28,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4645 to 2794. [2019-12-28 03:39:28,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2794 states. [2019-12-28 03:39:28,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2794 states and 6738 transitions. [2019-12-28 03:39:28,530 INFO L78 Accepts]: Start accepts. Automaton has 2794 states and 6738 transitions. Word has length 96 [2019-12-28 03:39:28,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:28,531 INFO L462 AbstractCegarLoop]: Abstraction has 2794 states and 6738 transitions. [2019-12-28 03:39:28,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:39:28,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 6738 transitions. [2019-12-28 03:39:28,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 03:39:28,534 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:28,534 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-28 03:39:28,535 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:28,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:28,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1820544117, now seen corresponding path program 1 times [2019-12-28 03:39:28,536 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:28,536 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889269454] [2019-12-28 03:39:28,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:28,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:28,700 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-28 03:39:28,700 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889269454] [2019-12-28 03:39:28,701 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:28,701 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-28 03:39:28,701 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1888893121] [2019-12-28 03:39:28,701 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:28,715 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:28,766 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 188 transitions. [2019-12-28 03:39:28,766 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:28,848 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-28 03:39:28,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-28 03:39:28,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:28,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-28 03:39:28,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-28 03:39:28,849 INFO L87 Difference]: Start difference. First operand 2794 states and 6738 transitions. Second operand 10 states. [2019-12-28 03:39:29,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:29,970 INFO L93 Difference]: Finished difference Result 3436 states and 7975 transitions. [2019-12-28 03:39:29,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-28 03:39:29,971 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-28 03:39:29,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:29,976 INFO L225 Difference]: With dead ends: 3436 [2019-12-28 03:39:29,976 INFO L226 Difference]: Without dead ends: 3436 [2019-12-28 03:39:29,977 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=435, Unknown=0, NotChecked=0, Total=600 [2019-12-28 03:39:29,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3436 states. [2019-12-28 03:39:30,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3436 to 2882. [2019-12-28 03:39:30,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2882 states. [2019-12-28 03:39:30,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 6867 transitions. [2019-12-28 03:39:30,008 INFO L78 Accepts]: Start accepts. Automaton has 2882 states and 6867 transitions. Word has length 96 [2019-12-28 03:39:30,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:30,008 INFO L462 AbstractCegarLoop]: Abstraction has 2882 states and 6867 transitions. [2019-12-28 03:39:30,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-28 03:39:30,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 6867 transitions. [2019-12-28 03:39:30,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 03:39:30,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:30,010 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-28 03:39:30,011 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:30,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:30,011 INFO L82 PathProgramCache]: Analyzing trace with hash -2144657418, now seen corresponding path program 1 times [2019-12-28 03:39:30,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:30,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900558500] [2019-12-28 03:39:30,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:30,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-28 03:39:30,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900558500] [2019-12-28 03:39:30,129 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:30,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:39:30,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1371601459] [2019-12-28 03:39:30,129 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:30,148 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:30,214 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 188 transitions. [2019-12-28 03:39:30,214 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:30,215 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:39:30,215 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:39:30,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:30,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:39:30,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:39:30,215 INFO L87 Difference]: Start difference. First operand 2882 states and 6867 transitions. Second operand 6 states. [2019-12-28 03:39:30,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:30,388 INFO L93 Difference]: Finished difference Result 3096 states and 7231 transitions. [2019-12-28 03:39:30,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:39:30,388 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-28 03:39:30,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:30,392 INFO L225 Difference]: With dead ends: 3096 [2019-12-28 03:39:30,392 INFO L226 Difference]: Without dead ends: 3055 [2019-12-28 03:39:30,393 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-28 03:39:30,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3055 states. [2019-12-28 03:39:30,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3055 to 2928. [2019-12-28 03:39:30,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2928 states. [2019-12-28 03:39:30,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2928 states to 2928 states and 6923 transitions. [2019-12-28 03:39:30,423 INFO L78 Accepts]: Start accepts. Automaton has 2928 states and 6923 transitions. Word has length 96 [2019-12-28 03:39:30,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:30,423 INFO L462 AbstractCegarLoop]: Abstraction has 2928 states and 6923 transitions. [2019-12-28 03:39:30,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:39:30,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2928 states and 6923 transitions. [2019-12-28 03:39:30,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 03:39:30,426 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:30,426 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-28 03:39:30,426 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:30,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:30,426 INFO L82 PathProgramCache]: Analyzing trace with hash 449569399, now seen corresponding path program 1 times [2019-12-28 03:39:30,427 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:30,427 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756490727] [2019-12-28 03:39:30,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:30,543 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-28 03:39:30,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756490727] [2019-12-28 03:39:30,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:30,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:39:30,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1883061481] [2019-12-28 03:39:30,544 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:30,561 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:30,635 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 188 transitions. [2019-12-28 03:39:30,636 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:30,636 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:39:30,637 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:39:30,637 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:30,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:39:30,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:39:30,637 INFO L87 Difference]: Start difference. First operand 2928 states and 6923 transitions. Second operand 6 states. [2019-12-28 03:39:30,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:30,845 INFO L93 Difference]: Finished difference Result 3179 states and 7378 transitions. [2019-12-28 03:39:30,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-28 03:39:30,846 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-28 03:39:30,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:30,850 INFO L225 Difference]: With dead ends: 3179 [2019-12-28 03:39:30,850 INFO L226 Difference]: Without dead ends: 3179 [2019-12-28 03:39:30,851 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-28 03:39:30,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3179 states. [2019-12-28 03:39:30,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3179 to 2922. [2019-12-28 03:39:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2922 states. [2019-12-28 03:39:30,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2922 states to 2922 states and 6888 transitions. [2019-12-28 03:39:30,880 INFO L78 Accepts]: Start accepts. Automaton has 2922 states and 6888 transitions. Word has length 96 [2019-12-28 03:39:30,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:30,880 INFO L462 AbstractCegarLoop]: Abstraction has 2922 states and 6888 transitions. [2019-12-28 03:39:30,880 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:39:30,880 INFO L276 IsEmpty]: Start isEmpty. Operand 2922 states and 6888 transitions. [2019-12-28 03:39:30,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 03:39:30,882 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:30,882 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-28 03:39:30,883 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:30,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:30,883 INFO L82 PathProgramCache]: Analyzing trace with hash -1486090888, now seen corresponding path program 1 times [2019-12-28 03:39:30,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:30,884 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890848231] [2019-12-28 03:39:30,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:30,941 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-28 03:39:30,942 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890848231] [2019-12-28 03:39:30,942 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:30,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-28 03:39:30,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [544603533] [2019-12-28 03:39:30,942 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:30,959 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:31,024 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 188 transitions. [2019-12-28 03:39:31,025 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:31,025 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:39:31,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-28 03:39:31,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:31,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-28 03:39:31,026 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-28 03:39:31,026 INFO L87 Difference]: Start difference. First operand 2922 states and 6888 transitions. Second operand 4 states. [2019-12-28 03:39:31,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:31,114 INFO L93 Difference]: Finished difference Result 2886 states and 6768 transitions. [2019-12-28 03:39:31,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-28 03:39:31,115 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 96 [2019-12-28 03:39:31,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:31,119 INFO L225 Difference]: With dead ends: 2886 [2019-12-28 03:39:31,119 INFO L226 Difference]: Without dead ends: 2886 [2019-12-28 03:39:31,120 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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-28 03:39:31,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2886 states. [2019-12-28 03:39:31,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2886 to 2614. [2019-12-28 03:39:31,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2614 states. [2019-12-28 03:39:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2614 states to 2614 states and 6184 transitions. [2019-12-28 03:39:31,144 INFO L78 Accepts]: Start accepts. Automaton has 2614 states and 6184 transitions. Word has length 96 [2019-12-28 03:39:31,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:31,145 INFO L462 AbstractCegarLoop]: Abstraction has 2614 states and 6184 transitions. [2019-12-28 03:39:31,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-28 03:39:31,145 INFO L276 IsEmpty]: Start isEmpty. Operand 2614 states and 6184 transitions. [2019-12-28 03:39:31,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 03:39:31,147 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:31,147 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-28 03:39:31,147 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:31,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:31,148 INFO L82 PathProgramCache]: Analyzing trace with hash 515622103, now seen corresponding path program 1 times [2019-12-28 03:39:31,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:31,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072113976] [2019-12-28 03:39:31,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:31,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:31,239 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-28 03:39:31,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072113976] [2019-12-28 03:39:31,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:31,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-28 03:39:31,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [60751429] [2019-12-28 03:39:31,240 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:31,256 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:31,327 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 188 transitions. [2019-12-28 03:39:31,328 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:31,328 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:39:31,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-28 03:39:31,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:31,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-28 03:39:31,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-28 03:39:31,330 INFO L87 Difference]: Start difference. First operand 2614 states and 6184 transitions. Second operand 5 states. [2019-12-28 03:39:31,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:31,625 INFO L93 Difference]: Finished difference Result 2920 states and 6889 transitions. [2019-12-28 03:39:31,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-28 03:39:31,625 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 96 [2019-12-28 03:39:31,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:31,631 INFO L225 Difference]: With dead ends: 2920 [2019-12-28 03:39:31,631 INFO L226 Difference]: Without dead ends: 2902 [2019-12-28 03:39:31,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-28 03:39:31,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2902 states. [2019-12-28 03:39:31,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2902 to 2641. [2019-12-28 03:39:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2641 states. [2019-12-28 03:39:31,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2641 states to 2641 states and 6238 transitions. [2019-12-28 03:39:31,686 INFO L78 Accepts]: Start accepts. Automaton has 2641 states and 6238 transitions. Word has length 96 [2019-12-28 03:39:31,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:31,687 INFO L462 AbstractCegarLoop]: Abstraction has 2641 states and 6238 transitions. [2019-12-28 03:39:31,687 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-28 03:39:31,687 INFO L276 IsEmpty]: Start isEmpty. Operand 2641 states and 6238 transitions. [2019-12-28 03:39:31,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 03:39:31,692 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:31,692 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-28 03:39:31,692 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:31,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:31,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1760386584, now seen corresponding path program 1 times [2019-12-28 03:39:31,694 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:31,694 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422288302] [2019-12-28 03:39:31,694 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-28 03:39:31,818 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-28 03:39:31,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422288302] [2019-12-28 03:39:31,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-28 03:39:31,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-28 03:39:31,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [495410279] [2019-12-28 03:39:31,819 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-28 03:39:31,849 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-28 03:39:31,937 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 143 states and 188 transitions. [2019-12-28 03:39:31,937 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-28 03:39:31,938 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-28 03:39:31,938 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-28 03:39:31,938 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-28 03:39:31,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-28 03:39:31,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-28 03:39:31,939 INFO L87 Difference]: Start difference. First operand 2641 states and 6238 transitions. Second operand 6 states. [2019-12-28 03:39:32,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-28 03:39:32,013 INFO L93 Difference]: Finished difference Result 3968 states and 9442 transitions. [2019-12-28 03:39:32,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-28 03:39:32,013 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-12-28 03:39:32,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-28 03:39:32,015 INFO L225 Difference]: With dead ends: 3968 [2019-12-28 03:39:32,015 INFO L226 Difference]: Without dead ends: 1410 [2019-12-28 03:39:32,015 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-28 03:39:32,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1410 states. [2019-12-28 03:39:32,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1410 to 1410. [2019-12-28 03:39:32,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1410 states. [2019-12-28 03:39:32,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1410 states to 1410 states and 3340 transitions. [2019-12-28 03:39:32,033 INFO L78 Accepts]: Start accepts. Automaton has 1410 states and 3340 transitions. Word has length 96 [2019-12-28 03:39:32,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-28 03:39:32,034 INFO L462 AbstractCegarLoop]: Abstraction has 1410 states and 3340 transitions. [2019-12-28 03:39:32,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-28 03:39:32,034 INFO L276 IsEmpty]: Start isEmpty. Operand 1410 states and 3340 transitions. [2019-12-28 03:39:32,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-28 03:39:32,036 INFO L403 BasicCegarLoop]: Found error trace [2019-12-28 03:39:32,036 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-28 03:39:32,036 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-28 03:39:32,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-28 03:39:32,036 INFO L82 PathProgramCache]: Analyzing trace with hash 675950189, now seen corresponding path program 1 times [2019-12-28 03:39:32,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-28 03:39:32,037 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531035246] [2019-12-28 03:39:32,037 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-28 03:39:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:39:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-28 03:39:32,126 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-28 03:39:32,126 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-28 03:39:32,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.12 03:39:32 BasicIcfg [2019-12-28 03:39:32,279 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-28 03:39:32,281 INFO L168 Benchmark]: Toolchain (without parser) took 67178.43 ms. Allocated memory was 146.3 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 102.2 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-28 03:39:32,283 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-28 03:39:32,284 INFO L168 Benchmark]: CACSL2BoogieTranslator took 784.24 ms. Allocated memory was 146.3 MB in the beginning and 200.8 MB in the end (delta: 54.5 MB). Free memory was 101.8 MB in the beginning and 155.2 MB in the end (delta: -53.4 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. [2019-12-28 03:39:32,284 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.00 ms. Allocated memory is still 200.8 MB. Free memory was 155.2 MB in the beginning and 152.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. [2019-12-28 03:39:32,285 INFO L168 Benchmark]: Boogie Preprocessor took 61.48 ms. Allocated memory is still 200.8 MB. Free memory was 152.0 MB in the beginning and 150.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-28 03:39:32,285 INFO L168 Benchmark]: RCFGBuilder took 819.99 ms. Allocated memory is still 200.8 MB. Free memory was 150.1 MB in the beginning and 105.7 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. [2019-12-28 03:39:32,288 INFO L168 Benchmark]: TraceAbstraction took 65435.14 ms. Allocated memory was 200.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 105.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 989.2 MB. Max. memory is 7.1 GB. [2019-12-28 03:39:32,294 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 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 784.24 ms. Allocated memory was 146.3 MB in the beginning and 200.8 MB in the end (delta: 54.5 MB). Free memory was 101.8 MB in the beginning and 155.2 MB in the end (delta: -53.4 MB). Peak memory consumption was 22.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.00 ms. Allocated memory is still 200.8 MB. Free memory was 155.2 MB in the beginning and 152.0 MB in the end (delta: 3.2 MB). Peak memory consumption was 3.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.48 ms. Allocated memory is still 200.8 MB. Free memory was 152.0 MB in the beginning and 150.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 819.99 ms. Allocated memory is still 200.8 MB. Free memory was 150.1 MB in the beginning and 105.7 MB in the end (delta: 44.4 MB). Peak memory consumption was 44.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 65435.14 ms. Allocated memory was 200.8 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 105.0 MB in the beginning and 1.7 GB in the end (delta: -1.6 GB). Peak memory consumption was 989.2 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_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0] [L698] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L699] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L700] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L702] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L703] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L704] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L705] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L706] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L707] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L708] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L709] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L710] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L711] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L712] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L713] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L714] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L715] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L716] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L786] 0 pthread_t t1591; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L787] FCALL, FORK 0 pthread_create(&t1591, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L788] 0 pthread_t t1592; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] FCALL, FORK 0 pthread_create(&t1592, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L744] 2 x$w_buff1 = x$w_buff0 [L745] 2 x$w_buff0 = 2 [L746] 2 x$w_buff1_used = x$w_buff0_used [L747] 2 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L749] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L750] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L751] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L752] 2 x$r_buff0_thd2 = (_Bool)1 [L755] 2 y = 1 [L758] 2 __unbuffered_p1_EAX = y [L761] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L724] 1 y = 2 [L727] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L730] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=1, y=2] [L730] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L731] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L731] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L764] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L732] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L764] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L734] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L734] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L737] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L791] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L795] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L796] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L797] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L798] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L799] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L802] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L803] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L804] 0 x$flush_delayed = weak$$choice2 [L805] 0 x$mem_tmp = x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L807] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L808] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L809] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L810] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L811] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L811] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L812] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L813] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L814] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L814] 0 x = x$flush_delayed ? x$mem_tmp : x [L815] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 141 locations, 2 error locations. Result: UNSAFE, OverallTime: 65.1s, OverallIterations: 34, TraceHistogramMax: 1, AutomataDifference: 27.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 10800 SDtfs, 11480 SDslu, 27000 SDs, 0 SdLazy, 13499 SolverSat, 824 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 431 GetRequests, 124 SyntacticMatches, 21 SemanticMatches, 286 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 664 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=76079occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 29.6s AutomataMinimizationTime, 33 MinimizatonAttempts, 166845 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 2621 NumberOfCodeBlocks, 2621 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 2492 ConstructedInterpolants, 0 QuantifiedInterpolants, 455427 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...