./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi007_power.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_6962cae2-2460-461b-8269-f39874ede4a5/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6962cae2-2460-461b-8269-f39874ede4a5/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6962cae2-2460-461b-8269-f39874ede4a5/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6962cae2-2460-461b-8269-f39874ede4a5/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi007_power.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6962cae2-2460-461b-8269-f39874ede4a5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6962cae2-2460-461b-8269-f39874ede4a5/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 37000c82b98ddadc4228590543254aa8970066b3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 22:50:01,677 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:50:01,679 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:50:01,694 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:50:01,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:50:01,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:50:01,697 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:50:01,706 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:50:01,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:50:01,714 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:50:01,716 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:50:01,718 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:50:01,718 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:50:01,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:50:01,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:50:01,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:50:01,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:50:01,724 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:50:01,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:50:01,730 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:50:01,733 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:50:01,735 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:50:01,737 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:50:01,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:50:01,741 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:50:01,741 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:50:01,741 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:50:01,743 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:50:01,743 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:50:01,744 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:50:01,744 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:50:01,745 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:50:01,745 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:50:01,746 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:50:01,747 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:50:01,747 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:50:01,748 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:50:01,748 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:50:01,749 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:50:01,749 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:50:01,750 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:50:01,751 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6962cae2-2460-461b-8269-f39874ede4a5/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 22:50:01,775 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:50:01,785 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:50:01,786 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:50:01,787 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:50:01,787 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:50:01,787 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:50:01,788 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:50:01,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:50:01,788 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:50:01,788 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:50:01,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 22:50:01,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 22:50:01,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 22:50:01,789 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:50:01,789 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:50:01,790 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:50:01,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 22:50:01,791 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:50:01,791 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:50:01,791 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 22:50:01,791 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 22:50:01,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 22:50:01,792 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:50:01,792 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 22:50:01,792 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 22:50:01,793 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:50:01,793 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 22:50:01,793 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 22:50:01,794 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_6962cae2-2460-461b-8269-f39874ede4a5/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 -> 37000c82b98ddadc4228590543254aa8970066b3 [2019-11-15 22:50:01,828 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:50:01,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:50:01,845 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:50:01,847 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:50:01,847 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:50:01,848 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6962cae2-2460-461b-8269-f39874ede4a5/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi007_power.opt.i [2019-11-15 22:50:01,906 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6962cae2-2460-461b-8269-f39874ede4a5/bin/uautomizer/data/83a6bab75/603e468b3f0e494a82c4e3e79379aebd/FLAGb91cb9e28 [2019-11-15 22:50:02,411 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:50:02,412 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6962cae2-2460-461b-8269-f39874ede4a5/sv-benchmarks/c/pthread-wmm/rfi007_power.opt.i [2019-11-15 22:50:02,427 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6962cae2-2460-461b-8269-f39874ede4a5/bin/uautomizer/data/83a6bab75/603e468b3f0e494a82c4e3e79379aebd/FLAGb91cb9e28 [2019-11-15 22:50:02,716 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6962cae2-2460-461b-8269-f39874ede4a5/bin/uautomizer/data/83a6bab75/603e468b3f0e494a82c4e3e79379aebd [2019-11-15 22:50:02,719 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:50:02,720 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:50:02,721 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:50:02,721 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:50:02,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:50:02,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:50:02" (1/1) ... [2019-11-15 22:50:02,729 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@576275af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:02, skipping insertion in model container [2019-11-15 22:50:02,729 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:50:02" (1/1) ... [2019-11-15 22:50:02,736 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:50:02,796 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:50:03,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:50:03,239 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:50:03,332 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:50:03,397 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:50:03,397 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:03 WrapperNode [2019-11-15 22:50:03,398 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:50:03,398 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:50:03,399 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:50:03,399 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:50:03,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:03" (1/1) ... [2019-11-15 22:50:03,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:03" (1/1) ... [2019-11-15 22:50:03,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:50:03,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:50:03,466 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:50:03,466 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:50:03,475 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:03" (1/1) ... [2019-11-15 22:50:03,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:03" (1/1) ... [2019-11-15 22:50:03,490 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:03" (1/1) ... [2019-11-15 22:50:03,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:03" (1/1) ... [2019-11-15 22:50:03,512 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:03" (1/1) ... [2019-11-15 22:50:03,516 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:03" (1/1) ... [2019-11-15 22:50:03,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:03" (1/1) ... [2019-11-15 22:50:03,539 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:50:03,539 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:50:03,540 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:50:03,540 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:50:03,540 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6962cae2-2460-461b-8269-f39874ede4a5/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 22:50:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:50:03,620 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-15 22:50:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:50:03,621 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:50:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-15 22:50:03,622 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-15 22:50:03,622 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-15 22:50:03,623 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-15 22:50:03,623 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-15 22:50:03,623 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:50:03,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:50:03,627 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 22:50:04,314 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:50:04,314 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-15 22:50:04,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:50:04 BoogieIcfgContainer [2019-11-15 22:50:04,315 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:50:04,316 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 22:50:04,316 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 22:50:04,318 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 22:50:04,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 10:50:02" (1/3) ... [2019-11-15 22:50:04,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2755eeda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:50:04, skipping insertion in model container [2019-11-15 22:50:04,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:50:03" (2/3) ... [2019-11-15 22:50:04,320 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2755eeda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 10:50:04, skipping insertion in model container [2019-11-15 22:50:04,320 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:50:04" (3/3) ... [2019-11-15 22:50:04,321 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi007_power.opt.i [2019-11-15 22:50:04,383 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,383 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,383 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,384 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,384 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,384 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,384 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,384 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,385 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,385 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,385 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,385 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,385 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,385 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,386 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,386 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,386 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,386 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,386 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,386 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,387 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,387 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,387 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,387 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,387 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,388 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,388 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,388 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,388 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,389 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,389 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,389 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,389 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,389 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,391 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,391 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,391 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,392 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,392 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,392 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,392 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,393 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,393 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,394 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,394 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,394 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,395 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,395 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,395 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,396 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,396 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,396 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,396 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,396 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,396 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,396 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,397 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,398 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,398 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,398 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,398 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,398 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,398 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,399 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,399 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,399 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,399 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,399 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,399 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,400 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,400 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,400 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,400 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,401 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,401 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,401 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,401 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,401 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,402 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,402 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,402 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,402 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,402 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,402 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,402 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,403 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,403 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,403 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,403 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,403 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,403 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,404 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,404 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,405 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,405 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,405 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,405 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,405 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,405 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,406 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,406 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,409 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,409 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,409 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,409 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,410 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,410 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,410 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,411 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,411 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,412 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,412 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,412 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,420 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,421 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,422 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,422 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,422 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,422 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,422 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,422 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,423 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,423 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,423 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,423 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,423 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,423 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,423 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,424 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,424 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,424 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,424 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,424 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,424 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,425 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,425 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,425 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,425 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,425 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,425 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,425 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,426 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,426 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,426 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,426 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,426 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,426 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,427 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,427 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,427 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,427 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,427 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-15 22:50:04,433 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-15 22:50:04,433 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 22:50:04,441 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-15 22:50:04,452 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-15 22:50:04,472 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 22:50:04,472 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 22:50:04,472 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 22:50:04,472 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:50:04,472 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:50:04,472 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 22:50:04,473 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:50:04,473 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 22:50:04,491 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 178 transitions [2019-11-15 22:50:07,141 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 32590 states. [2019-11-15 22:50:07,144 INFO L276 IsEmpty]: Start isEmpty. Operand 32590 states. [2019-11-15 22:50:07,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-11-15 22:50:07,151 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:07,152 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 22:50:07,154 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:07,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:07,159 INFO L82 PathProgramCache]: Analyzing trace with hash -1414647361, now seen corresponding path program 1 times [2019-11-15 22:50:07,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:07,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186955158] [2019-11-15 22:50:07,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:07,168 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:07,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:07,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:07,390 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 22:50:07,391 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186955158] [2019-11-15 22:50:07,391 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:07,392 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:07,392 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705205997] [2019-11-15 22:50:07,396 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:07,396 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:07,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:07,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:07,412 INFO L87 Difference]: Start difference. First operand 32590 states. Second operand 4 states. [2019-11-15 22:50:08,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:08,407 INFO L93 Difference]: Finished difference Result 33590 states and 129567 transitions. [2019-11-15 22:50:08,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:08,408 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-11-15 22:50:08,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:08,674 INFO L225 Difference]: With dead ends: 33590 [2019-11-15 22:50:08,674 INFO L226 Difference]: Without dead ends: 25702 [2019-11-15 22:50:08,676 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 22:50:09,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25702 states. [2019-11-15 22:50:09,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25702 to 25702. [2019-11-15 22:50:09,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25702 states. [2019-11-15 22:50:10,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25702 states to 25702 states and 99583 transitions. [2019-11-15 22:50:10,241 INFO L78 Accepts]: Start accepts. Automaton has 25702 states and 99583 transitions. Word has length 33 [2019-11-15 22:50:10,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:10,243 INFO L462 AbstractCegarLoop]: Abstraction has 25702 states and 99583 transitions. [2019-11-15 22:50:10,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:10,243 INFO L276 IsEmpty]: Start isEmpty. Operand 25702 states and 99583 transitions. [2019-11-15 22:50:10,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2019-11-15 22:50:10,255 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:10,255 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 22:50:10,255 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:10,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:10,256 INFO L82 PathProgramCache]: Analyzing trace with hash 1018218352, now seen corresponding path program 1 times [2019-11-15 22:50:10,256 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:10,256 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487950956] [2019-11-15 22:50:10,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:10,257 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:10,257 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:10,402 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 22:50:10,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487950956] [2019-11-15 22:50:10,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:10,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:50:10,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036232343] [2019-11-15 22:50:10,404 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:50:10,404 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:10,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:50:10,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:10,405 INFO L87 Difference]: Start difference. First operand 25702 states and 99583 transitions. Second operand 5 states. [2019-11-15 22:50:11,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:11,683 INFO L93 Difference]: Finished difference Result 41080 states and 150430 transitions. [2019-11-15 22:50:11,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:50:11,683 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 45 [2019-11-15 22:50:11,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:11,848 INFO L225 Difference]: With dead ends: 41080 [2019-11-15 22:50:11,849 INFO L226 Difference]: Without dead ends: 40544 [2019-11-15 22:50:11,850 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 22:50:12,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40544 states. [2019-11-15 22:50:13,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40544 to 38924. [2019-11-15 22:50:13,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38924 states. [2019-11-15 22:50:13,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38924 states to 38924 states and 143580 transitions. [2019-11-15 22:50:13,448 INFO L78 Accepts]: Start accepts. Automaton has 38924 states and 143580 transitions. Word has length 45 [2019-11-15 22:50:13,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:13,450 INFO L462 AbstractCegarLoop]: Abstraction has 38924 states and 143580 transitions. [2019-11-15 22:50:13,450 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:50:13,450 INFO L276 IsEmpty]: Start isEmpty. Operand 38924 states and 143580 transitions. [2019-11-15 22:50:13,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-11-15 22:50:13,456 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:13,456 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 22:50:13,456 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:13,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:13,457 INFO L82 PathProgramCache]: Analyzing trace with hash 352520797, now seen corresponding path program 1 times [2019-11-15 22:50:13,457 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:13,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922834417] [2019-11-15 22:50:13,457 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:13,458 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:13,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:13,538 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922834417] [2019-11-15 22:50:13,538 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:13,539 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:50:13,539 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750781613] [2019-11-15 22:50:13,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:50:13,539 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:13,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:50:13,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:13,540 INFO L87 Difference]: Start difference. First operand 38924 states and 143580 transitions. Second operand 5 states. [2019-11-15 22:50:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:14,150 INFO L93 Difference]: Finished difference Result 49777 states and 180632 transitions. [2019-11-15 22:50:14,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:50:14,151 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-11-15 22:50:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:14,351 INFO L225 Difference]: With dead ends: 49777 [2019-11-15 22:50:14,351 INFO L226 Difference]: Without dead ends: 49273 [2019-11-15 22:50:14,352 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 22:50:15,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49273 states. [2019-11-15 22:50:15,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49273 to 42676. [2019-11-15 22:50:15,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42676 states. [2019-11-15 22:50:16,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42676 states to 42676 states and 156591 transitions. [2019-11-15 22:50:16,002 INFO L78 Accepts]: Start accepts. Automaton has 42676 states and 156591 transitions. Word has length 46 [2019-11-15 22:50:16,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:16,002 INFO L462 AbstractCegarLoop]: Abstraction has 42676 states and 156591 transitions. [2019-11-15 22:50:16,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:50:16,003 INFO L276 IsEmpty]: Start isEmpty. Operand 42676 states and 156591 transitions. [2019-11-15 22:50:16,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-11-15 22:50:16,010 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:16,010 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 22:50:16,011 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:16,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:16,011 INFO L82 PathProgramCache]: Analyzing trace with hash 441299907, now seen corresponding path program 1 times [2019-11-15 22:50:16,011 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:16,011 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903593982] [2019-11-15 22:50:16,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:16,012 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:16,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:16,071 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 22:50:16,071 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903593982] [2019-11-15 22:50:16,071 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:16,072 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:50:16,072 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747934627] [2019-11-15 22:50:16,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:50:16,072 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:16,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:50:16,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:16,073 INFO L87 Difference]: Start difference. First operand 42676 states and 156591 transitions. Second operand 3 states. [2019-11-15 22:50:16,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:16,352 INFO L93 Difference]: Finished difference Result 61086 states and 221429 transitions. [2019-11-15 22:50:16,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:50:16,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-11-15 22:50:16,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:16,512 INFO L225 Difference]: With dead ends: 61086 [2019-11-15 22:50:16,512 INFO L226 Difference]: Without dead ends: 61086 [2019-11-15 22:50:16,513 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 22:50:16,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61086 states. [2019-11-15 22:50:18,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61086 to 48015. [2019-11-15 22:50:18,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48015 states. [2019-11-15 22:50:18,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48015 states to 48015 states and 174178 transitions. [2019-11-15 22:50:18,229 INFO L78 Accepts]: Start accepts. Automaton has 48015 states and 174178 transitions. Word has length 48 [2019-11-15 22:50:18,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:18,229 INFO L462 AbstractCegarLoop]: Abstraction has 48015 states and 174178 transitions. [2019-11-15 22:50:18,229 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 48015 states and 174178 transitions. [2019-11-15 22:50:18,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 22:50:18,246 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:18,246 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 22:50:18,247 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:18,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:18,247 INFO L82 PathProgramCache]: Analyzing trace with hash -995861021, now seen corresponding path program 1 times [2019-11-15 22:50:18,247 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:18,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126638461] [2019-11-15 22:50:18,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:18,248 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:18,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:18,353 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 22:50:18,353 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126638461] [2019-11-15 22:50:18,353 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:18,353 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:50:18,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150604967] [2019-11-15 22:50:18,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:50:18,354 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:18,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:50:18,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:50:18,354 INFO L87 Difference]: Start difference. First operand 48015 states and 174178 transitions. Second operand 6 states. [2019-11-15 22:50:19,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:19,256 INFO L93 Difference]: Finished difference Result 63755 states and 229378 transitions. [2019-11-15 22:50:19,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:50:19,257 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 22:50:19,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:19,368 INFO L225 Difference]: With dead ends: 63755 [2019-11-15 22:50:19,368 INFO L226 Difference]: Without dead ends: 63755 [2019-11-15 22:50:19,368 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:50:20,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63755 states. [2019-11-15 22:50:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63755 to 59948. [2019-11-15 22:50:21,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59948 states. [2019-11-15 22:50:21,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59948 states to 59948 states and 215671 transitions. [2019-11-15 22:50:21,145 INFO L78 Accepts]: Start accepts. Automaton has 59948 states and 215671 transitions. Word has length 52 [2019-11-15 22:50:21,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:21,145 INFO L462 AbstractCegarLoop]: Abstraction has 59948 states and 215671 transitions. [2019-11-15 22:50:21,145 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:50:21,145 INFO L276 IsEmpty]: Start isEmpty. Operand 59948 states and 215671 transitions. [2019-11-15 22:50:21,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 22:50:21,162 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:21,162 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 22:50:21,162 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:21,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:21,163 INFO L82 PathProgramCache]: Analyzing trace with hash 1502154916, now seen corresponding path program 1 times [2019-11-15 22:50:21,163 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:21,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355400189] [2019-11-15 22:50:21,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:21,163 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:21,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:21,220 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 22:50:21,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355400189] [2019-11-15 22:50:21,220 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:21,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:50:21,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006440767] [2019-11-15 22:50:21,221 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:50:21,221 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:21,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:50:21,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:21,222 INFO L87 Difference]: Start difference. First operand 59948 states and 215671 transitions. Second operand 3 states. [2019-11-15 22:50:21,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:21,459 INFO L93 Difference]: Finished difference Result 54020 states and 188917 transitions. [2019-11-15 22:50:21,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:50:21,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2019-11-15 22:50:21,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:21,562 INFO L225 Difference]: With dead ends: 54020 [2019-11-15 22:50:21,562 INFO L226 Difference]: Without dead ends: 54020 [2019-11-15 22:50:21,562 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:21,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54020 states. [2019-11-15 22:50:25,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54020 to 53405. [2019-11-15 22:50:25,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53405 states. [2019-11-15 22:50:25,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53405 states to 53405 states and 187036 transitions. [2019-11-15 22:50:25,679 INFO L78 Accepts]: Start accepts. Automaton has 53405 states and 187036 transitions. Word has length 52 [2019-11-15 22:50:25,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:25,679 INFO L462 AbstractCegarLoop]: Abstraction has 53405 states and 187036 transitions. [2019-11-15 22:50:25,679 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:25,680 INFO L276 IsEmpty]: Start isEmpty. Operand 53405 states and 187036 transitions. [2019-11-15 22:50:25,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-11-15 22:50:25,687 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:25,687 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 22:50:25,687 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:25,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:25,688 INFO L82 PathProgramCache]: Analyzing trace with hash -2076880242, now seen corresponding path program 1 times [2019-11-15 22:50:25,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:25,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142748879] [2019-11-15 22:50:25,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:25,688 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:25,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:25,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 22:50:25,753 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142748879] [2019-11-15 22:50:25,754 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:25,754 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:50:25,754 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156709389] [2019-11-15 22:50:25,754 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:50:25,754 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:25,755 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:50:25,755 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:50:25,755 INFO L87 Difference]: Start difference. First operand 53405 states and 187036 transitions. Second operand 6 states. [2019-11-15 22:50:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:26,549 INFO L93 Difference]: Finished difference Result 68645 states and 237300 transitions. [2019-11-15 22:50:26,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:50:26,549 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 52 [2019-11-15 22:50:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:26,662 INFO L225 Difference]: With dead ends: 68645 [2019-11-15 22:50:26,662 INFO L226 Difference]: Without dead ends: 68077 [2019-11-15 22:50:26,662 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:50:26,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68077 states. [2019-11-15 22:50:27,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68077 to 53489. [2019-11-15 22:50:27,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53489 states. [2019-11-15 22:50:27,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53489 states to 53489 states and 187733 transitions. [2019-11-15 22:50:27,632 INFO L78 Accepts]: Start accepts. Automaton has 53489 states and 187733 transitions. Word has length 52 [2019-11-15 22:50:27,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:27,633 INFO L462 AbstractCegarLoop]: Abstraction has 53489 states and 187733 transitions. [2019-11-15 22:50:27,633 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:50:27,633 INFO L276 IsEmpty]: Start isEmpty. Operand 53489 states and 187733 transitions. [2019-11-15 22:50:27,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-15 22:50:27,644 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:27,644 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] [2019-11-15 22:50:27,644 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:27,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:27,644 INFO L82 PathProgramCache]: Analyzing trace with hash -834238100, now seen corresponding path program 1 times [2019-11-15 22:50:27,644 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:27,645 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115720255] [2019-11-15 22:50:27,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:27,645 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:27,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:50:27,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115720255] [2019-11-15 22:50:27,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:27,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:27,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877064611] [2019-11-15 22:50:27,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:27,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:27,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:27,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:27,719 INFO L87 Difference]: Start difference. First operand 53489 states and 187733 transitions. Second operand 4 states. [2019-11-15 22:50:27,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:27,770 INFO L93 Difference]: Finished difference Result 10211 states and 31245 transitions. [2019-11-15 22:50:27,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:50:27,770 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-11-15 22:50:27,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:27,781 INFO L225 Difference]: With dead ends: 10211 [2019-11-15 22:50:27,781 INFO L226 Difference]: Without dead ends: 8506 [2019-11-15 22:50:27,781 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 22:50:27,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8506 states. [2019-11-15 22:50:28,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8506 to 8458. [2019-11-15 22:50:28,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8458 states. [2019-11-15 22:50:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8458 states to 8458 states and 25324 transitions. [2019-11-15 22:50:28,382 INFO L78 Accepts]: Start accepts. Automaton has 8458 states and 25324 transitions. Word has length 53 [2019-11-15 22:50:28,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:28,383 INFO L462 AbstractCegarLoop]: Abstraction has 8458 states and 25324 transitions. [2019-11-15 22:50:28,383 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:28,383 INFO L276 IsEmpty]: Start isEmpty. Operand 8458 states and 25324 transitions. [2019-11-15 22:50:28,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 22:50:28,385 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:28,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] [2019-11-15 22:50:28,386 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:28,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:28,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1137223062, now seen corresponding path program 1 times [2019-11-15 22:50:28,386 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:28,386 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752546822] [2019-11-15 22:50:28,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:28,387 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:28,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:28,460 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 22:50:28,461 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752546822] [2019-11-15 22:50:28,461 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:28,462 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:28,462 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382765523] [2019-11-15 22:50:28,462 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:28,462 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:28,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:28,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:28,463 INFO L87 Difference]: Start difference. First operand 8458 states and 25324 transitions. Second operand 4 states. [2019-11-15 22:50:28,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:28,611 INFO L93 Difference]: Finished difference Result 9705 states and 29103 transitions. [2019-11-15 22:50:28,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 22:50:28,612 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 60 [2019-11-15 22:50:28,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:28,625 INFO L225 Difference]: With dead ends: 9705 [2019-11-15 22:50:28,625 INFO L226 Difference]: Without dead ends: 9705 [2019-11-15 22:50:28,625 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 22:50:28,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9705 states. [2019-11-15 22:50:28,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9705 to 8878. [2019-11-15 22:50:28,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8878 states. [2019-11-15 22:50:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8878 states to 8878 states and 26587 transitions. [2019-11-15 22:50:28,748 INFO L78 Accepts]: Start accepts. Automaton has 8878 states and 26587 transitions. Word has length 60 [2019-11-15 22:50:28,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:28,748 INFO L462 AbstractCegarLoop]: Abstraction has 8878 states and 26587 transitions. [2019-11-15 22:50:28,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:28,748 INFO L276 IsEmpty]: Start isEmpty. Operand 8878 states and 26587 transitions. [2019-11-15 22:50:28,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-11-15 22:50:28,751 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:28,751 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 22:50:28,751 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:28,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:28,751 INFO L82 PathProgramCache]: Analyzing trace with hash 605587273, now seen corresponding path program 1 times [2019-11-15 22:50:28,752 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:28,752 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531413911] [2019-11-15 22:50:28,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:28,752 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:28,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:28,874 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 22:50:28,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531413911] [2019-11-15 22:50:28,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:28,875 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:50:28,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861511320] [2019-11-15 22:50:28,876 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:50:28,876 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:28,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:50:28,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:50:28,877 INFO L87 Difference]: Start difference. First operand 8878 states and 26587 transitions. Second operand 6 states. [2019-11-15 22:50:29,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:29,348 INFO L93 Difference]: Finished difference Result 11194 states and 33074 transitions. [2019-11-15 22:50:29,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:50:29,349 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 60 [2019-11-15 22:50:29,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:29,361 INFO L225 Difference]: With dead ends: 11194 [2019-11-15 22:50:29,361 INFO L226 Difference]: Without dead ends: 11133 [2019-11-15 22:50:29,362 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:50:29,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11133 states. [2019-11-15 22:50:29,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11133 to 10409. [2019-11-15 22:50:29,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10409 states. [2019-11-15 22:50:29,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10409 states to 10409 states and 30941 transitions. [2019-11-15 22:50:29,485 INFO L78 Accepts]: Start accepts. Automaton has 10409 states and 30941 transitions. Word has length 60 [2019-11-15 22:50:29,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:29,485 INFO L462 AbstractCegarLoop]: Abstraction has 10409 states and 30941 transitions. [2019-11-15 22:50:29,485 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:50:29,485 INFO L276 IsEmpty]: Start isEmpty. Operand 10409 states and 30941 transitions. [2019-11-15 22:50:29,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:50:29,490 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:29,490 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 22:50:29,490 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:29,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:29,491 INFO L82 PathProgramCache]: Analyzing trace with hash -55827014, now seen corresponding path program 1 times [2019-11-15 22:50:29,491 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:29,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050338109] [2019-11-15 22:50:29,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:29,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:29,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:29,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:29,536 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 22:50:29,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050338109] [2019-11-15 22:50:29,537 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:29,537 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 22:50:29,537 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199541886] [2019-11-15 22:50:29,537 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 22:50:29,537 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:29,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 22:50:29,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 22:50:29,538 INFO L87 Difference]: Start difference. First operand 10409 states and 30941 transitions. Second operand 3 states. [2019-11-15 22:50:29,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:29,613 INFO L93 Difference]: Finished difference Result 12981 states and 38320 transitions. [2019-11-15 22:50:29,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 22:50:29,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 22:50:29,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:29,635 INFO L225 Difference]: With dead ends: 12981 [2019-11-15 22:50:29,635 INFO L226 Difference]: Without dead ends: 12981 [2019-11-15 22:50:29,635 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 22:50:29,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12981 states. [2019-11-15 22:50:29,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12981 to 10055. [2019-11-15 22:50:29,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10055 states. [2019-11-15 22:50:29,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10055 states to 10055 states and 29419 transitions. [2019-11-15 22:50:29,820 INFO L78 Accepts]: Start accepts. Automaton has 10055 states and 29419 transitions. Word has length 66 [2019-11-15 22:50:29,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:29,821 INFO L462 AbstractCegarLoop]: Abstraction has 10055 states and 29419 transitions. [2019-11-15 22:50:29,821 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 22:50:29,821 INFO L276 IsEmpty]: Start isEmpty. Operand 10055 states and 29419 transitions. [2019-11-15 22:50:29,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:50:29,828 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:29,828 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 22:50:29,829 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:29,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:29,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1868799208, now seen corresponding path program 1 times [2019-11-15 22:50:29,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:29,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922943842] [2019-11-15 22:50:29,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:29,830 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:29,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:29,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:29,928 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 22:50:29,929 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922943842] [2019-11-15 22:50:29,929 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:29,929 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:29,929 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312371285] [2019-11-15 22:50:29,929 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:29,929 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:29,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:29,930 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:29,930 INFO L87 Difference]: Start difference. First operand 10055 states and 29419 transitions. Second operand 4 states. [2019-11-15 22:50:30,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:30,277 INFO L93 Difference]: Finished difference Result 13024 states and 37644 transitions. [2019-11-15 22:50:30,278 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:30,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-15 22:50:30,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:30,299 INFO L225 Difference]: With dead ends: 13024 [2019-11-15 22:50:30,300 INFO L226 Difference]: Without dead ends: 13024 [2019-11-15 22:50:30,300 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 22:50:30,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13024 states. [2019-11-15 22:50:30,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13024 to 11485. [2019-11-15 22:50:30,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11485 states. [2019-11-15 22:50:30,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11485 states to 11485 states and 33302 transitions. [2019-11-15 22:50:30,446 INFO L78 Accepts]: Start accepts. Automaton has 11485 states and 33302 transitions. Word has length 66 [2019-11-15 22:50:30,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:30,446 INFO L462 AbstractCegarLoop]: Abstraction has 11485 states and 33302 transitions. [2019-11-15 22:50:30,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:30,446 INFO L276 IsEmpty]: Start isEmpty. Operand 11485 states and 33302 transitions. [2019-11-15 22:50:30,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:50:30,452 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:30,453 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 22:50:30,453 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:30,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:30,453 INFO L82 PathProgramCache]: Analyzing trace with hash -624034727, now seen corresponding path program 1 times [2019-11-15 22:50:30,453 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:30,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058983912] [2019-11-15 22:50:30,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:30,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:30,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:30,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:30,562 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 22:50:30,563 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058983912] [2019-11-15 22:50:30,563 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:30,563 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:50:30,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512156007] [2019-11-15 22:50:30,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:50:30,564 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:30,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:50:30,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:50:30,565 INFO L87 Difference]: Start difference. First operand 11485 states and 33302 transitions. Second operand 6 states. [2019-11-15 22:50:31,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:31,201 INFO L93 Difference]: Finished difference Result 12624 states and 35968 transitions. [2019-11-15 22:50:31,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:50:31,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 22:50:31,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:31,220 INFO L225 Difference]: With dead ends: 12624 [2019-11-15 22:50:31,220 INFO L226 Difference]: Without dead ends: 12624 [2019-11-15 22:50:31,220 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:50:31,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12624 states. [2019-11-15 22:50:31,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12624 to 12326. [2019-11-15 22:50:31,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12326 states. [2019-11-15 22:50:31,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12326 states to 12326 states and 35227 transitions. [2019-11-15 22:50:31,369 INFO L78 Accepts]: Start accepts. Automaton has 12326 states and 35227 transitions. Word has length 66 [2019-11-15 22:50:31,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:31,370 INFO L462 AbstractCegarLoop]: Abstraction has 12326 states and 35227 transitions. [2019-11-15 22:50:31,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:50:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand 12326 states and 35227 transitions. [2019-11-15 22:50:31,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:50:31,377 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:31,377 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 22:50:31,377 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:31,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:31,378 INFO L82 PathProgramCache]: Analyzing trace with hash 1593723226, now seen corresponding path program 1 times [2019-11-15 22:50:31,378 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:31,378 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808785640] [2019-11-15 22:50:31,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:31,378 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:31,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:31,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:31,494 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 22:50:31,494 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808785640] [2019-11-15 22:50:31,494 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:31,494 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:50:31,495 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843372630] [2019-11-15 22:50:31,495 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:50:31,495 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:31,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:50:31,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:50:31,496 INFO L87 Difference]: Start difference. First operand 12326 states and 35227 transitions. Second operand 6 states. [2019-11-15 22:50:32,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:32,037 INFO L93 Difference]: Finished difference Result 14179 states and 39338 transitions. [2019-11-15 22:50:32,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:50:32,038 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-11-15 22:50:32,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:32,059 INFO L225 Difference]: With dead ends: 14179 [2019-11-15 22:50:32,059 INFO L226 Difference]: Without dead ends: 14179 [2019-11-15 22:50:32,060 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:50:32,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14179 states. [2019-11-15 22:50:32,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14179 to 12926. [2019-11-15 22:50:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12926 states. [2019-11-15 22:50:32,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12926 states to 12926 states and 36258 transitions. [2019-11-15 22:50:32,218 INFO L78 Accepts]: Start accepts. Automaton has 12926 states and 36258 transitions. Word has length 66 [2019-11-15 22:50:32,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:32,218 INFO L462 AbstractCegarLoop]: Abstraction has 12926 states and 36258 transitions. [2019-11-15 22:50:32,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:50:32,218 INFO L276 IsEmpty]: Start isEmpty. Operand 12926 states and 36258 transitions. [2019-11-15 22:50:32,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:50:32,224 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:32,224 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 22:50:32,225 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:32,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:32,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1805074139, now seen corresponding path program 1 times [2019-11-15 22:50:32,225 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:32,225 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012701463] [2019-11-15 22:50:32,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:32,225 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:32,225 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:32,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:32,320 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 22:50:32,320 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012701463] [2019-11-15 22:50:32,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:32,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:50:32,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229402289] [2019-11-15 22:50:32,321 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:50:32,321 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:32,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:50:32,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:32,322 INFO L87 Difference]: Start difference. First operand 12926 states and 36258 transitions. Second operand 5 states. [2019-11-15 22:50:32,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:32,745 INFO L93 Difference]: Finished difference Result 16752 states and 46765 transitions. [2019-11-15 22:50:32,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:50:32,745 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 22:50:32,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:32,772 INFO L225 Difference]: With dead ends: 16752 [2019-11-15 22:50:32,772 INFO L226 Difference]: Without dead ends: 16752 [2019-11-15 22:50:32,772 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 22:50:32,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16752 states. [2019-11-15 22:50:32,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16752 to 15456. [2019-11-15 22:50:32,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15456 states. [2019-11-15 22:50:32,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15456 states to 15456 states and 42981 transitions. [2019-11-15 22:50:32,969 INFO L78 Accepts]: Start accepts. Automaton has 15456 states and 42981 transitions. Word has length 66 [2019-11-15 22:50:32,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:32,969 INFO L462 AbstractCegarLoop]: Abstraction has 15456 states and 42981 transitions. [2019-11-15 22:50:32,969 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:50:32,969 INFO L276 IsEmpty]: Start isEmpty. Operand 15456 states and 42981 transitions. [2019-11-15 22:50:32,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 22:50:32,978 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:32,978 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 22:50:32,978 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:32,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:32,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1294539962, now seen corresponding path program 1 times [2019-11-15 22:50:32,979 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:32,979 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460910615] [2019-11-15 22:50:32,979 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:32,980 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:32,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:33,059 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 22:50:33,061 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460910615] [2019-11-15 22:50:33,064 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:33,067 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:50:33,067 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874469396] [2019-11-15 22:50:33,068 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:50:33,068 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:33,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:50:33,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:33,069 INFO L87 Difference]: Start difference. First operand 15456 states and 42981 transitions. Second operand 5 states. [2019-11-15 22:50:33,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:33,134 INFO L93 Difference]: Finished difference Result 5880 states and 13569 transitions. [2019-11-15 22:50:33,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:50:33,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-11-15 22:50:33,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:33,140 INFO L225 Difference]: With dead ends: 5880 [2019-11-15 22:50:33,140 INFO L226 Difference]: Without dead ends: 5034 [2019-11-15 22:50:33,141 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 22:50:33,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5034 states. [2019-11-15 22:50:33,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5034 to 4609. [2019-11-15 22:50:33,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4609 states. [2019-11-15 22:50:33,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4609 states to 4609 states and 10279 transitions. [2019-11-15 22:50:33,203 INFO L78 Accepts]: Start accepts. Automaton has 4609 states and 10279 transitions. Word has length 66 [2019-11-15 22:50:33,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:33,204 INFO L462 AbstractCegarLoop]: Abstraction has 4609 states and 10279 transitions. [2019-11-15 22:50:33,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:50:33,204 INFO L276 IsEmpty]: Start isEmpty. Operand 4609 states and 10279 transitions. [2019-11-15 22:50:33,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 22:50:33,214 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:33,214 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 22:50:33,214 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:33,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:33,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1221361139, now seen corresponding path program 1 times [2019-11-15 22:50:33,215 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:33,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152555535] [2019-11-15 22:50:33,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:33,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:33,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:33,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:33,307 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 22:50:33,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152555535] [2019-11-15 22:50:33,308 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:33,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:50:33,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309660894] [2019-11-15 22:50:33,309 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:50:33,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:33,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:50:33,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:33,309 INFO L87 Difference]: Start difference. First operand 4609 states and 10279 transitions. Second operand 5 states. [2019-11-15 22:50:33,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:33,504 INFO L93 Difference]: Finished difference Result 5680 states and 12727 transitions. [2019-11-15 22:50:33,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:50:33,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-11-15 22:50:33,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:33,511 INFO L225 Difference]: With dead ends: 5680 [2019-11-15 22:50:33,511 INFO L226 Difference]: Without dead ends: 5680 [2019-11-15 22:50:33,511 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 22:50:33,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5680 states. [2019-11-15 22:50:33,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5680 to 5029. [2019-11-15 22:50:33,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5029 states. [2019-11-15 22:50:33,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5029 states to 5029 states and 11237 transitions. [2019-11-15 22:50:33,574 INFO L78 Accepts]: Start accepts. Automaton has 5029 states and 11237 transitions. Word has length 72 [2019-11-15 22:50:33,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:33,574 INFO L462 AbstractCegarLoop]: Abstraction has 5029 states and 11237 transitions. [2019-11-15 22:50:33,574 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:50:33,574 INFO L276 IsEmpty]: Start isEmpty. Operand 5029 states and 11237 transitions. [2019-11-15 22:50:33,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-11-15 22:50:33,578 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:33,578 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 22:50:33,578 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:33,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:33,579 INFO L82 PathProgramCache]: Analyzing trace with hash 521449196, now seen corresponding path program 1 times [2019-11-15 22:50:33,579 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:33,579 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535754261] [2019-11-15 22:50:33,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:33,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:33,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:33,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:33,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 22:50:33,645 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535754261] [2019-11-15 22:50:33,645 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:33,645 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:50:33,645 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1023341032] [2019-11-15 22:50:33,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:50:33,645 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:33,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:50:33,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:50:33,646 INFO L87 Difference]: Start difference. First operand 5029 states and 11237 transitions. Second operand 7 states. [2019-11-15 22:50:34,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:34,118 INFO L93 Difference]: Finished difference Result 5915 states and 13088 transitions. [2019-11-15 22:50:34,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-15 22:50:34,119 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 72 [2019-11-15 22:50:34,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:34,126 INFO L225 Difference]: With dead ends: 5915 [2019-11-15 22:50:34,126 INFO L226 Difference]: Without dead ends: 5862 [2019-11-15 22:50:34,126 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 22:50:34,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5862 states. [2019-11-15 22:50:34,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5862 to 5116. [2019-11-15 22:50:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5116 states. [2019-11-15 22:50:34,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5116 states to 5116 states and 11326 transitions. [2019-11-15 22:50:34,193 INFO L78 Accepts]: Start accepts. Automaton has 5116 states and 11326 transitions. Word has length 72 [2019-11-15 22:50:34,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:34,193 INFO L462 AbstractCegarLoop]: Abstraction has 5116 states and 11326 transitions. [2019-11-15 22:50:34,193 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:50:34,193 INFO L276 IsEmpty]: Start isEmpty. Operand 5116 states and 11326 transitions. [2019-11-15 22:50:34,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 22:50:34,198 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:34,199 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 22:50:34,199 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:34,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:34,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1123846020, now seen corresponding path program 1 times [2019-11-15 22:50:34,199 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:34,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329609240] [2019-11-15 22:50:34,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:34,200 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:34,200 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:34,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:34,274 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 22:50:34,275 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329609240] [2019-11-15 22:50:34,275 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:34,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:50:34,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987470156] [2019-11-15 22:50:34,276 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:50:34,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:34,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:50:34,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:34,277 INFO L87 Difference]: Start difference. First operand 5116 states and 11326 transitions. Second operand 5 states. [2019-11-15 22:50:34,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:34,753 INFO L93 Difference]: Finished difference Result 7804 states and 17573 transitions. [2019-11-15 22:50:34,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 22:50:34,753 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-15 22:50:34,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:34,760 INFO L225 Difference]: With dead ends: 7804 [2019-11-15 22:50:34,760 INFO L226 Difference]: Without dead ends: 7804 [2019-11-15 22:50:34,760 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:50:34,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7804 states. [2019-11-15 22:50:34,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7804 to 5161. [2019-11-15 22:50:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5161 states. [2019-11-15 22:50:34,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5161 states to 5161 states and 11431 transitions. [2019-11-15 22:50:34,819 INFO L78 Accepts]: Start accepts. Automaton has 5161 states and 11431 transitions. Word has length 93 [2019-11-15 22:50:34,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:34,819 INFO L462 AbstractCegarLoop]: Abstraction has 5161 states and 11431 transitions. [2019-11-15 22:50:34,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:50:34,820 INFO L276 IsEmpty]: Start isEmpty. Operand 5161 states and 11431 transitions. [2019-11-15 22:50:34,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 22:50:34,824 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:34,824 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 22:50:34,825 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:34,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:34,825 INFO L82 PathProgramCache]: Analyzing trace with hash -673105339, now seen corresponding path program 1 times [2019-11-15 22:50:34,825 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:34,825 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174164681] [2019-11-15 22:50:34,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:34,826 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:34,826 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:35,193 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 22:50:35,194 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174164681] [2019-11-15 22:50:35,194 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:35,194 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:50:35,194 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528212308] [2019-11-15 22:50:35,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:50:35,196 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:35,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:50:35,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:50:35,197 INFO L87 Difference]: Start difference. First operand 5161 states and 11431 transitions. Second operand 7 states. [2019-11-15 22:50:35,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:35,684 INFO L93 Difference]: Finished difference Result 6305 states and 13957 transitions. [2019-11-15 22:50:35,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 22:50:35,684 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-11-15 22:50:35,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:35,689 INFO L225 Difference]: With dead ends: 6305 [2019-11-15 22:50:35,689 INFO L226 Difference]: Without dead ends: 6305 [2019-11-15 22:50:35,690 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:50:35,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6305 states. [2019-11-15 22:50:35,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6305 to 5635. [2019-11-15 22:50:35,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5635 states. [2019-11-15 22:50:35,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5635 states to 5635 states and 12452 transitions. [2019-11-15 22:50:35,742 INFO L78 Accepts]: Start accepts. Automaton has 5635 states and 12452 transitions. Word has length 93 [2019-11-15 22:50:35,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:35,742 INFO L462 AbstractCegarLoop]: Abstraction has 5635 states and 12452 transitions. [2019-11-15 22:50:35,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:50:35,742 INFO L276 IsEmpty]: Start isEmpty. Operand 5635 states and 12452 transitions. [2019-11-15 22:50:35,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 22:50:35,746 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:35,746 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 22:50:35,746 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:35,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:35,746 INFO L82 PathProgramCache]: Analyzing trace with hash -130514985, now seen corresponding path program 1 times [2019-11-15 22:50:35,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:35,747 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855500770] [2019-11-15 22:50:35,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:35,747 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:35,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:35,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:35,852 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 22:50:35,853 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855500770] [2019-11-15 22:50:35,853 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:35,853 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:50:35,853 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661790295] [2019-11-15 22:50:35,854 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:50:35,857 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:35,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:50:35,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:50:35,857 INFO L87 Difference]: Start difference. First operand 5635 states and 12452 transitions. Second operand 7 states. [2019-11-15 22:50:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:36,450 INFO L93 Difference]: Finished difference Result 6384 states and 14069 transitions. [2019-11-15 22:50:36,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 22:50:36,450 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-11-15 22:50:36,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:36,455 INFO L225 Difference]: With dead ends: 6384 [2019-11-15 22:50:36,456 INFO L226 Difference]: Without dead ends: 6298 [2019-11-15 22:50:36,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:50:36,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6298 states. [2019-11-15 22:50:36,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6298 to 5858. [2019-11-15 22:50:36,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5858 states. [2019-11-15 22:50:36,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5858 states to 5858 states and 12952 transitions. [2019-11-15 22:50:36,514 INFO L78 Accepts]: Start accepts. Automaton has 5858 states and 12952 transitions. Word has length 93 [2019-11-15 22:50:36,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:36,514 INFO L462 AbstractCegarLoop]: Abstraction has 5858 states and 12952 transitions. [2019-11-15 22:50:36,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:50:36,514 INFO L276 IsEmpty]: Start isEmpty. Operand 5858 states and 12952 transitions. [2019-11-15 22:50:36,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 22:50:36,519 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:36,519 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 22:50:36,519 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:36,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:36,520 INFO L82 PathProgramCache]: Analyzing trace with hash 555643289, now seen corresponding path program 1 times [2019-11-15 22:50:36,520 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:36,520 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799576996] [2019-11-15 22:50:36,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:36,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:36,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:36,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:36,615 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 22:50:36,616 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799576996] [2019-11-15 22:50:36,616 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:36,616 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:50:36,616 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402960442] [2019-11-15 22:50:36,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:50:36,617 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:36,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:50:36,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:50:36,617 INFO L87 Difference]: Start difference. First operand 5858 states and 12952 transitions. Second operand 7 states. [2019-11-15 22:50:37,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:37,132 INFO L93 Difference]: Finished difference Result 7581 states and 16534 transitions. [2019-11-15 22:50:37,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 22:50:37,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-11-15 22:50:37,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:37,138 INFO L225 Difference]: With dead ends: 7581 [2019-11-15 22:50:37,139 INFO L226 Difference]: Without dead ends: 7529 [2019-11-15 22:50:37,139 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-11-15 22:50:37,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7529 states. [2019-11-15 22:50:37,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7529 to 6656. [2019-11-15 22:50:37,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6656 states. [2019-11-15 22:50:37,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6656 states to 6656 states and 14593 transitions. [2019-11-15 22:50:37,206 INFO L78 Accepts]: Start accepts. Automaton has 6656 states and 14593 transitions. Word has length 93 [2019-11-15 22:50:37,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:37,206 INFO L462 AbstractCegarLoop]: Abstraction has 6656 states and 14593 transitions. [2019-11-15 22:50:37,206 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:50:37,206 INFO L276 IsEmpty]: Start isEmpty. Operand 6656 states and 14593 transitions. [2019-11-15 22:50:37,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 22:50:37,211 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:37,211 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 22:50:37,212 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:37,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:37,212 INFO L82 PathProgramCache]: Analyzing trace with hash -549296730, now seen corresponding path program 1 times [2019-11-15 22:50:37,212 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:37,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593678796] [2019-11-15 22:50:37,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:37,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:37,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:37,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:37,274 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 22:50:37,274 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593678796] [2019-11-15 22:50:37,275 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:37,275 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:50:37,275 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404229621] [2019-11-15 22:50:37,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 22:50:37,276 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:37,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:50:37,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:50:37,276 INFO L87 Difference]: Start difference. First operand 6656 states and 14593 transitions. Second operand 4 states. [2019-11-15 22:50:37,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:37,381 INFO L93 Difference]: Finished difference Result 6959 states and 15169 transitions. [2019-11-15 22:50:37,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:50:37,381 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 93 [2019-11-15 22:50:37,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:37,388 INFO L225 Difference]: With dead ends: 6959 [2019-11-15 22:50:37,389 INFO L226 Difference]: Without dead ends: 6714 [2019-11-15 22:50:37,389 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 22:50:37,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6714 states. [2019-11-15 22:50:37,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6714 to 5996. [2019-11-15 22:50:37,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5996 states. [2019-11-15 22:50:37,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5996 states to 5996 states and 13178 transitions. [2019-11-15 22:50:37,469 INFO L78 Accepts]: Start accepts. Automaton has 5996 states and 13178 transitions. Word has length 93 [2019-11-15 22:50:37,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:37,469 INFO L462 AbstractCegarLoop]: Abstraction has 5996 states and 13178 transitions. [2019-11-15 22:50:37,469 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 22:50:37,469 INFO L276 IsEmpty]: Start isEmpty. Operand 5996 states and 13178 transitions. [2019-11-15 22:50:37,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:50:37,476 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:37,476 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 22:50:37,476 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:37,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:37,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1852786113, now seen corresponding path program 1 times [2019-11-15 22:50:37,477 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:37,477 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598172660] [2019-11-15 22:50:37,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:37,477 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:37,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:37,555 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 22:50:37,557 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598172660] [2019-11-15 22:50:37,557 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:37,557 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:50:37,557 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026000800] [2019-11-15 22:50:37,558 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:50:37,558 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:37,559 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:50:37,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:37,559 INFO L87 Difference]: Start difference. First operand 5996 states and 13178 transitions. Second operand 5 states. [2019-11-15 22:50:37,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:37,841 INFO L93 Difference]: Finished difference Result 6874 states and 15042 transitions. [2019-11-15 22:50:37,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 22:50:37,842 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 22:50:37,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:37,849 INFO L225 Difference]: With dead ends: 6874 [2019-11-15 22:50:37,849 INFO L226 Difference]: Without dead ends: 6849 [2019-11-15 22:50:37,851 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 22:50:37,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6849 states. [2019-11-15 22:50:37,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6849 to 5723. [2019-11-15 22:50:37,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5723 states. [2019-11-15 22:50:37,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5723 states to 5723 states and 12641 transitions. [2019-11-15 22:50:37,930 INFO L78 Accepts]: Start accepts. Automaton has 5723 states and 12641 transitions. Word has length 95 [2019-11-15 22:50:37,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:37,930 INFO L462 AbstractCegarLoop]: Abstraction has 5723 states and 12641 transitions. [2019-11-15 22:50:37,930 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:50:37,930 INFO L276 IsEmpty]: Start isEmpty. Operand 5723 states and 12641 transitions. [2019-11-15 22:50:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:50:37,936 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:37,937 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 22:50:37,937 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:37,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:37,938 INFO L82 PathProgramCache]: Analyzing trace with hash -396670719, now seen corresponding path program 1 times [2019-11-15 22:50:37,939 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:37,939 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431858900] [2019-11-15 22:50:37,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:37,939 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:37,939 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:37,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:38,202 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 22:50:38,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431858900] [2019-11-15 22:50:38,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:38,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 22:50:38,203 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079284247] [2019-11-15 22:50:38,203 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:50:38,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:38,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:50:38,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:50:38,204 INFO L87 Difference]: Start difference. First operand 5723 states and 12641 transitions. Second operand 10 states. [2019-11-15 22:50:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:39,386 INFO L93 Difference]: Finished difference Result 7594 states and 16842 transitions. [2019-11-15 22:50:39,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-15 22:50:39,387 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-15 22:50:39,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:39,394 INFO L225 Difference]: With dead ends: 7594 [2019-11-15 22:50:39,394 INFO L226 Difference]: Without dead ends: 7567 [2019-11-15 22:50:39,395 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:50:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7567 states. [2019-11-15 22:50:39,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7567 to 5870. [2019-11-15 22:50:39,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5870 states. [2019-11-15 22:50:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5870 states to 5870 states and 12991 transitions. [2019-11-15 22:50:39,455 INFO L78 Accepts]: Start accepts. Automaton has 5870 states and 12991 transitions. Word has length 95 [2019-11-15 22:50:39,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:39,455 INFO L462 AbstractCegarLoop]: Abstraction has 5870 states and 12991 transitions. [2019-11-15 22:50:39,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:50:39,455 INFO L276 IsEmpty]: Start isEmpty. Operand 5870 states and 12991 transitions. [2019-11-15 22:50:39,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:50:39,460 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:39,461 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 22:50:39,461 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:39,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:39,461 INFO L82 PathProgramCache]: Analyzing trace with hash -365650912, now seen corresponding path program 1 times [2019-11-15 22:50:39,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:39,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158093154] [2019-11-15 22:50:39,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:39,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:39,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:39,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 22:50:39,582 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158093154] [2019-11-15 22:50:39,582 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:39,582 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:50:39,582 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104262985] [2019-11-15 22:50:39,582 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:50:39,583 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:39,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:50:39,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:50:39,583 INFO L87 Difference]: Start difference. First operand 5870 states and 12991 transitions. Second operand 7 states. [2019-11-15 22:50:39,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:39,986 INFO L93 Difference]: Finished difference Result 6669 states and 14682 transitions. [2019-11-15 22:50:39,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:50:39,986 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-15 22:50:39,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:39,992 INFO L225 Difference]: With dead ends: 6669 [2019-11-15 22:50:39,992 INFO L226 Difference]: Without dead ends: 6669 [2019-11-15 22:50:39,992 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2019-11-15 22:50:39,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6669 states. [2019-11-15 22:50:40,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6669 to 5793. [2019-11-15 22:50:40,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5793 states. [2019-11-15 22:50:40,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5793 states to 5793 states and 12831 transitions. [2019-11-15 22:50:40,045 INFO L78 Accepts]: Start accepts. Automaton has 5793 states and 12831 transitions. Word has length 95 [2019-11-15 22:50:40,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:40,046 INFO L462 AbstractCegarLoop]: Abstraction has 5793 states and 12831 transitions. [2019-11-15 22:50:40,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:50:40,046 INFO L276 IsEmpty]: Start isEmpty. Operand 5793 states and 12831 transitions. [2019-11-15 22:50:40,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:50:40,051 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:40,051 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 22:50:40,052 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:40,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:40,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1462118178, now seen corresponding path program 1 times [2019-11-15 22:50:40,052 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:40,052 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121051260] [2019-11-15 22:50:40,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:40,053 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:40,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:40,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:40,214 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 22:50:40,214 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121051260] [2019-11-15 22:50:40,215 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:40,215 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:50:40,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247604378] [2019-11-15 22:50:40,216 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:50:40,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:40,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:50:40,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:50:40,217 INFO L87 Difference]: Start difference. First operand 5793 states and 12831 transitions. Second operand 8 states. [2019-11-15 22:50:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:40,739 INFO L93 Difference]: Finished difference Result 7138 states and 15812 transitions. [2019-11-15 22:50:40,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-15 22:50:40,739 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-11-15 22:50:40,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:40,747 INFO L225 Difference]: With dead ends: 7138 [2019-11-15 22:50:40,747 INFO L226 Difference]: Without dead ends: 7059 [2019-11-15 22:50:40,747 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2019-11-15 22:50:40,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7059 states. [2019-11-15 22:50:40,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7059 to 5804. [2019-11-15 22:50:40,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5804 states. [2019-11-15 22:50:40,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5804 states to 5804 states and 12952 transitions. [2019-11-15 22:50:40,828 INFO L78 Accepts]: Start accepts. Automaton has 5804 states and 12952 transitions. Word has length 95 [2019-11-15 22:50:40,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:40,829 INFO L462 AbstractCegarLoop]: Abstraction has 5804 states and 12952 transitions. [2019-11-15 22:50:40,829 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:50:40,829 INFO L276 IsEmpty]: Start isEmpty. Operand 5804 states and 12952 transitions. [2019-11-15 22:50:40,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:50:40,834 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:40,835 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 22:50:40,835 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:40,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:40,836 INFO L82 PathProgramCache]: Analyzing trace with hash 1493137985, now seen corresponding path program 1 times [2019-11-15 22:50:40,836 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:40,836 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648406346] [2019-11-15 22:50:40,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:40,836 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:40,837 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:40,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:40,917 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 22:50:40,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648406346] [2019-11-15 22:50:40,918 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:40,918 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:50:40,918 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881765503] [2019-11-15 22:50:40,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:50:40,919 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:40,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:50:40,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:50:40,919 INFO L87 Difference]: Start difference. First operand 5804 states and 12952 transitions. Second operand 6 states. [2019-11-15 22:50:41,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:41,343 INFO L93 Difference]: Finished difference Result 7026 states and 15568 transitions. [2019-11-15 22:50:41,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 22:50:41,344 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 22:50:41,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:41,351 INFO L225 Difference]: With dead ends: 7026 [2019-11-15 22:50:41,351 INFO L226 Difference]: Without dead ends: 7026 [2019-11-15 22:50:41,351 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2019-11-15 22:50:41,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7026 states. [2019-11-15 22:50:41,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7026 to 5715. [2019-11-15 22:50:41,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5715 states. [2019-11-15 22:50:41,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5715 states to 5715 states and 12748 transitions. [2019-11-15 22:50:41,430 INFO L78 Accepts]: Start accepts. Automaton has 5715 states and 12748 transitions. Word has length 95 [2019-11-15 22:50:41,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:41,430 INFO L462 AbstractCegarLoop]: Abstraction has 5715 states and 12748 transitions. [2019-11-15 22:50:41,430 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:50:41,430 INFO L276 IsEmpty]: Start isEmpty. Operand 5715 states and 12748 transitions. [2019-11-15 22:50:41,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:50:41,436 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:41,436 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 22:50:41,436 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:41,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:41,437 INFO L82 PathProgramCache]: Analyzing trace with hash -814347551, now seen corresponding path program 1 times [2019-11-15 22:50:41,437 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:41,437 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382615063] [2019-11-15 22:50:41,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:41,437 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:41,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:41,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:41,620 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 22:50:41,620 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382615063] [2019-11-15 22:50:41,620 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:41,620 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 22:50:41,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132738069] [2019-11-15 22:50:41,621 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-15 22:50:41,621 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:41,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 22:50:41,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:50:41,622 INFO L87 Difference]: Start difference. First operand 5715 states and 12748 transitions. Second operand 9 states. [2019-11-15 22:50:42,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:42,263 INFO L93 Difference]: Finished difference Result 20900 states and 47119 transitions. [2019-11-15 22:50:42,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-11-15 22:50:42,263 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2019-11-15 22:50:42,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:42,278 INFO L225 Difference]: With dead ends: 20900 [2019-11-15 22:50:42,278 INFO L226 Difference]: Without dead ends: 12591 [2019-11-15 22:50:42,281 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=99, Invalid=363, Unknown=0, NotChecked=0, Total=462 [2019-11-15 22:50:42,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12591 states. [2019-11-15 22:50:42,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12591 to 5450. [2019-11-15 22:50:42,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5450 states. [2019-11-15 22:50:42,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5450 states to 5450 states and 12061 transitions. [2019-11-15 22:50:42,391 INFO L78 Accepts]: Start accepts. Automaton has 5450 states and 12061 transitions. Word has length 95 [2019-11-15 22:50:42,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:42,392 INFO L462 AbstractCegarLoop]: Abstraction has 5450 states and 12061 transitions. [2019-11-15 22:50:42,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-15 22:50:42,392 INFO L276 IsEmpty]: Start isEmpty. Operand 5450 states and 12061 transitions. [2019-11-15 22:50:42,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:50:42,398 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:42,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, 1, 1] [2019-11-15 22:50:42,398 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:42,398 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:42,399 INFO L82 PathProgramCache]: Analyzing trace with hash -909093823, now seen corresponding path program 2 times [2019-11-15 22:50:42,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:42,399 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174721503] [2019-11-15 22:50:42,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:42,399 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:42,399 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:42,534 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 22:50:42,535 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174721503] [2019-11-15 22:50:42,535 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:42,535 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 22:50:42,535 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880567234] [2019-11-15 22:50:42,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-15 22:50:42,536 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:42,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 22:50:42,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:50:42,536 INFO L87 Difference]: Start difference. First operand 5450 states and 12061 transitions. Second operand 7 states. [2019-11-15 22:50:42,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:42,636 INFO L93 Difference]: Finished difference Result 8687 states and 19326 transitions. [2019-11-15 22:50:42,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:50:42,637 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-11-15 22:50:42,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:42,640 INFO L225 Difference]: With dead ends: 8687 [2019-11-15 22:50:42,640 INFO L226 Difference]: Without dead ends: 3425 [2019-11-15 22:50:42,641 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:50:42,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3425 states. [2019-11-15 22:50:42,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3425 to 3425. [2019-11-15 22:50:42,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3425 states. [2019-11-15 22:50:42,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3425 states to 3425 states and 7624 transitions. [2019-11-15 22:50:42,683 INFO L78 Accepts]: Start accepts. Automaton has 3425 states and 7624 transitions. Word has length 95 [2019-11-15 22:50:42,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:42,684 INFO L462 AbstractCegarLoop]: Abstraction has 3425 states and 7624 transitions. [2019-11-15 22:50:42,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-15 22:50:42,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3425 states and 7624 transitions. [2019-11-15 22:50:42,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:50:42,688 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:42,688 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 22:50:42,688 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:42,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:42,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1231927602, now seen corresponding path program 1 times [2019-11-15 22:50:42,689 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:42,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827180094] [2019-11-15 22:50:42,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:42,691 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:42,691 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:42,756 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 22:50:42,756 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827180094] [2019-11-15 22:50:42,756 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:42,756 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:50:42,757 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098821560] [2019-11-15 22:50:42,757 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:50:42,757 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:42,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:50:42,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:42,758 INFO L87 Difference]: Start difference. First operand 3425 states and 7624 transitions. Second operand 5 states. [2019-11-15 22:50:43,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:43,225 INFO L93 Difference]: Finished difference Result 5170 states and 11518 transitions. [2019-11-15 22:50:43,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:50:43,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 22:50:43,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:43,230 INFO L225 Difference]: With dead ends: 5170 [2019-11-15 22:50:43,231 INFO L226 Difference]: Without dead ends: 5096 [2019-11-15 22:50:43,231 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 22:50:43,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5096 states. [2019-11-15 22:50:43,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5096 to 3836. [2019-11-15 22:50:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3836 states. [2019-11-15 22:50:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3836 states to 3836 states and 8600 transitions. [2019-11-15 22:50:43,323 INFO L78 Accepts]: Start accepts. Automaton has 3836 states and 8600 transitions. Word has length 95 [2019-11-15 22:50:43,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:43,323 INFO L462 AbstractCegarLoop]: Abstraction has 3836 states and 8600 transitions. [2019-11-15 22:50:43,323 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:50:43,323 INFO L276 IsEmpty]: Start isEmpty. Operand 3836 states and 8600 transitions. [2019-11-15 22:50:43,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:50:43,327 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:43,327 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 22:50:43,328 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:43,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:43,328 INFO L82 PathProgramCache]: Analyzing trace with hash 2134984108, now seen corresponding path program 2 times [2019-11-15 22:50:43,328 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:43,329 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065636423] [2019-11-15 22:50:43,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:43,330 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:43,330 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:43,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:43,393 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 22:50:43,393 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065636423] [2019-11-15 22:50:43,394 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:43,394 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 22:50:43,394 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367557780] [2019-11-15 22:50:43,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 22:50:43,395 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:43,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 22:50:43,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 22:50:43,395 INFO L87 Difference]: Start difference. First operand 3836 states and 8600 transitions. Second operand 5 states. [2019-11-15 22:50:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:43,767 INFO L93 Difference]: Finished difference Result 4687 states and 10411 transitions. [2019-11-15 22:50:43,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 22:50:43,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-11-15 22:50:43,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:43,773 INFO L225 Difference]: With dead ends: 4687 [2019-11-15 22:50:43,773 INFO L226 Difference]: Without dead ends: 4635 [2019-11-15 22:50:43,773 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-11-15 22:50:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4635 states. [2019-11-15 22:50:43,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4635 to 4041. [2019-11-15 22:50:43,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4041 states. [2019-11-15 22:50:43,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4041 states to 4041 states and 9015 transitions. [2019-11-15 22:50:43,827 INFO L78 Accepts]: Start accepts. Automaton has 4041 states and 9015 transitions. Word has length 95 [2019-11-15 22:50:43,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:43,828 INFO L462 AbstractCegarLoop]: Abstraction has 4041 states and 9015 transitions. [2019-11-15 22:50:43,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 22:50:43,828 INFO L276 IsEmpty]: Start isEmpty. Operand 4041 states and 9015 transitions. [2019-11-15 22:50:43,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:50:43,832 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:43,832 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 22:50:43,833 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:43,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:43,833 INFO L82 PathProgramCache]: Analyzing trace with hash 1243243729, now seen corresponding path program 2 times [2019-11-15 22:50:43,833 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:43,833 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729844382] [2019-11-15 22:50:43,833 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:43,834 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:43,834 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:43,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:43,900 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 22:50:43,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729844382] [2019-11-15 22:50:43,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:43,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:50:43,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397687621] [2019-11-15 22:50:43,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:50:43,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:43,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:50:43,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:50:43,902 INFO L87 Difference]: Start difference. First operand 4041 states and 9015 transitions. Second operand 6 states. [2019-11-15 22:50:44,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:44,200 INFO L93 Difference]: Finished difference Result 4883 states and 10772 transitions. [2019-11-15 22:50:44,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:50:44,201 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 22:50:44,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:44,205 INFO L225 Difference]: With dead ends: 4883 [2019-11-15 22:50:44,205 INFO L226 Difference]: Without dead ends: 4859 [2019-11-15 22:50:44,205 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:50:44,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4859 states. [2019-11-15 22:50:44,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4859 to 4028. [2019-11-15 22:50:44,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4028 states. [2019-11-15 22:50:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4028 states to 4028 states and 8977 transitions. [2019-11-15 22:50:44,245 INFO L78 Accepts]: Start accepts. Automaton has 4028 states and 8977 transitions. Word has length 95 [2019-11-15 22:50:44,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:44,245 INFO L462 AbstractCegarLoop]: Abstraction has 4028 states and 8977 transitions. [2019-11-15 22:50:44,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:50:44,246 INFO L276 IsEmpty]: Start isEmpty. Operand 4028 states and 8977 transitions. [2019-11-15 22:50:44,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:50:44,248 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:44,249 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 22:50:44,249 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:44,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:44,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1564588366, now seen corresponding path program 2 times [2019-11-15 22:50:44,249 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:44,249 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492465068] [2019-11-15 22:50:44,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:44,249 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:44,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:44,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:44,358 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 22:50:44,358 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492465068] [2019-11-15 22:50:44,358 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:44,358 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 22:50:44,359 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14146780] [2019-11-15 22:50:44,359 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-15 22:50:44,359 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:44,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 22:50:44,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-15 22:50:44,360 INFO L87 Difference]: Start difference. First operand 4028 states and 8977 transitions. Second operand 8 states. [2019-11-15 22:50:44,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:44,593 INFO L93 Difference]: Finished difference Result 4760 states and 10446 transitions. [2019-11-15 22:50:44,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:50:44,593 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 95 [2019-11-15 22:50:44,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:44,597 INFO L225 Difference]: With dead ends: 4760 [2019-11-15 22:50:44,597 INFO L226 Difference]: Without dead ends: 4760 [2019-11-15 22:50:44,597 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:50:44,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4760 states. [2019-11-15 22:50:44,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4760 to 4049. [2019-11-15 22:50:44,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4049 states. [2019-11-15 22:50:44,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4049 states to 4049 states and 9019 transitions. [2019-11-15 22:50:44,634 INFO L78 Accepts]: Start accepts. Automaton has 4049 states and 9019 transitions. Word has length 95 [2019-11-15 22:50:44,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:44,635 INFO L462 AbstractCegarLoop]: Abstraction has 4049 states and 9019 transitions. [2019-11-15 22:50:44,635 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-15 22:50:44,635 INFO L276 IsEmpty]: Start isEmpty. Operand 4049 states and 9019 transitions. [2019-11-15 22:50:44,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:50:44,637 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:44,638 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 22:50:44,638 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:44,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:44,638 INFO L82 PathProgramCache]: Analyzing trace with hash 294200531, now seen corresponding path program 2 times [2019-11-15 22:50:44,639 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:44,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402101814] [2019-11-15 22:50:44,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:44,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:44,639 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:44,713 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 22:50:44,713 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402101814] [2019-11-15 22:50:44,713 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:44,714 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-15 22:50:44,714 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010227559] [2019-11-15 22:50:44,714 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-15 22:50:44,714 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:44,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 22:50:44,715 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-15 22:50:44,715 INFO L87 Difference]: Start difference. First operand 4049 states and 9019 transitions. Second operand 6 states. [2019-11-15 22:50:45,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:45,054 INFO L93 Difference]: Finished difference Result 4627 states and 10288 transitions. [2019-11-15 22:50:45,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:50:45,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-11-15 22:50:45,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:45,060 INFO L225 Difference]: With dead ends: 4627 [2019-11-15 22:50:45,060 INFO L226 Difference]: Without dead ends: 4627 [2019-11-15 22:50:45,060 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:50:45,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4627 states. [2019-11-15 22:50:45,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4627 to 3959. [2019-11-15 22:50:45,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3959 states. [2019-11-15 22:50:45,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3959 states to 3959 states and 8827 transitions. [2019-11-15 22:50:45,115 INFO L78 Accepts]: Start accepts. Automaton has 3959 states and 8827 transitions. Word has length 95 [2019-11-15 22:50:45,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:45,115 INFO L462 AbstractCegarLoop]: Abstraction has 3959 states and 8827 transitions. [2019-11-15 22:50:45,115 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-15 22:50:45,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3959 states and 8827 transitions. [2019-11-15 22:50:45,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:50:45,119 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:45,120 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 22:50:45,120 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:45,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:45,120 INFO L82 PathProgramCache]: Analyzing trace with hash -2013285005, now seen corresponding path program 3 times [2019-11-15 22:50:45,120 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:45,121 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1135367464] [2019-11-15 22:50:45,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:45,121 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:45,121 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:50:45,328 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 22:50:45,328 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1135367464] [2019-11-15 22:50:45,328 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:50:45,329 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-15 22:50:45,329 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974498094] [2019-11-15 22:50:45,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-15 22:50:45,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:50:45,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 22:50:45,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-11-15 22:50:45,330 INFO L87 Difference]: Start difference. First operand 3959 states and 8827 transitions. Second operand 10 states. [2019-11-15 22:50:45,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:50:45,645 INFO L93 Difference]: Finished difference Result 7722 states and 17470 transitions. [2019-11-15 22:50:45,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-15 22:50:45,646 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2019-11-15 22:50:45,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 22:50:45,651 INFO L225 Difference]: With dead ends: 7722 [2019-11-15 22:50:45,651 INFO L226 Difference]: Without dead ends: 5151 [2019-11-15 22:50:45,652 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-11-15 22:50:45,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5151 states. [2019-11-15 22:50:45,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5151 to 3929. [2019-11-15 22:50:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3929 states. [2019-11-15 22:50:45,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3929 states to 3929 states and 8761 transitions. [2019-11-15 22:50:45,701 INFO L78 Accepts]: Start accepts. Automaton has 3929 states and 8761 transitions. Word has length 95 [2019-11-15 22:50:45,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 22:50:45,701 INFO L462 AbstractCegarLoop]: Abstraction has 3929 states and 8761 transitions. [2019-11-15 22:50:45,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-15 22:50:45,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3929 states and 8761 transitions. [2019-11-15 22:50:45,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 22:50:45,704 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 22:50:45,704 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 22:50:45,704 INFO L410 AbstractCegarLoop]: === Iteration 37 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 22:50:45,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:50:45,704 INFO L82 PathProgramCache]: Analyzing trace with hash 266977457, now seen corresponding path program 4 times [2019-11-15 22:50:45,705 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:50:45,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454460457] [2019-11-15 22:50:45,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:45,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:50:45,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:50:45,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:50:45,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:50:45,779 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:50:45,779 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 22:50:45,906 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-15 22:50:45,908 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 10:50:45 BasicIcfg [2019-11-15 22:50:45,908 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 22:50:45,908 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:50:45,909 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:50:45,909 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:50:45,909 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:50:04" (3/4) ... [2019-11-15 22:50:45,911 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 22:50:46,027 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_6962cae2-2460-461b-8269-f39874ede4a5/bin/uautomizer/witness.graphml [2019-11-15 22:50:46,028 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:50:46,029 INFO L168 Benchmark]: Toolchain (without parser) took 43309.20 ms. Allocated memory was 1.0 GB in the beginning and 4.8 GB in the end (delta: 3.8 GB). Free memory was 944.7 MB in the beginning and 3.4 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2019-11-15 22:50:46,030 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:50:46,030 INFO L168 Benchmark]: CACSL2BoogieTranslator took 677.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2019-11-15 22:50:46,031 INFO L168 Benchmark]: Boogie Procedure Inliner took 66.82 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:50:46,031 INFO L168 Benchmark]: Boogie Preprocessor took 73.59 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 22:50:46,031 INFO L168 Benchmark]: RCFGBuilder took 775.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-15 22:50:46,032 INFO L168 Benchmark]: TraceAbstraction took 41592.54 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. [2019-11-15 22:50:46,032 INFO L168 Benchmark]: Witness Printer took 119.18 ms. Allocated memory is still 4.8 GB. Free memory was 3.5 GB in the beginning and 3.4 GB in the end (delta: 74.1 MB). Peak memory consumption was 74.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:50:46,034 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.29 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 677.33 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 125.8 MB). Free memory was 944.7 MB in the beginning and 1.1 GB in the end (delta: -147.4 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 66.82 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 73.59 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 775.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 41592.54 ms. Allocated memory was 1.2 GB in the beginning and 4.8 GB in the end (delta: 3.6 GB). Free memory was 1.0 GB in the beginning and 3.5 GB in the end (delta: -2.5 GB). Peak memory consumption was 1.2 GB. Max. memory is 11.5 GB. * Witness Printer took 119.18 ms. Allocated memory is still 4.8 GB. Free memory was 3.5 GB in the beginning and 3.4 GB in the end (delta: 74.1 MB). Peak memory consumption was 74.1 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] [L703] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L704] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L705] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L706] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L707] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L708] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0] [L709] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0] [L710] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0] [L711] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0] [L712] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}] [L713] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0] [L714] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0] [L715] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0] [L716] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0] [L718] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L719] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L720] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L796] 0 pthread_t t1707; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L797] FCALL, FORK 0 pthread_create(&t1707, ((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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L798] 0 pthread_t t1708; VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] FCALL, FORK 0 pthread_create(&t1708, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L724] 1 x$w_buff1 = x$w_buff0 [L725] 1 x$w_buff0 = 1 [L726] 1 x$w_buff1_used = x$w_buff0_used [L727] 1 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 1 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L729] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L730] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L731] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L732] 1 x$r_buff0_thd1 = (_Bool)1 [L735] 1 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L752] 2 y = 2 [L755] 2 __unbuffered_p1_EAX = y [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 x$flush_delayed = weak$$choice2 [L761] 2 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] EXPR 2 !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=1, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L762] 2 x = !x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff1) [L739] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L763] EXPR 2 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)) [L764] EXPR 2 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L764] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)) [L765] EXPR 2 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L766] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] EXPR 2 weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L767] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2)) [L768] EXPR 2 weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L768] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used || !x$r_buff0_thd2 && !x$w_buff1_used || !x$r_buff0_thd2 && !x$r_buff1_thd2 ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] EXPR 2 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=3, x$flush_delayed ? x$mem_tmp : x=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L770] 2 x = x$flush_delayed ? x$mem_tmp : x [L771] 2 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L774] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L774] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x)=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x=0, y=2] [L774] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L776] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L776] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L781] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L741] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L742] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L745] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L805] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L806] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L806] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L807] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L807] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L812] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p1_EAX == 2 && __unbuffered_p1_EBX == 0) VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=3, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 218 locations, 3 error locations. Result: UNSAFE, OverallTime: 41.4s, OverallIterations: 37, TraceHistogramMax: 1, AutomataDifference: 17.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 9490 SDtfs, 10225 SDslu, 24023 SDs, 0 SdLazy, 9751 SolverSat, 571 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 409 GetRequests, 117 SyntacticMatches, 21 SemanticMatches, 271 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 3.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59948occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 16.3s AutomataMinimizationTime, 36 MinimizatonAttempts, 75067 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.0s InterpolantComputationTime, 2836 NumberOfCodeBlocks, 2836 NumberOfCodeBlocksAsserted, 37 NumberOfCheckSat, 2705 ConstructedInterpolants, 0 QuantifiedInterpolants, 652897 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 36 InterpolantComputations, 36 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...