./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe022_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_825bd0bb-d655-42b9-bf37-adda7d8c0be7/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_825bd0bb-d655-42b9-bf37-adda7d8c0be7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_825bd0bb-d655-42b9-bf37-adda7d8c0be7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_825bd0bb-d655-42b9-bf37-adda7d8c0be7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe022_rmo.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_825bd0bb-d655-42b9-bf37-adda7d8c0be7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_825bd0bb-d655-42b9-bf37-adda7d8c0be7/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b37fd9a6d9373ee025228ed18673aff9b4a368f6 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:02:01,734 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:02:01,736 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:02:01,749 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:02:01,750 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:02:01,751 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:02:01,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:02:01,756 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:02:01,758 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:02:01,760 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:02:01,761 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:02:01,762 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:02:01,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:02:01,764 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:02:01,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:02:01,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:02:01,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:02:01,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:02:01,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:02:01,774 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:02:01,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:02:01,778 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:02:01,779 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:02:01,781 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:02:01,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:02:01,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:02:01,785 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:02:01,786 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:02:01,786 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:02:01,788 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:02:01,788 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:02:01,789 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:02:01,790 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:02:01,791 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:02:01,793 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:02:01,793 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:02:01,794 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:02:01,794 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:02:01,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:02:01,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:02:01,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:02:01,798 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_825bd0bb-d655-42b9-bf37-adda7d8c0be7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:02:01,815 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:02:01,816 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:02:01,817 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:02:01,818 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:02:01,818 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:02:01,819 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:02:01,819 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:02:01,819 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:02:01,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:02:01,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:02:01,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:02:01,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:02:01,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:02:01,821 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:02:01,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:02:01,822 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:02:01,822 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:02:01,822 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:02:01,823 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:02:01,823 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:02:01,823 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:02:01,824 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:02:01,824 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:02:01,824 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:02:01,825 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:02:01,825 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:02:01,825 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:02:01,826 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:02:01,826 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_825bd0bb-d655-42b9-bf37-adda7d8c0be7/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b37fd9a6d9373ee025228ed18673aff9b4a368f6 [2019-11-15 23:02:01,860 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:02:01,882 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:02:01,890 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:02:01,892 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:02:01,893 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:02:01,895 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_825bd0bb-d655-42b9-bf37-adda7d8c0be7/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe022_rmo.opt.i [2019-11-15 23:02:01,974 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_825bd0bb-d655-42b9-bf37-adda7d8c0be7/bin/uautomizer/data/ba8eb6011/6f4440eecc444784867dccee41d9501a/FLAG82cc4d937 [2019-11-15 23:02:02,597 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:02:02,598 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_825bd0bb-d655-42b9-bf37-adda7d8c0be7/sv-benchmarks/c/pthread-wmm/safe022_rmo.opt.i [2019-11-15 23:02:02,620 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_825bd0bb-d655-42b9-bf37-adda7d8c0be7/bin/uautomizer/data/ba8eb6011/6f4440eecc444784867dccee41d9501a/FLAG82cc4d937 [2019-11-15 23:02:02,875 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_825bd0bb-d655-42b9-bf37-adda7d8c0be7/bin/uautomizer/data/ba8eb6011/6f4440eecc444784867dccee41d9501a [2019-11-15 23:02:02,878 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:02:02,881 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:02:02,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:02:02,887 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:02:02,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:02:02,894 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:02:02" (1/1) ... [2019-11-15 23:02:02,897 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22e31798 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:02, skipping insertion in model container [2019-11-15 23:02:02,897 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:02:02" (1/1) ... [2019-11-15 23:02:02,910 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:02:02,989 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:02:03,500 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:02:03,526 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:02:03,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:02:03,748 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:02:03,749 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:03 WrapperNode [2019-11-15 23:02:03,749 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:02:03,750 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:02:03,750 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:02:03,751 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:02:03,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:03" (1/1) ... [2019-11-15 23:02:03,797 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:03" (1/1) ... [2019-11-15 23:02:03,844 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:02:03,845 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:02:03,845 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:02:03,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:02:03,854 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:03" (1/1) ... [2019-11-15 23:02:03,855 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:03" (1/1) ... [2019-11-15 23:02:03,860 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:03" (1/1) ... [2019-11-15 23:02:03,862 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:03" (1/1) ... [2019-11-15 23:02:03,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:03" (1/1) ... [2019-11-15 23:02:03,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:03" (1/1) ... [2019-11-15 23:02:03,898 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:03" (1/1) ... [2019-11-15 23:02:03,903 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:02:03,904 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:02:03,905 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:02:03,905 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:02:03,906 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_825bd0bb-d655-42b9-bf37-adda7d8c0be7/bin/uautomizer/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-11-15 23:02:03,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 23:02:03,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 23:02:03,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 23:02:03,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 23:02:03,995 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 23:02:03,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 23:02:03,996 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 23:02:03,996 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 23:02:03,996 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 23:02:03,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:02:03,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:02:03,998 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-15 23:02:04,830 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:02:04,831 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 23:02:04,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:02:04 BoogieIcfgContainer [2019-11-15 23:02:04,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:02:04,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:02:04,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:02:04,837 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:02:04,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:02:02" (1/3) ... [2019-11-15 23:02:04,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625292f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:02:04, skipping insertion in model container [2019-11-15 23:02:04,842 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:02:03" (2/3) ... [2019-11-15 23:02:04,842 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@625292f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:02:04, skipping insertion in model container [2019-11-15 23:02:04,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:02:04" (3/3) ... [2019-11-15 23:02:04,845 INFO L109 eAbstractionObserver]: Analyzing ICFG safe022_rmo.opt.i [2019-11-15 23:02:04,930 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,930 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,930 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,931 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,931 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,931 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,932 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,932 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,932 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,933 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,933 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,933 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,933 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,934 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,934 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,934 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,935 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,935 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,935 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,936 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,936 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,936 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,937 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,937 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,937 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,937 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,938 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,938 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,939 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,939 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,939 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,940 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,940 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,940 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,943 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,943 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,944 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,944 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,944 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,945 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,945 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,946 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,947 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,949 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,949 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,949 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,951 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,951 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,951 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,952 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,952 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,953 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,953 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,953 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,953 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,954 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,954 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,956 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,956 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,956 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,957 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,957 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,957 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,957 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,958 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,958 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,958 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,959 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,959 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,959 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,959 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,960 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,961 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,961 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,961 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,961 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,962 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,962 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,962 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,963 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,963 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,963 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,963 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,964 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,964 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,964 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,964 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,965 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,965 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,965 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,966 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,967 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,967 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,967 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,968 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,968 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,968 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,969 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,969 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,969 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,970 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,973 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,974 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,974 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,974 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,974 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,975 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,975 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,975 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,975 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,975 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,976 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,976 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,976 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,976 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,977 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,977 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,977 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,977 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,977 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,978 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,978 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,978 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,978 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,979 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,979 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,979 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,979 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,979 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,980 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,980 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,980 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,980 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,981 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,981 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,981 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,981 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,981 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,982 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,982 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,982 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,982 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,983 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,983 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,983 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,983 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,983 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,984 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,984 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,984 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,984 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,984 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 23:02:04,991 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 23:02:04,992 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:02:05,001 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 23:02:05,014 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 23:02:05,036 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:02:05,036 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:02:05,037 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:02:05,037 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:02:05,037 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:02:05,037 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:02:05,037 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:02:05,037 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:02:05,052 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 178 transitions [2019-11-15 23:02:09,083 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32590 states. [2019-11-15 23:02:09,086 INFO L276 IsEmpty]: Start isEmpty. Operand 32590 states. [2019-11-15 23:02:09,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 23:02:09,100 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:09,101 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:09,106 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:09,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:09,114 INFO L82 PathProgramCache]: Analyzing trace with hash -254800073, now seen corresponding path program 1 times [2019-11-15 23:02:09,124 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:09,126 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179737315] [2019-11-15 23:02:09,126 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:09,127 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:09,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:09,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:09,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:09,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179737315] [2019-11-15 23:02:09,471 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:09,472 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:02:09,472 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128841673] [2019-11-15 23:02:09,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:02:09,478 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:09,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:02:09,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:02:09,500 INFO L87 Difference]: Start difference. First operand 32590 states. Second operand 4 states. [2019-11-15 23:02:10,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:10,456 INFO L93 Difference]: Finished difference Result 33590 states and 129567 transitions. [2019-11-15 23:02:10,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:02:10,459 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-15 23:02:10,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:10,800 INFO L225 Difference]: With dead ends: 33590 [2019-11-15 23:02:10,800 INFO L226 Difference]: Without dead ends: 25702 [2019-11-15 23:02:10,803 INFO L600 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-11-15 23:02:11,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-11-15 23:02:12,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 25702. [2019-11-15 23:02:12,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25702 states. [2019-11-15 23:02:12,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25702 states to 25702 states and 99583 transitions. [2019-11-15 23:02:12,620 INFO L78 Accepts]: Start accepts. Automaton has 25702 states and 99583 transitions. Word has length 33 [2019-11-15 23:02:12,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:12,620 INFO L462 AbstractCegarLoop]: Abstraction has 25702 states and 99583 transitions. [2019-11-15 23:02:12,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:02:12,621 INFO L276 IsEmpty]: Start isEmpty. Operand 25702 states and 99583 transitions. [2019-11-15 23:02:12,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 23:02:12,633 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:12,633 INFO L380 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-11-15 23:02:12,633 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:12,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:12,634 INFO L82 PathProgramCache]: Analyzing trace with hash -250081261, now seen corresponding path program 1 times [2019-11-15 23:02:12,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:12,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890844833] [2019-11-15 23:02:12,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:12,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:12,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:12,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:12,802 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890844833] [2019-11-15 23:02:12,802 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:12,803 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:02:12,803 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584169381] [2019-11-15 23:02:12,805 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:02:12,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:12,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:02:12,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:02:12,809 INFO L87 Difference]: Start difference. First operand 25702 states and 99583 transitions. Second operand 5 states. [2019-11-15 23:02:13,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:13,942 INFO L93 Difference]: Finished difference Result 41080 states and 150430 transitions. [2019-11-15 23:02:13,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:02:13,943 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 23:02:13,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:14,163 INFO L225 Difference]: With dead ends: 41080 [2019-11-15 23:02:14,163 INFO L226 Difference]: Without dead ends: 40544 [2019-11-15 23:02:14,165 INFO L600 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-11-15 23:02:14,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40544 states. [2019-11-15 23:02:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40544 to 38924. [2019-11-15 23:02:15,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38924 states. [2019-11-15 23:02:16,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38924 states to 38924 states and 143580 transitions. [2019-11-15 23:02:16,160 INFO L78 Accepts]: Start accepts. Automaton has 38924 states and 143580 transitions. Word has length 45 [2019-11-15 23:02:16,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:16,171 INFO L462 AbstractCegarLoop]: Abstraction has 38924 states and 143580 transitions. [2019-11-15 23:02:16,172 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:02:16,173 INFO L276 IsEmpty]: Start isEmpty. Operand 38924 states and 143580 transitions. [2019-11-15 23:02:16,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 23:02:16,186 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:16,186 INFO L380 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-11-15 23:02:16,186 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:16,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:16,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1037182150, now seen corresponding path program 1 times [2019-11-15 23:02:16,187 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:16,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492870313] [2019-11-15 23:02:16,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:16,189 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:16,189 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:16,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:16,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492870313] [2019-11-15 23:02:16,379 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:16,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:02:16,379 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758163177] [2019-11-15 23:02:16,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:02:16,381 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:16,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:02:16,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:02:16,382 INFO L87 Difference]: Start difference. First operand 38924 states and 143580 transitions. Second operand 5 states. [2019-11-15 23:02:17,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:17,123 INFO L93 Difference]: Finished difference Result 49777 states and 180632 transitions. [2019-11-15 23:02:17,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:02:17,124 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-15 23:02:17,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:17,384 INFO L225 Difference]: With dead ends: 49777 [2019-11-15 23:02:17,385 INFO L226 Difference]: Without dead ends: 49273 [2019-11-15 23:02:17,385 INFO L600 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-11-15 23:02:18,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49273 states. [2019-11-15 23:02:19,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49273 to 42676. [2019-11-15 23:02:19,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42676 states. [2019-11-15 23:02:19,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42676 states to 42676 states and 156591 transitions. [2019-11-15 23:02:19,509 INFO L78 Accepts]: Start accepts. Automaton has 42676 states and 156591 transitions. Word has length 46 [2019-11-15 23:02:19,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:19,510 INFO L462 AbstractCegarLoop]: Abstraction has 42676 states and 156591 transitions. [2019-11-15 23:02:19,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:02:19,510 INFO L276 IsEmpty]: Start isEmpty. Operand 42676 states and 156591 transitions. [2019-11-15 23:02:19,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 23:02:19,525 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:19,525 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:19,526 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:19,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:19,527 INFO L82 PathProgramCache]: Analyzing trace with hash 671596896, now seen corresponding path program 1 times [2019-11-15 23:02:19,527 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:19,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046848481] [2019-11-15 23:02:19,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:19,528 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:19,528 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:19,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:19,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:19,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046848481] [2019-11-15 23:02:19,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:19,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:02:19,646 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552707267] [2019-11-15 23:02:19,646 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:02:19,647 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:19,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:02:19,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:02:19,647 INFO L87 Difference]: Start difference. First operand 42676 states and 156591 transitions. Second operand 3 states. [2019-11-15 23:02:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:20,946 INFO L93 Difference]: Finished difference Result 61086 states and 221429 transitions. [2019-11-15 23:02:20,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:02:20,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-15 23:02:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:21,159 INFO L225 Difference]: With dead ends: 61086 [2019-11-15 23:02:21,159 INFO L226 Difference]: Without dead ends: 61086 [2019-11-15 23:02:21,160 INFO L600 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-11-15 23:02:21,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61086 states. [2019-11-15 23:02:22,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61086 to 48015. [2019-11-15 23:02:22,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48015 states. [2019-11-15 23:02:22,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48015 states to 48015 states and 174178 transitions. [2019-11-15 23:02:22,528 INFO L78 Accepts]: Start accepts. Automaton has 48015 states and 174178 transitions. Word has length 48 [2019-11-15 23:02:22,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:22,529 INFO L462 AbstractCegarLoop]: Abstraction has 48015 states and 174178 transitions. [2019-11-15 23:02:22,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:02:22,529 INFO L276 IsEmpty]: Start isEmpty. Operand 48015 states and 174178 transitions. [2019-11-15 23:02:22,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:02:22,545 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:22,546 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:22,546 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:22,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:22,547 INFO L82 PathProgramCache]: Analyzing trace with hash -934557998, now seen corresponding path program 1 times [2019-11-15 23:02:22,547 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:22,547 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728378687] [2019-11-15 23:02:22,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:22,548 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:22,548 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:22,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:22,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:22,739 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728378687] [2019-11-15 23:02:22,739 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:22,740 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:02:22,740 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790874386] [2019-11-15 23:02:22,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:02:22,741 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:22,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:02:22,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:02:22,742 INFO L87 Difference]: Start difference. First operand 48015 states and 174178 transitions. Second operand 6 states. [2019-11-15 23:02:23,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:23,873 INFO L93 Difference]: Finished difference Result 63755 states and 229378 transitions. [2019-11-15 23:02:23,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:02:23,874 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 23:02:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:24,098 INFO L225 Difference]: With dead ends: 63755 [2019-11-15 23:02:24,099 INFO L226 Difference]: Without dead ends: 63755 [2019-11-15 23:02:24,099 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:02:25,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63755 states. [2019-11-15 23:02:26,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63755 to 59948. [2019-11-15 23:02:26,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59948 states. [2019-11-15 23:02:26,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59948 states to 59948 states and 215671 transitions. [2019-11-15 23:02:26,592 INFO L78 Accepts]: Start accepts. Automaton has 59948 states and 215671 transitions. Word has length 52 [2019-11-15 23:02:26,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:26,593 INFO L462 AbstractCegarLoop]: Abstraction has 59948 states and 215671 transitions. [2019-11-15 23:02:26,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:02:26,593 INFO L276 IsEmpty]: Start isEmpty. Operand 59948 states and 215671 transitions. [2019-11-15 23:02:26,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:02:26,608 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:26,609 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:26,609 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:26,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:26,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1563457939, now seen corresponding path program 1 times [2019-11-15 23:02:26,610 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:26,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841481361] [2019-11-15 23:02:26,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:26,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:26,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:26,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:26,754 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841481361] [2019-11-15 23:02:26,754 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:26,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:02:26,755 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125662567] [2019-11-15 23:02:26,755 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:02:26,755 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:26,756 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:02:26,756 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:02:26,756 INFO L87 Difference]: Start difference. First operand 59948 states and 215671 transitions. Second operand 7 states. [2019-11-15 23:02:28,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:28,403 INFO L93 Difference]: Finished difference Result 83684 states and 290096 transitions. [2019-11-15 23:02:28,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 23:02:28,404 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 52 [2019-11-15 23:02:28,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:29,530 INFO L225 Difference]: With dead ends: 83684 [2019-11-15 23:02:29,531 INFO L226 Difference]: Without dead ends: 83684 [2019-11-15 23:02:29,532 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:02:29,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83684 states. [2019-11-15 23:02:31,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83684 to 71011. [2019-11-15 23:02:31,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71011 states. [2019-11-15 23:02:31,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71011 states to 71011 states and 249885 transitions. [2019-11-15 23:02:31,312 INFO L78 Accepts]: Start accepts. Automaton has 71011 states and 249885 transitions. Word has length 52 [2019-11-15 23:02:31,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:31,313 INFO L462 AbstractCegarLoop]: Abstraction has 71011 states and 249885 transitions. [2019-11-15 23:02:31,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:02:31,313 INFO L276 IsEmpty]: Start isEmpty. Operand 71011 states and 249885 transitions. [2019-11-15 23:02:31,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:02:31,329 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:31,329 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:31,330 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:31,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:31,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1844005676, now seen corresponding path program 1 times [2019-11-15 23:02:31,330 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:31,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622598540] [2019-11-15 23:02:31,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:31,331 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:31,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:31,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:31,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:31,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622598540] [2019-11-15 23:02:31,436 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:31,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:02:31,436 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213232606] [2019-11-15 23:02:31,437 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:02:31,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:31,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:02:31,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:02:31,438 INFO L87 Difference]: Start difference. First operand 71011 states and 249885 transitions. Second operand 4 states. [2019-11-15 23:02:31,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:31,541 INFO L93 Difference]: Finished difference Result 12158 states and 37828 transitions. [2019-11-15 23:02:31,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:02:31,542 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 52 [2019-11-15 23:02:31,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:31,566 INFO L225 Difference]: With dead ends: 12158 [2019-11-15 23:02:31,566 INFO L226 Difference]: Without dead ends: 10673 [2019-11-15 23:02:31,567 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:02:31,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10673 states. [2019-11-15 23:02:31,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10673 to 10624. [2019-11-15 23:02:31,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10624 states. [2019-11-15 23:02:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10624 states to 10624 states and 32590 transitions. [2019-11-15 23:02:31,815 INFO L78 Accepts]: Start accepts. Automaton has 10624 states and 32590 transitions. Word has length 52 [2019-11-15 23:02:31,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:31,815 INFO L462 AbstractCegarLoop]: Abstraction has 10624 states and 32590 transitions. [2019-11-15 23:02:31,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:02:31,815 INFO L276 IsEmpty]: Start isEmpty. Operand 10624 states and 32590 transitions. [2019-11-15 23:02:31,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 23:02:31,818 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:31,818 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:31,818 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:31,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:31,819 INFO L82 PathProgramCache]: Analyzing trace with hash -456832597, now seen corresponding path program 1 times [2019-11-15 23:02:31,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:31,820 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608685628] [2019-11-15 23:02:31,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:31,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:31,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:31,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:31,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:31,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608685628] [2019-11-15 23:02:31,949 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:31,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:02:31,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996473945] [2019-11-15 23:02:31,950 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:02:31,950 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:31,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:02:31,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:02:31,951 INFO L87 Difference]: Start difference. First operand 10624 states and 32590 transitions. Second operand 6 states. [2019-11-15 23:02:32,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:32,585 INFO L93 Difference]: Finished difference Result 13181 states and 39871 transitions. [2019-11-15 23:02:32,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:02:32,586 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 23:02:32,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:32,617 INFO L225 Difference]: With dead ends: 13181 [2019-11-15 23:02:32,618 INFO L226 Difference]: Without dead ends: 13118 [2019-11-15 23:02:32,619 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:02:32,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13118 states. [2019-11-15 23:02:32,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13118 to 11047. [2019-11-15 23:02:32,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11047 states. [2019-11-15 23:02:32,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11047 states to 11047 states and 33784 transitions. [2019-11-15 23:02:32,893 INFO L78 Accepts]: Start accepts. Automaton has 11047 states and 33784 transitions. Word has length 52 [2019-11-15 23:02:32,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:32,894 INFO L462 AbstractCegarLoop]: Abstraction has 11047 states and 33784 transitions. [2019-11-15 23:02:32,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:02:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 11047 states and 33784 transitions. [2019-11-15 23:02:32,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 23:02:32,900 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:32,901 INFO L380 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-11-15 23:02:32,901 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:32,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:32,902 INFO L82 PathProgramCache]: Analyzing trace with hash -257891193, now seen corresponding path program 1 times [2019-11-15 23:02:32,902 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:32,902 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120385600] [2019-11-15 23:02:32,902 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:32,903 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:32,903 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:32,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:33,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:33,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120385600] [2019-11-15 23:02:33,005 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:33,005 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:02:33,006 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666193666] [2019-11-15 23:02:33,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:02:33,007 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:33,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:02:33,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:02:33,009 INFO L87 Difference]: Start difference. First operand 11047 states and 33784 transitions. Second operand 4 states. [2019-11-15 23:02:33,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:33,208 INFO L93 Difference]: Finished difference Result 12861 states and 39390 transitions. [2019-11-15 23:02:33,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:02:33,208 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 23:02:33,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:33,236 INFO L225 Difference]: With dead ends: 12861 [2019-11-15 23:02:33,236 INFO L226 Difference]: Without dead ends: 12861 [2019-11-15 23:02:33,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:02:33,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12861 states. [2019-11-15 23:02:33,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12861 to 11692. [2019-11-15 23:02:33,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11692 states. [2019-11-15 23:02:33,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11692 states to 11692 states and 35761 transitions. [2019-11-15 23:02:33,495 INFO L78 Accepts]: Start accepts. Automaton has 11692 states and 35761 transitions. Word has length 60 [2019-11-15 23:02:33,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:33,495 INFO L462 AbstractCegarLoop]: Abstraction has 11692 states and 35761 transitions. [2019-11-15 23:02:33,495 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:02:33,495 INFO L276 IsEmpty]: Start isEmpty. Operand 11692 states and 35761 transitions. [2019-11-15 23:02:33,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 23:02:33,500 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:33,500 INFO L380 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-11-15 23:02:33,500 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:33,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:33,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1484919142, now seen corresponding path program 1 times [2019-11-15 23:02:33,501 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:33,501 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708891745] [2019-11-15 23:02:33,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:33,501 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:33,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:33,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:33,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:33,600 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708891745] [2019-11-15 23:02:33,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:33,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:02:33,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121100976] [2019-11-15 23:02:33,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:02:33,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:33,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:02:33,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:02:33,603 INFO L87 Difference]: Start difference. First operand 11692 states and 35761 transitions. Second operand 6 states. [2019-11-15 23:02:34,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:34,302 INFO L93 Difference]: Finished difference Result 14218 states and 42859 transitions. [2019-11-15 23:02:34,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:02:34,303 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-15 23:02:34,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:34,336 INFO L225 Difference]: With dead ends: 14218 [2019-11-15 23:02:34,336 INFO L226 Difference]: Without dead ends: 14157 [2019-11-15 23:02:34,343 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:02:34,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14157 states. [2019-11-15 23:02:34,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14157 to 13460. [2019-11-15 23:02:34,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13460 states. [2019-11-15 23:02:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13460 states to 13460 states and 40778 transitions. [2019-11-15 23:02:34,591 INFO L78 Accepts]: Start accepts. Automaton has 13460 states and 40778 transitions. Word has length 60 [2019-11-15 23:02:34,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:34,591 INFO L462 AbstractCegarLoop]: Abstraction has 13460 states and 40778 transitions. [2019-11-15 23:02:34,591 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:02:34,591 INFO L276 IsEmpty]: Start isEmpty. Operand 13460 states and 40778 transitions. [2019-11-15 23:02:34,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 23:02:34,598 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:34,599 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:34,599 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:34,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:34,599 INFO L82 PathProgramCache]: Analyzing trace with hash -266986464, now seen corresponding path program 1 times [2019-11-15 23:02:34,599 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:34,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605647545] [2019-11-15 23:02:34,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:34,600 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:34,600 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:34,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:34,707 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605647545] [2019-11-15 23:02:34,708 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:34,708 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:02:34,708 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143609271] [2019-11-15 23:02:34,708 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:02:34,709 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:34,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:02:34,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:02:34,709 INFO L87 Difference]: Start difference. First operand 13460 states and 40778 transitions. Second operand 4 states. [2019-11-15 23:02:35,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:35,120 INFO L93 Difference]: Finished difference Result 16502 states and 49370 transitions. [2019-11-15 23:02:35,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:02:35,120 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2019-11-15 23:02:35,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:35,153 INFO L225 Difference]: With dead ends: 16502 [2019-11-15 23:02:35,153 INFO L226 Difference]: Without dead ends: 16502 [2019-11-15 23:02:35,153 INFO L600 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-11-15 23:02:35,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16502 states. [2019-11-15 23:02:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16502 to 14981. [2019-11-15 23:02:35,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14981 states. [2019-11-15 23:02:35,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14981 states to 14981 states and 44959 transitions. [2019-11-15 23:02:35,425 INFO L78 Accepts]: Start accepts. Automaton has 14981 states and 44959 transitions. Word has length 64 [2019-11-15 23:02:35,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:35,426 INFO L462 AbstractCegarLoop]: Abstraction has 14981 states and 44959 transitions. [2019-11-15 23:02:35,426 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:02:35,426 INFO L276 IsEmpty]: Start isEmpty. Operand 14981 states and 44959 transitions. [2019-11-15 23:02:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 23:02:35,435 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:35,435 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:35,435 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:35,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:35,436 INFO L82 PathProgramCache]: Analyzing trace with hash 694627553, now seen corresponding path program 1 times [2019-11-15 23:02:35,436 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:35,436 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [709768664] [2019-11-15 23:02:35,436 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:35,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:35,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:35,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:35,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [709768664] [2019-11-15 23:02:35,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:35,482 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:02:35,482 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252100674] [2019-11-15 23:02:35,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:02:35,483 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:35,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:02:35,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:02:35,483 INFO L87 Difference]: Start difference. First operand 14981 states and 44959 transitions. Second operand 3 states. [2019-11-15 23:02:35,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:35,827 INFO L93 Difference]: Finished difference Result 15529 states and 46402 transitions. [2019-11-15 23:02:35,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:02:35,828 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-15 23:02:35,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:35,862 INFO L225 Difference]: With dead ends: 15529 [2019-11-15 23:02:35,862 INFO L226 Difference]: Without dead ends: 15529 [2019-11-15 23:02:35,863 INFO L600 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-11-15 23:02:35,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15529 states. [2019-11-15 23:02:36,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15529 to 15275. [2019-11-15 23:02:36,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15275 states. [2019-11-15 23:02:36,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15275 states to 15275 states and 45727 transitions. [2019-11-15 23:02:36,215 INFO L78 Accepts]: Start accepts. Automaton has 15275 states and 45727 transitions. Word has length 64 [2019-11-15 23:02:36,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:36,215 INFO L462 AbstractCegarLoop]: Abstraction has 15275 states and 45727 transitions. [2019-11-15 23:02:36,215 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:02:36,216 INFO L276 IsEmpty]: Start isEmpty. Operand 15275 states and 45727 transitions. [2019-11-15 23:02:36,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:02:36,230 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:36,230 INFO L380 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-11-15 23:02:36,230 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:36,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:36,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1438396840, now seen corresponding path program 1 times [2019-11-15 23:02:36,231 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:36,232 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104420530] [2019-11-15 23:02:36,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:36,232 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:36,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:36,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:36,399 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104420530] [2019-11-15 23:02:36,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:36,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:02:36,400 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322896257] [2019-11-15 23:02:36,400 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:02:36,400 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:36,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:02:36,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:02:36,401 INFO L87 Difference]: Start difference. First operand 15275 states and 45727 transitions. Second operand 6 states. [2019-11-15 23:02:37,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:37,042 INFO L93 Difference]: Finished difference Result 16272 states and 48102 transitions. [2019-11-15 23:02:37,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:02:37,054 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 23:02:37,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:37,090 INFO L225 Difference]: With dead ends: 16272 [2019-11-15 23:02:37,090 INFO L226 Difference]: Without dead ends: 16272 [2019-11-15 23:02:37,091 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:02:37,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16272 states. [2019-11-15 23:02:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16272 to 15848. [2019-11-15 23:02:37,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15848 states. [2019-11-15 23:02:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15848 states to 15848 states and 47024 transitions. [2019-11-15 23:02:37,372 INFO L78 Accepts]: Start accepts. Automaton has 15848 states and 47024 transitions. Word has length 66 [2019-11-15 23:02:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:37,373 INFO L462 AbstractCegarLoop]: Abstraction has 15848 states and 47024 transitions. [2019-11-15 23:02:37,373 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:02:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 15848 states and 47024 transitions. [2019-11-15 23:02:37,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:02:37,385 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:37,385 INFO L380 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-11-15 23:02:37,385 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:37,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:37,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1894956439, now seen corresponding path program 1 times [2019-11-15 23:02:37,385 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:37,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773647164] [2019-11-15 23:02:37,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:37,386 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:37,386 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:37,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:37,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:37,498 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773647164] [2019-11-15 23:02:37,498 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:37,499 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:02:37,499 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570936877] [2019-11-15 23:02:37,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:02:37,499 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:37,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:02:37,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:02:37,500 INFO L87 Difference]: Start difference. First operand 15848 states and 47024 transitions. Second operand 6 states. [2019-11-15 23:02:38,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:38,267 INFO L93 Difference]: Finished difference Result 18159 states and 52352 transitions. [2019-11-15 23:02:38,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:02:38,268 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 23:02:38,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:38,308 INFO L225 Difference]: With dead ends: 18159 [2019-11-15 23:02:38,309 INFO L226 Difference]: Without dead ends: 18159 [2019-11-15 23:02:38,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:02:38,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18159 states. [2019-11-15 23:02:38,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18159 to 16540. [2019-11-15 23:02:38,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16540 states. [2019-11-15 23:02:38,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16540 states to 16540 states and 48244 transitions. [2019-11-15 23:02:38,637 INFO L78 Accepts]: Start accepts. Automaton has 16540 states and 48244 transitions. Word has length 66 [2019-11-15 23:02:38,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:38,638 INFO L462 AbstractCegarLoop]: Abstraction has 16540 states and 48244 transitions. [2019-11-15 23:02:38,638 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:02:38,638 INFO L276 IsEmpty]: Start isEmpty. Operand 16540 states and 48244 transitions. [2019-11-15 23:02:38,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:02:38,653 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:38,653 INFO L380 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-11-15 23:02:38,653 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:38,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:38,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1683605526, now seen corresponding path program 1 times [2019-11-15 23:02:38,654 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:38,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725104204] [2019-11-15 23:02:38,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:38,654 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:38,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:38,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:38,733 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725104204] [2019-11-15 23:02:38,733 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:38,733 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:02:38,733 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791320768] [2019-11-15 23:02:38,734 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:02:38,734 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:38,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:02:38,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:02:38,734 INFO L87 Difference]: Start difference. First operand 16540 states and 48244 transitions. Second operand 5 states. [2019-11-15 23:02:39,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:39,187 INFO L93 Difference]: Finished difference Result 21454 states and 62484 transitions. [2019-11-15 23:02:39,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:02:39,188 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 23:02:39,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:39,233 INFO L225 Difference]: With dead ends: 21454 [2019-11-15 23:02:39,233 INFO L226 Difference]: Without dead ends: 21454 [2019-11-15 23:02:39,234 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:02:39,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21454 states. [2019-11-15 23:02:39,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21454 to 19519. [2019-11-15 23:02:39,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19519 states. [2019-11-15 23:02:39,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19519 states to 19519 states and 56653 transitions. [2019-11-15 23:02:39,580 INFO L78 Accepts]: Start accepts. Automaton has 19519 states and 56653 transitions. Word has length 66 [2019-11-15 23:02:39,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:39,581 INFO L462 AbstractCegarLoop]: Abstraction has 19519 states and 56653 transitions. [2019-11-15 23:02:39,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:02:39,581 INFO L276 IsEmpty]: Start isEmpty. Operand 19519 states and 56653 transitions. [2019-11-15 23:02:39,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:02:39,595 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:39,595 INFO L380 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-11-15 23:02:39,596 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:39,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:39,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2100827593, now seen corresponding path program 1 times [2019-11-15 23:02:39,596 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:39,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88943123] [2019-11-15 23:02:39,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:39,597 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:39,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:39,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:39,711 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:39,715 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88943123] [2019-11-15 23:02:39,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:39,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:02:39,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554757683] [2019-11-15 23:02:39,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:02:39,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:39,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:02:39,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:02:39,717 INFO L87 Difference]: Start difference. First operand 19519 states and 56653 transitions. Second operand 6 states. [2019-11-15 23:02:41,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:41,022 INFO L93 Difference]: Finished difference Result 25825 states and 75779 transitions. [2019-11-15 23:02:41,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:02:41,022 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 23:02:41,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:41,068 INFO L225 Difference]: With dead ends: 25825 [2019-11-15 23:02:41,068 INFO L226 Difference]: Without dead ends: 25714 [2019-11-15 23:02:41,069 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:02:41,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25714 states. [2019-11-15 23:02:41,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25714 to 23566. [2019-11-15 23:02:41,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23566 states. [2019-11-15 23:02:41,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23566 states to 23566 states and 68831 transitions. [2019-11-15 23:02:41,490 INFO L78 Accepts]: Start accepts. Automaton has 23566 states and 68831 transitions. Word has length 66 [2019-11-15 23:02:41,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:41,491 INFO L462 AbstractCegarLoop]: Abstraction has 23566 states and 68831 transitions. [2019-11-15 23:02:41,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:02:41,491 INFO L276 IsEmpty]: Start isEmpty. Operand 23566 states and 68831 transitions. [2019-11-15 23:02:41,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:02:41,505 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:41,505 INFO L380 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-11-15 23:02:41,505 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:41,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:41,506 INFO L82 PathProgramCache]: Analyzing trace with hash -386685240, now seen corresponding path program 1 times [2019-11-15 23:02:41,506 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:41,507 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397931575] [2019-11-15 23:02:41,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:41,507 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:41,507 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:41,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:41,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:41,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397931575] [2019-11-15 23:02:41,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:41,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:02:41,583 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026754624] [2019-11-15 23:02:41,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:02:41,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:41,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:02:41,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:02:41,584 INFO L87 Difference]: Start difference. First operand 23566 states and 68831 transitions. Second operand 5 states. [2019-11-15 23:02:42,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:42,228 INFO L93 Difference]: Finished difference Result 31929 states and 92500 transitions. [2019-11-15 23:02:42,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:02:42,229 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 23:02:42,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:42,289 INFO L225 Difference]: With dead ends: 31929 [2019-11-15 23:02:42,289 INFO L226 Difference]: Without dead ends: 31839 [2019-11-15 23:02:42,290 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:02:42,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31839 states. [2019-11-15 23:02:42,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31839 to 25895. [2019-11-15 23:02:42,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25895 states. [2019-11-15 23:02:42,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25895 states to 25895 states and 75353 transitions. [2019-11-15 23:02:42,840 INFO L78 Accepts]: Start accepts. Automaton has 25895 states and 75353 transitions. Word has length 66 [2019-11-15 23:02:42,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:42,840 INFO L462 AbstractCegarLoop]: Abstraction has 25895 states and 75353 transitions. [2019-11-15 23:02:42,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:02:42,840 INFO L276 IsEmpty]: Start isEmpty. Operand 25895 states and 75353 transitions. [2019-11-15 23:02:42,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:02:42,851 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:42,852 INFO L380 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-11-15 23:02:42,852 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:42,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:42,852 INFO L82 PathProgramCache]: Analyzing trace with hash 303876234, now seen corresponding path program 1 times [2019-11-15 23:02:42,853 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:42,853 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307449031] [2019-11-15 23:02:42,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:42,853 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:42,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:42,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:43,028 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307449031] [2019-11-15 23:02:43,029 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:43,029 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:02:43,029 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926729927] [2019-11-15 23:02:43,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:02:43,030 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:43,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:02:43,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:02:43,031 INFO L87 Difference]: Start difference. First operand 25895 states and 75353 transitions. Second operand 7 states. [2019-11-15 23:02:43,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:43,613 INFO L93 Difference]: Finished difference Result 23112 states and 64209 transitions. [2019-11-15 23:02:43,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 23:02:43,614 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-11-15 23:02:43,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:43,649 INFO L225 Difference]: With dead ends: 23112 [2019-11-15 23:02:43,649 INFO L226 Difference]: Without dead ends: 23112 [2019-11-15 23:02:43,649 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-15 23:02:43,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23112 states. [2019-11-15 23:02:43,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23112 to 18808. [2019-11-15 23:02:43,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18808 states. [2019-11-15 23:02:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18808 states to 18808 states and 52244 transitions. [2019-11-15 23:02:43,970 INFO L78 Accepts]: Start accepts. Automaton has 18808 states and 52244 transitions. Word has length 66 [2019-11-15 23:02:43,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:43,970 INFO L462 AbstractCegarLoop]: Abstraction has 18808 states and 52244 transitions. [2019-11-15 23:02:43,970 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:02:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 18808 states and 52244 transitions. [2019-11-15 23:02:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:02:43,979 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:43,979 INFO L380 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-11-15 23:02:43,979 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:43,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:43,980 INFO L82 PathProgramCache]: Analyzing trace with hash 1191379915, now seen corresponding path program 1 times [2019-11-15 23:02:43,980 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:43,980 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807122253] [2019-11-15 23:02:43,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:43,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:43,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:43,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:44,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:44,063 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807122253] [2019-11-15 23:02:44,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:44,064 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:02:44,064 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149592099] [2019-11-15 23:02:44,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:02:44,065 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:44,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:02:44,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:02:44,065 INFO L87 Difference]: Start difference. First operand 18808 states and 52244 transitions. Second operand 5 states. [2019-11-15 23:02:44,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:44,129 INFO L93 Difference]: Finished difference Result 6130 states and 14461 transitions. [2019-11-15 23:02:44,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:02:44,129 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 23:02:44,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:44,137 INFO L225 Difference]: With dead ends: 6130 [2019-11-15 23:02:44,138 INFO L226 Difference]: Without dead ends: 5260 [2019-11-15 23:02:44,138 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:02:44,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5260 states. [2019-11-15 23:02:44,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5260 to 4725. [2019-11-15 23:02:44,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4725 states. [2019-11-15 23:02:44,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 10820 transitions. [2019-11-15 23:02:44,236 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 10820 transitions. Word has length 66 [2019-11-15 23:02:44,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:44,236 INFO L462 AbstractCegarLoop]: Abstraction has 4725 states and 10820 transitions. [2019-11-15 23:02:44,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:02:44,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 10820 transitions. [2019-11-15 23:02:44,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 23:02:44,242 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:44,243 INFO L380 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-11-15 23:02:44,243 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:44,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:44,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1738873321, now seen corresponding path program 1 times [2019-11-15 23:02:44,244 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:44,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611215517] [2019-11-15 23:02:44,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:44,244 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:44,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:44,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:44,288 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611215517] [2019-11-15 23:02:44,288 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:44,288 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:02:44,289 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983253020] [2019-11-15 23:02:44,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:02:44,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:44,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:02:44,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:02:44,291 INFO L87 Difference]: Start difference. First operand 4725 states and 10820 transitions. Second operand 3 states. [2019-11-15 23:02:44,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:44,341 INFO L93 Difference]: Finished difference Result 5855 states and 13186 transitions. [2019-11-15 23:02:44,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:02:44,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 23:02:44,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:44,349 INFO L225 Difference]: With dead ends: 5855 [2019-11-15 23:02:44,350 INFO L226 Difference]: Without dead ends: 5855 [2019-11-15 23:02:44,350 INFO L600 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-11-15 23:02:44,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5855 states. [2019-11-15 23:02:44,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5855 to 4660. [2019-11-15 23:02:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-11-15 23:02:44,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 10382 transitions. [2019-11-15 23:02:44,442 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 10382 transitions. Word has length 66 [2019-11-15 23:02:44,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:44,442 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 10382 transitions. [2019-11-15 23:02:44,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:02:44,443 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 10382 transitions. [2019-11-15 23:02:44,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 23:02:44,449 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:44,449 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:44,449 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:44,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:44,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1014352042, now seen corresponding path program 1 times [2019-11-15 23:02:44,450 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:44,450 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511776357] [2019-11-15 23:02:44,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:44,451 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:44,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:44,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:44,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511776357] [2019-11-15 23:02:44,541 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:44,541 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:02:44,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852153978] [2019-11-15 23:02:44,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:02:44,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:44,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:02:44,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:02:44,543 INFO L87 Difference]: Start difference. First operand 4660 states and 10382 transitions. Second operand 5 states. [2019-11-15 23:02:44,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:44,786 INFO L93 Difference]: Finished difference Result 5721 states and 12811 transitions. [2019-11-15 23:02:44,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 23:02:44,787 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-11-15 23:02:44,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:44,792 INFO L225 Difference]: With dead ends: 5721 [2019-11-15 23:02:44,792 INFO L226 Difference]: Without dead ends: 5721 [2019-11-15 23:02:44,793 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:02:44,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5721 states. [2019-11-15 23:02:44,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5721 to 5080. [2019-11-15 23:02:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5080 states. [2019-11-15 23:02:44,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5080 states to 5080 states and 11340 transitions. [2019-11-15 23:02:44,859 INFO L78 Accepts]: Start accepts. Automaton has 5080 states and 11340 transitions. Word has length 72 [2019-11-15 23:02:44,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:44,860 INFO L462 AbstractCegarLoop]: Abstraction has 5080 states and 11340 transitions. [2019-11-15 23:02:44,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:02:44,860 INFO L276 IsEmpty]: Start isEmpty. Operand 5080 states and 11340 transitions. [2019-11-15 23:02:44,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 23:02:44,865 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:44,865 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:44,866 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:44,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:44,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1537804919, now seen corresponding path program 1 times [2019-11-15 23:02:44,866 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:44,867 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875368748] [2019-11-15 23:02:44,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:44,867 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:44,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:44,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:44,951 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875368748] [2019-11-15 23:02:44,951 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:44,952 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:02:44,952 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303576775] [2019-11-15 23:02:44,952 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:02:44,952 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:44,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:02:44,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:02:44,953 INFO L87 Difference]: Start difference. First operand 5080 states and 11340 transitions. Second operand 7 states. [2019-11-15 23:02:45,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:45,604 INFO L93 Difference]: Finished difference Result 5820 states and 12863 transitions. [2019-11-15 23:02:45,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 23:02:45,604 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-11-15 23:02:45,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:45,612 INFO L225 Difference]: With dead ends: 5820 [2019-11-15 23:02:45,612 INFO L226 Difference]: Without dead ends: 5767 [2019-11-15 23:02:45,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:02:45,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5767 states. [2019-11-15 23:02:45,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5767 to 5167. [2019-11-15 23:02:45,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5167 states. [2019-11-15 23:02:45,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5167 states to 5167 states and 11429 transitions. [2019-11-15 23:02:45,715 INFO L78 Accepts]: Start accepts. Automaton has 5167 states and 11429 transitions. Word has length 72 [2019-11-15 23:02:45,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:45,716 INFO L462 AbstractCegarLoop]: Abstraction has 5167 states and 11429 transitions. [2019-11-15 23:02:45,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:02:45,716 INFO L276 IsEmpty]: Start isEmpty. Operand 5167 states and 11429 transitions. [2019-11-15 23:02:45,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 23:02:45,723 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:45,724 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:45,724 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:45,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:45,724 INFO L82 PathProgramCache]: Analyzing trace with hash 313645306, now seen corresponding path program 1 times [2019-11-15 23:02:45,725 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:45,725 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596669288] [2019-11-15 23:02:45,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:45,725 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:45,725 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:45,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:45,804 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:45,804 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596669288] [2019-11-15 23:02:45,805 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:45,805 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:02:45,805 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665915271] [2019-11-15 23:02:45,808 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:02:45,808 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:45,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:02:45,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:02:45,809 INFO L87 Difference]: Start difference. First operand 5167 states and 11429 transitions. Second operand 5 states. [2019-11-15 23:02:46,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:46,278 INFO L93 Difference]: Finished difference Result 6009 states and 13221 transitions. [2019-11-15 23:02:46,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 23:02:46,279 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-15 23:02:46,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:46,287 INFO L225 Difference]: With dead ends: 6009 [2019-11-15 23:02:46,287 INFO L226 Difference]: Without dead ends: 6009 [2019-11-15 23:02:46,287 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:02:46,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6009 states. [2019-11-15 23:02:46,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6009 to 5312. [2019-11-15 23:02:46,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5312 states. [2019-11-15 23:02:46,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5312 states to 5312 states and 11744 transitions. [2019-11-15 23:02:46,389 INFO L78 Accepts]: Start accepts. Automaton has 5312 states and 11744 transitions. Word has length 93 [2019-11-15 23:02:46,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:46,390 INFO L462 AbstractCegarLoop]: Abstraction has 5312 states and 11744 transitions. [2019-11-15 23:02:46,390 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:02:46,390 INFO L276 IsEmpty]: Start isEmpty. Operand 5312 states and 11744 transitions. [2019-11-15 23:02:46,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 23:02:46,397 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:46,398 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:46,398 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:46,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:46,399 INFO L82 PathProgramCache]: Analyzing trace with hash -1223592850, now seen corresponding path program 1 times [2019-11-15 23:02:46,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:46,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458147544] [2019-11-15 23:02:46,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:46,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:46,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:46,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:46,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:46,468 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458147544] [2019-11-15 23:02:46,468 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:46,468 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:02:46,469 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331023620] [2019-11-15 23:02:46,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:02:46,469 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:46,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:02:46,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:02:46,471 INFO L87 Difference]: Start difference. First operand 5312 states and 11744 transitions. Second operand 4 states. [2019-11-15 23:02:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:46,644 INFO L93 Difference]: Finished difference Result 6275 states and 13793 transitions. [2019-11-15 23:02:46,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:02:46,644 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-15 23:02:46,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:46,653 INFO L225 Difference]: With dead ends: 6275 [2019-11-15 23:02:46,653 INFO L226 Difference]: Without dead ends: 6275 [2019-11-15 23:02:46,655 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:02:46,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6275 states. [2019-11-15 23:02:46,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6275 to 5506. [2019-11-15 23:02:46,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5506 states. [2019-11-15 23:02:46,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5506 states to 5506 states and 12150 transitions. [2019-11-15 23:02:46,763 INFO L78 Accepts]: Start accepts. Automaton has 5506 states and 12150 transitions. Word has length 93 [2019-11-15 23:02:46,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:46,763 INFO L462 AbstractCegarLoop]: Abstraction has 5506 states and 12150 transitions. [2019-11-15 23:02:46,763 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:02:46,764 INFO L276 IsEmpty]: Start isEmpty. Operand 5506 states and 12150 transitions. [2019-11-15 23:02:46,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:02:46,772 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:46,773 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:46,773 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:46,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:46,774 INFO L82 PathProgramCache]: Analyzing trace with hash -45263679, now seen corresponding path program 1 times [2019-11-15 23:02:46,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:46,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191813177] [2019-11-15 23:02:46,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:46,775 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:46,775 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:46,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:46,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:46,949 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191813177] [2019-11-15 23:02:46,950 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:46,950 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 23:02:46,950 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739803043] [2019-11-15 23:02:46,951 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 23:02:46,951 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:46,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 23:02:46,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 23:02:46,952 INFO L87 Difference]: Start difference. First operand 5506 states and 12150 transitions. Second operand 8 states. [2019-11-15 23:02:48,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:48,340 INFO L93 Difference]: Finished difference Result 7002 states and 15221 transitions. [2019-11-15 23:02:48,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 23:02:48,341 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-11-15 23:02:48,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:48,351 INFO L225 Difference]: With dead ends: 7002 [2019-11-15 23:02:48,351 INFO L226 Difference]: Without dead ends: 6949 [2019-11-15 23:02:48,351 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2019-11-15 23:02:48,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6949 states. [2019-11-15 23:02:48,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6949 to 5919. [2019-11-15 23:02:48,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5919 states. [2019-11-15 23:02:48,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5919 states to 5919 states and 12985 transitions. [2019-11-15 23:02:48,475 INFO L78 Accepts]: Start accepts. Automaton has 5919 states and 12985 transitions. Word has length 95 [2019-11-15 23:02:48,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:48,476 INFO L462 AbstractCegarLoop]: Abstraction has 5919 states and 12985 transitions. [2019-11-15 23:02:48,476 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 23:02:48,476 INFO L276 IsEmpty]: Start isEmpty. Operand 5919 states and 12985 transitions. [2019-11-15 23:02:48,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:02:48,488 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:48,489 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:48,489 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:48,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:48,490 INFO L82 PathProgramCache]: Analyzing trace with hash -24926304, now seen corresponding path program 1 times [2019-11-15 23:02:48,490 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:48,490 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232455043] [2019-11-15 23:02:48,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:48,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:48,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:48,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:48,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:48,588 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232455043] [2019-11-15 23:02:48,588 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:48,588 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:02:48,588 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358134103] [2019-11-15 23:02:48,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:02:48,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:48,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:02:48,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:02:48,590 INFO L87 Difference]: Start difference. First operand 5919 states and 12985 transitions. Second operand 4 states. [2019-11-15 23:02:49,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:49,019 INFO L93 Difference]: Finished difference Result 6877 states and 15030 transitions. [2019-11-15 23:02:49,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 23:02:49,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 23:02:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:49,028 INFO L225 Difference]: With dead ends: 6877 [2019-11-15 23:02:49,028 INFO L226 Difference]: Without dead ends: 6809 [2019-11-15 23:02:49,028 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:02:49,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6809 states. [2019-11-15 23:02:49,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6809 to 6299. [2019-11-15 23:02:49,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6299 states. [2019-11-15 23:02:49,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6299 states to 6299 states and 13863 transitions. [2019-11-15 23:02:49,143 INFO L78 Accepts]: Start accepts. Automaton has 6299 states and 13863 transitions. Word has length 95 [2019-11-15 23:02:49,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:49,143 INFO L462 AbstractCegarLoop]: Abstraction has 6299 states and 13863 transitions. [2019-11-15 23:02:49,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:02:49,144 INFO L276 IsEmpty]: Start isEmpty. Operand 6299 states and 13863 transitions. [2019-11-15 23:02:49,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:02:49,155 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:49,156 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:49,156 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:49,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:49,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2102135647, now seen corresponding path program 1 times [2019-11-15 23:02:49,157 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:49,157 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560181534] [2019-11-15 23:02:49,157 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:49,158 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:49,158 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:49,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:49,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:49,466 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560181534] [2019-11-15 23:02:49,467 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:49,467 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:02:49,467 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9392420] [2019-11-15 23:02:49,468 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:02:49,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:49,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:02:49,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:02:49,469 INFO L87 Difference]: Start difference. First operand 6299 states and 13863 transitions. Second operand 9 states. [2019-11-15 23:02:50,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:50,426 INFO L93 Difference]: Finished difference Result 8182 states and 17900 transitions. [2019-11-15 23:02:50,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 23:02:50,426 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-11-15 23:02:50,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:50,434 INFO L225 Difference]: With dead ends: 8182 [2019-11-15 23:02:50,434 INFO L226 Difference]: Without dead ends: 8142 [2019-11-15 23:02:50,435 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=299, Unknown=0, NotChecked=0, Total=380 [2019-11-15 23:02:50,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8142 states. [2019-11-15 23:02:50,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8142 to 6554. [2019-11-15 23:02:50,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6554 states. [2019-11-15 23:02:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6554 states to 6554 states and 14405 transitions. [2019-11-15 23:02:50,531 INFO L78 Accepts]: Start accepts. Automaton has 6554 states and 14405 transitions. Word has length 95 [2019-11-15 23:02:50,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:50,531 INFO L462 AbstractCegarLoop]: Abstraction has 6554 states and 14405 transitions. [2019-11-15 23:02:50,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:02:50,532 INFO L276 IsEmpty]: Start isEmpty. Operand 6554 states and 14405 transitions. [2019-11-15 23:02:50,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:02:50,538 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:50,538 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:50,538 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:50,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:50,538 INFO L82 PathProgramCache]: Analyzing trace with hash -1214631966, now seen corresponding path program 1 times [2019-11-15 23:02:50,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:50,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945529526] [2019-11-15 23:02:50,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:50,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:50,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:50,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:50,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:50,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945529526] [2019-11-15 23:02:50,817 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:50,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:02:50,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [782754987] [2019-11-15 23:02:50,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:02:50,819 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:50,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:02:50,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:02:50,819 INFO L87 Difference]: Start difference. First operand 6554 states and 14405 transitions. Second operand 9 states. [2019-11-15 23:02:51,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:51,571 INFO L93 Difference]: Finished difference Result 7723 states and 16891 transitions. [2019-11-15 23:02:51,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-15 23:02:51,571 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-11-15 23:02:51,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:51,579 INFO L225 Difference]: With dead ends: 7723 [2019-11-15 23:02:51,579 INFO L226 Difference]: Without dead ends: 7723 [2019-11-15 23:02:51,579 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=320, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:02:51,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7723 states. [2019-11-15 23:02:51,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7723 to 6201. [2019-11-15 23:02:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6201 states. [2019-11-15 23:02:51,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6201 states to 6201 states and 13646 transitions. [2019-11-15 23:02:51,669 INFO L78 Accepts]: Start accepts. Automaton has 6201 states and 13646 transitions. Word has length 95 [2019-11-15 23:02:51,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:51,669 INFO L462 AbstractCegarLoop]: Abstraction has 6201 states and 13646 transitions. [2019-11-15 23:02:51,669 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:02:51,670 INFO L276 IsEmpty]: Start isEmpty. Operand 6201 states and 13646 transitions. [2019-11-15 23:02:51,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:02:51,676 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:51,676 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:51,676 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:51,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:51,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1890784734, now seen corresponding path program 1 times [2019-11-15 23:02:51,677 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:51,677 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903016645] [2019-11-15 23:02:51,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:51,677 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:51,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:51,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:51,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903016645] [2019-11-15 23:02:51,902 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:51,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 23:02:51,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208211301] [2019-11-15 23:02:51,903 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 23:02:51,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:51,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 23:02:51,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-11-15 23:02:51,905 INFO L87 Difference]: Start difference. First operand 6201 states and 13646 transitions. Second operand 9 states. [2019-11-15 23:02:52,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:52,778 INFO L93 Difference]: Finished difference Result 6559 states and 14382 transitions. [2019-11-15 23:02:52,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-11-15 23:02:52,778 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-11-15 23:02:52,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:52,787 INFO L225 Difference]: With dead ends: 6559 [2019-11-15 23:02:52,788 INFO L226 Difference]: Without dead ends: 6559 [2019-11-15 23:02:52,790 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2019-11-15 23:02:52,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6559 states. [2019-11-15 23:02:52,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6559 to 6082. [2019-11-15 23:02:52,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6082 states. [2019-11-15 23:02:52,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6082 states to 6082 states and 13396 transitions. [2019-11-15 23:02:52,902 INFO L78 Accepts]: Start accepts. Automaton has 6082 states and 13396 transitions. Word has length 95 [2019-11-15 23:02:52,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:52,903 INFO L462 AbstractCegarLoop]: Abstraction has 6082 states and 13396 transitions. [2019-11-15 23:02:52,903 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 23:02:52,903 INFO L276 IsEmpty]: Start isEmpty. Operand 6082 states and 13396 transitions. [2019-11-15 23:02:52,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:02:52,912 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:52,912 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:52,912 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:52,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:52,913 INFO L82 PathProgramCache]: Analyzing trace with hash -1003281053, now seen corresponding path program 1 times [2019-11-15 23:02:52,913 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:52,913 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330423845] [2019-11-15 23:02:52,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:52,914 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:52,914 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:53,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:53,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330423845] [2019-11-15 23:02:53,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:53,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 23:02:53,170 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130347516] [2019-11-15 23:02:53,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 23:02:53,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:53,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 23:02:53,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 23:02:53,171 INFO L87 Difference]: Start difference. First operand 6082 states and 13396 transitions. Second operand 10 states. [2019-11-15 23:02:53,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:53,705 INFO L93 Difference]: Finished difference Result 18898 states and 42296 transitions. [2019-11-15 23:02:53,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-11-15 23:02:53,705 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-15 23:02:53,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:53,719 INFO L225 Difference]: With dead ends: 18898 [2019-11-15 23:02:53,719 INFO L226 Difference]: Without dead ends: 12522 [2019-11-15 23:02:53,720 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=95, Invalid=367, Unknown=0, NotChecked=0, Total=462 [2019-11-15 23:02:53,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12522 states. [2019-11-15 23:02:53,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12522 to 5987. [2019-11-15 23:02:53,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5987 states. [2019-11-15 23:02:53,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5987 states to 5987 states and 13116 transitions. [2019-11-15 23:02:53,838 INFO L78 Accepts]: Start accepts. Automaton has 5987 states and 13116 transitions. Word has length 95 [2019-11-15 23:02:53,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:53,838 INFO L462 AbstractCegarLoop]: Abstraction has 5987 states and 13116 transitions. [2019-11-15 23:02:53,838 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 23:02:53,838 INFO L276 IsEmpty]: Start isEmpty. Operand 5987 states and 13116 transitions. [2019-11-15 23:02:53,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:02:53,844 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:53,845 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:53,845 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:53,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:53,846 INFO L82 PathProgramCache]: Analyzing trace with hash 873793154, now seen corresponding path program 1 times [2019-11-15 23:02:53,846 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:53,846 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815851900] [2019-11-15 23:02:53,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:53,846 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:53,846 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:53,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:54,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:54,014 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815851900] [2019-11-15 23:02:54,015 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:54,015 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 23:02:54,015 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1398918368] [2019-11-15 23:02:54,016 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 23:02:54,016 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:54,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 23:02:54,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-15 23:02:54,017 INFO L87 Difference]: Start difference. First operand 5987 states and 13116 transitions. Second operand 6 states. [2019-11-15 23:02:54,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:54,324 INFO L93 Difference]: Finished difference Result 6745 states and 14647 transitions. [2019-11-15 23:02:54,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 23:02:54,325 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 23:02:54,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:54,334 INFO L225 Difference]: With dead ends: 6745 [2019-11-15 23:02:54,334 INFO L226 Difference]: Without dead ends: 6686 [2019-11-15 23:02:54,335 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:02:54,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6686 states. [2019-11-15 23:02:54,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6686 to 6007. [2019-11-15 23:02:54,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6007 states. [2019-11-15 23:02:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6007 states to 6007 states and 13085 transitions. [2019-11-15 23:02:54,448 INFO L78 Accepts]: Start accepts. Automaton has 6007 states and 13085 transitions. Word has length 95 [2019-11-15 23:02:54,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:54,448 INFO L462 AbstractCegarLoop]: Abstraction has 6007 states and 13085 transitions. [2019-11-15 23:02:54,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 23:02:54,449 INFO L276 IsEmpty]: Start isEmpty. Operand 6007 states and 13085 transitions. [2019-11-15 23:02:54,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:02:54,458 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:54,458 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:54,459 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:54,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:54,459 INFO L82 PathProgramCache]: Analyzing trace with hash -490679198, now seen corresponding path program 2 times [2019-11-15 23:02:54,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:54,463 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660032545] [2019-11-15 23:02:54,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:54,463 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:54,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:54,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:02:54,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:02:54,606 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660032545] [2019-11-15 23:02:54,607 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:02:54,607 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 23:02:54,607 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311460403] [2019-11-15 23:02:54,608 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 23:02:54,608 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:02:54,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 23:02:54,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:02:54,609 INFO L87 Difference]: Start difference. First operand 6007 states and 13085 transitions. Second operand 7 states. [2019-11-15 23:02:55,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:02:55,095 INFO L93 Difference]: Finished difference Result 6072 states and 13151 transitions. [2019-11-15 23:02:55,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 23:02:55,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-15 23:02:55,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:02:55,107 INFO L225 Difference]: With dead ends: 6072 [2019-11-15 23:02:55,107 INFO L226 Difference]: Without dead ends: 6072 [2019-11-15 23:02:55,107 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-15 23:02:55,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6072 states. [2019-11-15 23:02:55,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6072 to 5827. [2019-11-15 23:02:55,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5827 states. [2019-11-15 23:02:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5827 states to 5827 states and 12649 transitions. [2019-11-15 23:02:55,181 INFO L78 Accepts]: Start accepts. Automaton has 5827 states and 12649 transitions. Word has length 95 [2019-11-15 23:02:55,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:02:55,181 INFO L462 AbstractCegarLoop]: Abstraction has 5827 states and 12649 transitions. [2019-11-15 23:02:55,181 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 23:02:55,181 INFO L276 IsEmpty]: Start isEmpty. Operand 5827 states and 12649 transitions. [2019-11-15 23:02:55,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:02:55,187 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:02:55,187 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:02:55,187 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:02:55,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:02:55,187 INFO L82 PathProgramCache]: Analyzing trace with hash 425096515, now seen corresponding path program 2 times [2019-11-15 23:02:55,187 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:02:55,188 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206996281] [2019-11-15 23:02:55,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:55,188 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:02:55,188 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:02:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:02:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:02:55,286 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:02:55,287 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:02:55,452 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 23:02:55,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:02:55 BasicIcfg [2019-11-15 23:02:55,454 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:02:55,454 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:02:55,455 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:02:55,455 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:02:55,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:02:04" (3/4) ... [2019-11-15 23:02:55,458 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:02:55,609 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_825bd0bb-d655-42b9-bf37-adda7d8c0be7/bin/uautomizer/witness.graphml [2019-11-15 23:02:55,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:02:55,612 INFO L168 Benchmark]: Toolchain (without parser) took 52730.58 ms. Allocated memory was 1.0 GB in the beginning and 3.8 GB in the end (delta: 2.8 GB). Free memory was 940.8 MB in the beginning and 2.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 1.6 GB. Max. memory is 11.5 GB. [2019-11-15 23:02:55,612 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:02:55,613 INFO L168 Benchmark]: CACSL2BoogieTranslator took 867.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:02:55,613 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:02:55,614 INFO L168 Benchmark]: Boogie Preprocessor took 59.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:02:55,614 INFO L168 Benchmark]: RCFGBuilder took 928.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:02:55,615 INFO L168 Benchmark]: TraceAbstraction took 50620.85 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. [2019-11-15 23:02:55,615 INFO L168 Benchmark]: Witness Printer took 155.12 ms. Allocated memory is still 3.8 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 GB. [2019-11-15 23:02:55,617 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.26 ms. Allocated memory is still 1.0 GB. Free memory is still 967.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 867.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 164.1 MB). Free memory was 940.8 MB in the beginning and 1.1 GB in the end (delta: -181.3 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 94.07 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 59.34 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 928.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 52.2 MB). Peak memory consumption was 52.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 50620.85 ms. Allocated memory was 1.2 GB in the beginning and 3.8 GB in the end (delta: 2.6 GB). Free memory was 1.1 GB in the beginning and 2.2 GB in the end (delta: -1.1 GB). Peak memory consumption was 1.5 GB. Max. memory is 11.5 GB. * Witness Printer took 155.12 ms. Allocated memory is still 3.8 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 16.0 MB). Peak memory consumption was 16.0 MB. Max. memory is 11.5 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] [L704] 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, y=0] [L705] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L706] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L707] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L708] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L709] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L710] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0] [L711] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L712] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L713] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0] [L714] 0 int *y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L715] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L716] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L717] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L718] 0 _Bool y$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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L793] 0 pthread_t t2315; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L794] FCALL, FORK 0 pthread_create(&t2315, ((void *)0), P0, ((void *)0)) 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L795] 0 pthread_t t2316; 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L724] 1 y$w_buff1 = y$w_buff0 [L725] 1 y$w_buff0 = 1 [L726] 1 y$w_buff1_used = y$w_buff0_used [L727] 1 y$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) 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, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L730] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L731] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L732] 1 y$r_buff0_thd1 = (_Bool)1 [L735] 1 x = 1 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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L796] FCALL, FORK 0 pthread_create(&t2316, ((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=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L752] 2 __unbuffered_p1_EAX = x [L755] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L756] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L757] 2 y$flush_delayed = weak$$choice2 [L758] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L738] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L739] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L759] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L739] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L760] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L760] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L761] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L761] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L762] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L762] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L763] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L763] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L740] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L741] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L742] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] EXPR 2 weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L764] 2 y$r_buff0_thd2 = weak$$choice2 ? y$r_buff0_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff0_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2)) [L765] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L766] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] EXPR 2 y$flush_delayed ? y$mem_tmp : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$flush_delayed ? y$mem_tmp : y=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L767] 2 y = y$flush_delayed ? y$mem_tmp : y [L768] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y)=0, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y=0] [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used=0, y$w_buff1=0, y$w_buff1_used=0] [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2=0, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L802] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L803] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L804] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L804] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L805] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L805] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L806] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L806] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L809] 0 main$tmp_guard1 = !(__unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 218 locations, 3 error locations. Result: UNSAFE, OverallTime: 50.4s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 24.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9294 SDtfs, 10514 SDslu, 22980 SDs, 0 SdLazy, 9635 SolverSat, 532 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 11.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 367 GetRequests, 95 SyntacticMatches, 27 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 3.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71011occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.8s AutomataMinimizationTime, 32 MinimizatonAttempts, 76926 StatesRemovedByMinimization, 31 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 2341 NumberOfCodeBlocks, 2341 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2214 ConstructedInterpolants, 0 QuantifiedInterpolants, 463616 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...