./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe029_pso.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_d3e071e5-fa50-4b22-b385-2654bf860bff/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d3e071e5-fa50-4b22-b385-2654bf860bff/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d3e071e5-fa50-4b22-b385-2654bf860bff/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d3e071e5-fa50-4b22-b385-2654bf860bff/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe029_pso.opt.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d3e071e5-fa50-4b22-b385-2654bf860bff/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d3e071e5-fa50-4b22-b385-2654bf860bff/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 2894ac2f07d93de98abd209517006f1f24ae90d3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-16 00:02:32,664 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-16 00:02:32,666 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-16 00:02:32,681 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-16 00:02:32,681 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-16 00:02:32,682 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-16 00:02:32,684 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-16 00:02:32,693 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-16 00:02:32,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-16 00:02:32,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-16 00:02:32,702 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-16 00:02:32,703 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-16 00:02:32,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-16 00:02:32,704 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-16 00:02:32,705 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-16 00:02:32,706 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-16 00:02:32,706 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-16 00:02:32,707 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-16 00:02:32,708 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-16 00:02:32,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-16 00:02:32,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-16 00:02:32,711 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-16 00:02:32,712 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-16 00:02:32,712 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-16 00:02:32,719 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-16 00:02:32,719 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-16 00:02:32,719 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-16 00:02:32,720 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-16 00:02:32,720 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-16 00:02:32,721 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-16 00:02:32,721 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-16 00:02:32,722 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-16 00:02:32,722 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-16 00:02:32,723 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-16 00:02:32,724 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-16 00:02:32,724 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-16 00:02:32,725 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-16 00:02:32,725 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-16 00:02:32,725 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-16 00:02:32,726 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-16 00:02:32,726 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-16 00:02:32,727 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d3e071e5-fa50-4b22-b385-2654bf860bff/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-16 00:02:32,739 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-16 00:02:32,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-16 00:02:32,741 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-16 00:02:32,741 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-16 00:02:32,741 INFO L138 SettingsManager]: * Use SBE=true [2019-11-16 00:02:32,742 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-16 00:02:32,742 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-16 00:02:32,742 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-16 00:02:32,742 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-16 00:02:32,742 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-16 00:02:32,743 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-16 00:02:32,743 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-16 00:02:32,743 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-16 00:02:32,743 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-16 00:02:32,743 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-16 00:02:32,744 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-16 00:02:32,744 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-16 00:02:32,744 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-16 00:02:32,744 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-16 00:02:32,744 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-16 00:02:32,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-16 00:02:32,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-16 00:02:32,745 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-16 00:02:32,745 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-16 00:02:32,745 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-16 00:02:32,746 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-16 00:02:32,746 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-16 00:02:32,746 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-16 00:02:32,746 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_d3e071e5-fa50-4b22-b385-2654bf860bff/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 -> 2894ac2f07d93de98abd209517006f1f24ae90d3 [2019-11-16 00:02:32,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-16 00:02:32,783 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-16 00:02:32,786 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-16 00:02:32,787 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-16 00:02:32,788 INFO L275 PluginConnector]: CDTParser initialized [2019-11-16 00:02:32,788 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d3e071e5-fa50-4b22-b385-2654bf860bff/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/safe029_pso.opt.i [2019-11-16 00:02:32,864 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d3e071e5-fa50-4b22-b385-2654bf860bff/bin/uautomizer/data/d918a69af/f91d78718b3d400ea4d87cc7a169ec4c/FLAG36194a15c [2019-11-16 00:02:33,314 INFO L306 CDTParser]: Found 1 translation units. [2019-11-16 00:02:33,316 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d3e071e5-fa50-4b22-b385-2654bf860bff/sv-benchmarks/c/pthread-wmm/safe029_pso.opt.i [2019-11-16 00:02:33,336 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d3e071e5-fa50-4b22-b385-2654bf860bff/bin/uautomizer/data/d918a69af/f91d78718b3d400ea4d87cc7a169ec4c/FLAG36194a15c [2019-11-16 00:02:33,569 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d3e071e5-fa50-4b22-b385-2654bf860bff/bin/uautomizer/data/d918a69af/f91d78718b3d400ea4d87cc7a169ec4c [2019-11-16 00:02:33,572 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-16 00:02:33,573 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-16 00:02:33,574 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-16 00:02:33,574 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-16 00:02:33,578 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-16 00:02:33,579 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:02:33" (1/1) ... [2019-11-16 00:02:33,582 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45c642ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:33, skipping insertion in model container [2019-11-16 00:02:33,582 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:02:33" (1/1) ... [2019-11-16 00:02:33,589 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-16 00:02:33,628 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-16 00:02:34,108 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:02:34,119 INFO L188 MainTranslator]: Completed pre-run [2019-11-16 00:02:34,169 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-16 00:02:34,246 INFO L192 MainTranslator]: Completed translation [2019-11-16 00:02:34,247 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:34 WrapperNode [2019-11-16 00:02:34,247 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-16 00:02:34,248 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-16 00:02:34,248 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-16 00:02:34,248 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-16 00:02:34,257 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:34" (1/1) ... [2019-11-16 00:02:34,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:34" (1/1) ... [2019-11-16 00:02:34,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-16 00:02:34,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-16 00:02:34,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-16 00:02:34,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-16 00:02:34,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:34" (1/1) ... [2019-11-16 00:02:34,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:34" (1/1) ... [2019-11-16 00:02:34,327 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:34" (1/1) ... [2019-11-16 00:02:34,328 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:34" (1/1) ... [2019-11-16 00:02:34,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:34" (1/1) ... [2019-11-16 00:02:34,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:34" (1/1) ... [2019-11-16 00:02:34,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:34" (1/1) ... [2019-11-16 00:02:34,352 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-16 00:02:34,353 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-16 00:02:34,353 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-16 00:02:34,353 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-16 00:02:34,354 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d3e071e5-fa50-4b22-b385-2654bf860bff/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-16 00:02:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-16 00:02:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-11-16 00:02:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-16 00:02:34,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-16 00:02:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-11-16 00:02:34,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-11-16 00:02:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-11-16 00:02:34,430 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-11-16 00:02:34,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-11-16 00:02:34,431 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-16 00:02:34,431 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-16 00:02:34,433 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-16 00:02:35,080 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-16 00:02:35,080 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-11-16 00:02:35,082 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:02:35 BoogieIcfgContainer [2019-11-16 00:02:35,082 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-16 00:02:35,083 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-16 00:02:35,083 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-16 00:02:35,086 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-16 00:02:35,086 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:02:33" (1/3) ... [2019-11-16 00:02:35,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@921ac7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:02:35, skipping insertion in model container [2019-11-16 00:02:35,087 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:02:34" (2/3) ... [2019-11-16 00:02:35,087 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@921ac7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:02:35, skipping insertion in model container [2019-11-16 00:02:35,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:02:35" (3/3) ... [2019-11-16 00:02:35,089 INFO L109 eAbstractionObserver]: Analyzing ICFG safe029_pso.opt.i [2019-11-16 00:02:35,122 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,122 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,122 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,123 WARN L315 ript$VariableManager]: TermVariabe Thread0_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,123 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,123 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,123 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,124 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,124 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,124 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,124 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,125 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,125 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,125 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,125 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,125 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,126 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,126 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,126 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,126 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,127 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,127 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,127 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,127 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,128 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,128 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,128 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,128 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,128 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,129 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,129 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,130 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,130 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,130 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,130 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,130 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,131 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,131 WARN L315 ript$VariableManager]: TermVariabe Thread1_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,131 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,131 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,132 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,132 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,132 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,132 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,133 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,133 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,133 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,133 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,133 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,134 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,134 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,134 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,134 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,135 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,135 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,135 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,135 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,135 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,136 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,136 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,136 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,136 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,137 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,137 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-16 00:02:35,142 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-16 00:02:35,143 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-16 00:02:35,150 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-16 00:02:35,160 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-16 00:02:35,178 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-16 00:02:35,178 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-16 00:02:35,178 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-16 00:02:35,178 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-16 00:02:35,179 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-16 00:02:35,179 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-16 00:02:35,179 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-16 00:02:35,179 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-16 00:02:35,191 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 138 places, 176 transitions [2019-11-16 00:02:36,746 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 22492 states. [2019-11-16 00:02:36,749 INFO L276 IsEmpty]: Start isEmpty. Operand 22492 states. [2019-11-16 00:02:36,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-16 00:02:36,764 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:36,765 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] [2019-11-16 00:02:36,767 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:36,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:36,773 INFO L82 PathProgramCache]: Analyzing trace with hash 379878024, now seen corresponding path program 1 times [2019-11-16 00:02:36,780 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:36,781 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467441522] [2019-11-16 00:02:36,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:36,782 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:36,782 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:37,110 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-16 00:02:37,111 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467441522] [2019-11-16 00:02:37,111 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:37,112 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:02:37,112 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343068940] [2019-11-16 00:02:37,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:02:37,117 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:37,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:02:37,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:02:37,133 INFO L87 Difference]: Start difference. First operand 22492 states. Second operand 4 states. [2019-11-16 00:02:37,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:37,803 INFO L93 Difference]: Finished difference Result 23444 states and 91745 transitions. [2019-11-16 00:02:37,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:02:37,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-11-16 00:02:37,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:38,046 INFO L225 Difference]: With dead ends: 23444 [2019-11-16 00:02:38,046 INFO L226 Difference]: Without dead ends: 21268 [2019-11-16 00:02:38,048 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-16 00:02:38,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21268 states. [2019-11-16 00:02:39,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21268 to 21268. [2019-11-16 00:02:39,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21268 states. [2019-11-16 00:02:39,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21268 states to 21268 states and 83769 transitions. [2019-11-16 00:02:39,244 INFO L78 Accepts]: Start accepts. Automaton has 21268 states and 83769 transitions. Word has length 35 [2019-11-16 00:02:39,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:39,245 INFO L462 AbstractCegarLoop]: Abstraction has 21268 states and 83769 transitions. [2019-11-16 00:02:39,245 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:02:39,245 INFO L276 IsEmpty]: Start isEmpty. Operand 21268 states and 83769 transitions. [2019-11-16 00:02:39,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-16 00:02:39,256 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:39,257 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] [2019-11-16 00:02:39,257 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:39,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:39,257 INFO L82 PathProgramCache]: Analyzing trace with hash -1392166447, now seen corresponding path program 1 times [2019-11-16 00:02:39,258 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:39,258 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901650309] [2019-11-16 00:02:39,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:39,259 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:39,259 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:39,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:39,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-16 00:02:39,403 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901650309] [2019-11-16 00:02:39,403 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:39,403 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:02:39,403 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159423259] [2019-11-16 00:02:39,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:02:39,405 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:39,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:02:39,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:02:39,406 INFO L87 Difference]: Start difference. First operand 21268 states and 83769 transitions. Second operand 5 states. [2019-11-16 00:02:40,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:40,252 INFO L93 Difference]: Finished difference Result 34702 states and 129061 transitions. [2019-11-16 00:02:40,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:02:40,253 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-11-16 00:02:40,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:40,399 INFO L225 Difference]: With dead ends: 34702 [2019-11-16 00:02:40,399 INFO L226 Difference]: Without dead ends: 34558 [2019-11-16 00:02:40,400 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-16 00:02:40,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34558 states. [2019-11-16 00:02:41,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34558 to 33058. [2019-11-16 00:02:41,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33058 states. [2019-11-16 00:02:41,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33058 states to 33058 states and 123949 transitions. [2019-11-16 00:02:41,732 INFO L78 Accepts]: Start accepts. Automaton has 33058 states and 123949 transitions. Word has length 42 [2019-11-16 00:02:41,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:41,734 INFO L462 AbstractCegarLoop]: Abstraction has 33058 states and 123949 transitions. [2019-11-16 00:02:41,734 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:02:41,734 INFO L276 IsEmpty]: Start isEmpty. Operand 33058 states and 123949 transitions. [2019-11-16 00:02:41,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-16 00:02:41,739 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:41,740 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] [2019-11-16 00:02:41,740 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:41,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:41,740 INFO L82 PathProgramCache]: Analyzing trace with hash -791986806, now seen corresponding path program 1 times [2019-11-16 00:02:41,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:41,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146705443] [2019-11-16 00:02:41,741 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:41,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:41,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:41,855 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-16 00:02:41,855 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146705443] [2019-11-16 00:02:41,855 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:41,856 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:02:41,856 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758291899] [2019-11-16 00:02:41,856 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:02:41,856 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:41,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:02:41,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:02:41,857 INFO L87 Difference]: Start difference. First operand 33058 states and 123949 transitions. Second operand 5 states. [2019-11-16 00:02:42,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:42,850 INFO L93 Difference]: Finished difference Result 40210 states and 148618 transitions. [2019-11-16 00:02:42,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:02:42,851 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 43 [2019-11-16 00:02:42,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:43,104 INFO L225 Difference]: With dead ends: 40210 [2019-11-16 00:02:43,104 INFO L226 Difference]: Without dead ends: 40050 [2019-11-16 00:02:43,105 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-16 00:02:43,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40050 states. [2019-11-16 00:02:44,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40050 to 34631. [2019-11-16 00:02:44,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34631 states. [2019-11-16 00:02:44,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34631 states to 34631 states and 129245 transitions. [2019-11-16 00:02:44,802 INFO L78 Accepts]: Start accepts. Automaton has 34631 states and 129245 transitions. Word has length 43 [2019-11-16 00:02:44,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:44,804 INFO L462 AbstractCegarLoop]: Abstraction has 34631 states and 129245 transitions. [2019-11-16 00:02:44,804 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:02:44,805 INFO L276 IsEmpty]: Start isEmpty. Operand 34631 states and 129245 transitions. [2019-11-16 00:02:44,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-16 00:02:44,818 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:44,818 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:44,818 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:44,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:44,819 INFO L82 PathProgramCache]: Analyzing trace with hash 944186895, now seen corresponding path program 1 times [2019-11-16 00:02:44,819 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:44,819 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386159281] [2019-11-16 00:02:44,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:44,820 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:44,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:44,902 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-16 00:02:44,902 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386159281] [2019-11-16 00:02:44,903 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:44,903 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:02:44,903 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353248533] [2019-11-16 00:02:44,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:02:44,904 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:44,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:02:44,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:02:44,904 INFO L87 Difference]: Start difference. First operand 34631 states and 129245 transitions. Second operand 6 states. [2019-11-16 00:02:45,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:45,908 INFO L93 Difference]: Finished difference Result 45659 states and 166139 transitions. [2019-11-16 00:02:45,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:02:45,910 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 50 [2019-11-16 00:02:45,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:46,038 INFO L225 Difference]: With dead ends: 45659 [2019-11-16 00:02:46,039 INFO L226 Difference]: Without dead ends: 45515 [2019-11-16 00:02:46,039 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:02:46,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45515 states. [2019-11-16 00:02:46,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45515 to 33594. [2019-11-16 00:02:46,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33594 states. [2019-11-16 00:02:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33594 states to 33594 states and 125400 transitions. [2019-11-16 00:02:47,695 INFO L78 Accepts]: Start accepts. Automaton has 33594 states and 125400 transitions. Word has length 50 [2019-11-16 00:02:47,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:47,695 INFO L462 AbstractCegarLoop]: Abstraction has 33594 states and 125400 transitions. [2019-11-16 00:02:47,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:02:47,696 INFO L276 IsEmpty]: Start isEmpty. Operand 33594 states and 125400 transitions. [2019-11-16 00:02:47,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-16 00:02:47,729 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:47,729 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] [2019-11-16 00:02:47,729 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:47,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:47,730 INFO L82 PathProgramCache]: Analyzing trace with hash 2101076912, now seen corresponding path program 1 times [2019-11-16 00:02:47,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:47,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114685890] [2019-11-16 00:02:47,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:47,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:47,731 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:47,786 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-16 00:02:47,788 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114685890] [2019-11-16 00:02:47,789 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:47,789 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:02:47,789 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551495436] [2019-11-16 00:02:47,790 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:02:47,790 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:47,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:02:47,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:02:47,791 INFO L87 Difference]: Start difference. First operand 33594 states and 125400 transitions. Second operand 3 states. [2019-11-16 00:02:48,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:48,054 INFO L93 Difference]: Finished difference Result 36895 states and 137091 transitions. [2019-11-16 00:02:48,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:02:48,054 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-11-16 00:02:48,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:48,136 INFO L225 Difference]: With dead ends: 36895 [2019-11-16 00:02:48,136 INFO L226 Difference]: Without dead ends: 36895 [2019-11-16 00:02:48,137 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-16 00:02:48,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36895 states. [2019-11-16 00:02:48,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36895 to 36301. [2019-11-16 00:02:48,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36301 states. [2019-11-16 00:02:48,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36301 states to 36301 states and 135069 transitions. [2019-11-16 00:02:48,855 INFO L78 Accepts]: Start accepts. Automaton has 36301 states and 135069 transitions. Word has length 57 [2019-11-16 00:02:48,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:48,855 INFO L462 AbstractCegarLoop]: Abstraction has 36301 states and 135069 transitions. [2019-11-16 00:02:48,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:02:48,856 INFO L276 IsEmpty]: Start isEmpty. Operand 36301 states and 135069 transitions. [2019-11-16 00:02:48,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-11-16 00:02:48,887 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:48,887 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] [2019-11-16 00:02:48,888 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:48,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:48,888 INFO L82 PathProgramCache]: Analyzing trace with hash 747767215, now seen corresponding path program 1 times [2019-11-16 00:02:48,888 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:48,889 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088991079] [2019-11-16 00:02:48,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:48,889 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:48,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:48,979 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-16 00:02:48,979 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088991079] [2019-11-16 00:02:48,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:48,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:02:48,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789495998] [2019-11-16 00:02:48,980 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:02:48,980 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:48,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:02:48,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:02:48,981 INFO L87 Difference]: Start difference. First operand 36301 states and 135069 transitions. Second operand 6 states. [2019-11-16 00:02:50,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:50,105 INFO L93 Difference]: Finished difference Result 49087 states and 178537 transitions. [2019-11-16 00:02:50,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:02:50,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 57 [2019-11-16 00:02:50,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:50,194 INFO L225 Difference]: With dead ends: 49087 [2019-11-16 00:02:50,194 INFO L226 Difference]: Without dead ends: 48847 [2019-11-16 00:02:50,194 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:02:50,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48847 states. [2019-11-16 00:02:50,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48847 to 42913. [2019-11-16 00:02:50,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42913 states. [2019-11-16 00:02:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42913 states to 42913 states and 157817 transitions. [2019-11-16 00:02:50,947 INFO L78 Accepts]: Start accepts. Automaton has 42913 states and 157817 transitions. Word has length 57 [2019-11-16 00:02:50,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:50,948 INFO L462 AbstractCegarLoop]: Abstraction has 42913 states and 157817 transitions. [2019-11-16 00:02:50,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:02:50,948 INFO L276 IsEmpty]: Start isEmpty. Operand 42913 states and 157817 transitions. [2019-11-16 00:02:50,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-11-16 00:02:50,977 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:50,977 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] [2019-11-16 00:02:50,977 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:50,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:50,977 INFO L82 PathProgramCache]: Analyzing trace with hash -1861127999, now seen corresponding path program 1 times [2019-11-16 00:02:50,977 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:50,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168993264] [2019-11-16 00:02:50,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:50,978 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:50,978 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:51,022 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-16 00:02:51,022 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168993264] [2019-11-16 00:02:51,023 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:51,023 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:02:51,023 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967322282] [2019-11-16 00:02:51,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:02:51,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:51,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:02:51,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:02:51,024 INFO L87 Difference]: Start difference. First operand 42913 states and 157817 transitions. Second operand 3 states. [2019-11-16 00:02:51,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:51,266 INFO L93 Difference]: Finished difference Result 53211 states and 192652 transitions. [2019-11-16 00:02:51,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:02:51,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-11-16 00:02:51,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:51,372 INFO L225 Difference]: With dead ends: 53211 [2019-11-16 00:02:51,372 INFO L226 Difference]: Without dead ends: 53211 [2019-11-16 00:02:51,373 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-16 00:02:51,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53211 states. [2019-11-16 00:02:52,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53211 to 46771. [2019-11-16 00:02:52,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46771 states. [2019-11-16 00:02:52,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46771 states to 46771 states and 171039 transitions. [2019-11-16 00:02:52,555 INFO L78 Accepts]: Start accepts. Automaton has 46771 states and 171039 transitions. Word has length 59 [2019-11-16 00:02:52,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:52,556 INFO L462 AbstractCegarLoop]: Abstraction has 46771 states and 171039 transitions. [2019-11-16 00:02:52,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:02:52,556 INFO L276 IsEmpty]: Start isEmpty. Operand 46771 states and 171039 transitions. [2019-11-16 00:02:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-16 00:02:52,593 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:52,593 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] [2019-11-16 00:02:52,593 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:52,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:52,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1336008671, now seen corresponding path program 1 times [2019-11-16 00:02:52,594 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:52,594 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889239492] [2019-11-16 00:02:52,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:52,595 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:52,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:52,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:52,702 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-16 00:02:52,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889239492] [2019-11-16 00:02:52,704 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:52,704 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:02:52,704 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990259565] [2019-11-16 00:02:52,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:02:52,706 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:52,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:02:52,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:02:52,706 INFO L87 Difference]: Start difference. First operand 46771 states and 171039 transitions. Second operand 7 states. [2019-11-16 00:02:53,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:53,589 INFO L93 Difference]: Finished difference Result 58902 states and 211200 transitions. [2019-11-16 00:02:53,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:02:53,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2019-11-16 00:02:53,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:53,708 INFO L225 Difference]: With dead ends: 58902 [2019-11-16 00:02:53,708 INFO L226 Difference]: Without dead ends: 58662 [2019-11-16 00:02:53,709 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=289, Unknown=0, NotChecked=0, Total=380 [2019-11-16 00:02:53,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58662 states. [2019-11-16 00:02:54,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58662 to 48069. [2019-11-16 00:02:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48069 states. [2019-11-16 00:02:55,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48069 states to 48069 states and 175422 transitions. [2019-11-16 00:02:55,239 INFO L78 Accepts]: Start accepts. Automaton has 48069 states and 175422 transitions. Word has length 63 [2019-11-16 00:02:55,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:55,239 INFO L462 AbstractCegarLoop]: Abstraction has 48069 states and 175422 transitions. [2019-11-16 00:02:55,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:02:55,239 INFO L276 IsEmpty]: Start isEmpty. Operand 48069 states and 175422 transitions. [2019-11-16 00:02:55,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-16 00:02:55,268 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:55,268 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-16 00:02:55,268 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:55,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:55,268 INFO L82 PathProgramCache]: Analyzing trace with hash -401202828, now seen corresponding path program 1 times [2019-11-16 00:02:55,269 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:55,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100918154] [2019-11-16 00:02:55,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:55,269 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:55,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:55,389 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-16 00:02:55,390 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100918154] [2019-11-16 00:02:55,390 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:55,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:02:55,391 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098628415] [2019-11-16 00:02:55,391 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:02:55,391 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:55,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:02:55,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:02:55,392 INFO L87 Difference]: Start difference. First operand 48069 states and 175422 transitions. Second operand 7 states. [2019-11-16 00:02:56,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:56,581 INFO L93 Difference]: Finished difference Result 58053 states and 208166 transitions. [2019-11-16 00:02:56,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-16 00:02:56,581 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-11-16 00:02:56,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:56,697 INFO L225 Difference]: With dead ends: 58053 [2019-11-16 00:02:56,697 INFO L226 Difference]: Without dead ends: 57853 [2019-11-16 00:02:56,698 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=356, Unknown=0, NotChecked=0, Total=462 [2019-11-16 00:02:56,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57853 states. [2019-11-16 00:02:57,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57853 to 48947. [2019-11-16 00:02:57,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48947 states. [2019-11-16 00:02:57,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48947 states to 48947 states and 178293 transitions. [2019-11-16 00:02:57,582 INFO L78 Accepts]: Start accepts. Automaton has 48947 states and 178293 transitions. Word has length 64 [2019-11-16 00:02:57,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:02:57,583 INFO L462 AbstractCegarLoop]: Abstraction has 48947 states and 178293 transitions. [2019-11-16 00:02:57,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:02:57,583 INFO L276 IsEmpty]: Start isEmpty. Operand 48947 states and 178293 transitions. [2019-11-16 00:02:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:02:57,624 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:02:57,624 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-16 00:02:57,624 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:02:57,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:02:57,625 INFO L82 PathProgramCache]: Analyzing trace with hash -182823054, now seen corresponding path program 1 times [2019-11-16 00:02:57,625 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:02:57,625 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994228902] [2019-11-16 00:02:57,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:57,625 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:02:57,626 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:02:57,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:02:57,769 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-16 00:02:57,769 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994228902] [2019-11-16 00:02:57,770 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:02:57,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:02:57,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714835106] [2019-11-16 00:02:57,770 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:02:57,771 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:02:57,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:02:57,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:02:57,771 INFO L87 Difference]: Start difference. First operand 48947 states and 178293 transitions. Second operand 7 states. [2019-11-16 00:02:58,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:02:58,597 INFO L93 Difference]: Finished difference Result 78799 states and 276302 transitions. [2019-11-16 00:02:58,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:02:58,598 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-11-16 00:02:58,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:02:58,750 INFO L225 Difference]: With dead ends: 78799 [2019-11-16 00:02:58,750 INFO L226 Difference]: Without dead ends: 78799 [2019-11-16 00:02:58,751 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-11-16 00:02:59,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78799 states. [2019-11-16 00:03:00,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78799 to 71293. [2019-11-16 00:03:00,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71293 states. [2019-11-16 00:03:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71293 states to 71293 states and 252134 transitions. [2019-11-16 00:03:00,540 INFO L78 Accepts]: Start accepts. Automaton has 71293 states and 252134 transitions. Word has length 66 [2019-11-16 00:03:00,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:00,540 INFO L462 AbstractCegarLoop]: Abstraction has 71293 states and 252134 transitions. [2019-11-16 00:03:00,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:03:00,541 INFO L276 IsEmpty]: Start isEmpty. Operand 71293 states and 252134 transitions. [2019-11-16 00:03:00,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-16 00:03:00,610 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:00,610 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-16 00:03:00,611 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:00,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:00,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1061941427, now seen corresponding path program 1 times [2019-11-16 00:03:00,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:00,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155025260] [2019-11-16 00:03:00,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:00,612 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:00,612 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:00,716 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-16 00:03:00,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155025260] [2019-11-16 00:03:00,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:00,717 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:03:00,717 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472229495] [2019-11-16 00:03:00,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:03:00,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:00,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:03:00,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:00,718 INFO L87 Difference]: Start difference. First operand 71293 states and 252134 transitions. Second operand 4 states. [2019-11-16 00:03:00,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:00,808 INFO L93 Difference]: Finished difference Result 15853 states and 50021 transitions. [2019-11-16 00:03:00,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:03:00,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-11-16 00:03:00,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:00,838 INFO L225 Difference]: With dead ends: 15853 [2019-11-16 00:03:00,838 INFO L226 Difference]: Without dead ends: 15375 [2019-11-16 00:03:00,839 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-16 00:03:00,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15375 states. [2019-11-16 00:03:01,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15375 to 15363. [2019-11-16 00:03:01,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15363 states. [2019-11-16 00:03:01,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15363 states to 15363 states and 48516 transitions. [2019-11-16 00:03:01,049 INFO L78 Accepts]: Start accepts. Automaton has 15363 states and 48516 transitions. Word has length 66 [2019-11-16 00:03:01,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:01,049 INFO L462 AbstractCegarLoop]: Abstraction has 15363 states and 48516 transitions. [2019-11-16 00:03:01,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:03:01,050 INFO L276 IsEmpty]: Start isEmpty. Operand 15363 states and 48516 transitions. [2019-11-16 00:03:01,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-16 00:03:01,060 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:01,060 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] [2019-11-16 00:03:01,060 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:01,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:01,061 INFO L82 PathProgramCache]: Analyzing trace with hash 300629220, now seen corresponding path program 1 times [2019-11-16 00:03:01,061 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:01,061 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114338499] [2019-11-16 00:03:01,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:01,061 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:01,061 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:01,131 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-16 00:03:01,131 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114338499] [2019-11-16 00:03:01,131 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:01,132 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:03:01,132 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664445700] [2019-11-16 00:03:01,132 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:03:01,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:01,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:03:01,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:01,133 INFO L87 Difference]: Start difference. First operand 15363 states and 48516 transitions. Second operand 4 states. [2019-11-16 00:03:01,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:01,345 INFO L93 Difference]: Finished difference Result 20070 states and 62647 transitions. [2019-11-16 00:03:01,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:03:01,345 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 76 [2019-11-16 00:03:01,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:01,372 INFO L225 Difference]: With dead ends: 20070 [2019-11-16 00:03:01,372 INFO L226 Difference]: Without dead ends: 20070 [2019-11-16 00:03:01,372 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:01,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20070 states. [2019-11-16 00:03:01,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20070 to 16200. [2019-11-16 00:03:01,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16200 states. [2019-11-16 00:03:01,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16200 states to 16200 states and 50965 transitions. [2019-11-16 00:03:01,596 INFO L78 Accepts]: Start accepts. Automaton has 16200 states and 50965 transitions. Word has length 76 [2019-11-16 00:03:01,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:01,596 INFO L462 AbstractCegarLoop]: Abstraction has 16200 states and 50965 transitions. [2019-11-16 00:03:01,596 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:03:01,596 INFO L276 IsEmpty]: Start isEmpty. Operand 16200 states and 50965 transitions. [2019-11-16 00:03:01,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-11-16 00:03:01,610 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:01,611 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] [2019-11-16 00:03:01,611 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:01,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:01,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1290657156, now seen corresponding path program 1 times [2019-11-16 00:03:01,611 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:01,611 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294048455] [2019-11-16 00:03:01,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:01,611 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:01,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:01,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:01,701 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-16 00:03:01,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294048455] [2019-11-16 00:03:01,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:01,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-16 00:03:01,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895920762] [2019-11-16 00:03:01,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-16 00:03:01,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:01,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-16 00:03:01,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:03:01,703 INFO L87 Difference]: Start difference. First operand 16200 states and 50965 transitions. Second operand 8 states. [2019-11-16 00:03:02,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:02,885 INFO L93 Difference]: Finished difference Result 18348 states and 57194 transitions. [2019-11-16 00:03:02,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-11-16 00:03:02,886 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 76 [2019-11-16 00:03:02,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:02,920 INFO L225 Difference]: With dead ends: 18348 [2019-11-16 00:03:02,920 INFO L226 Difference]: Without dead ends: 18300 [2019-11-16 00:03:02,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=591, Unknown=0, NotChecked=0, Total=756 [2019-11-16 00:03:02,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18300 states. [2019-11-16 00:03:03,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18300 to 14079. [2019-11-16 00:03:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14079 states. [2019-11-16 00:03:03,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14079 states to 14079 states and 44586 transitions. [2019-11-16 00:03:03,173 INFO L78 Accepts]: Start accepts. Automaton has 14079 states and 44586 transitions. Word has length 76 [2019-11-16 00:03:03,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:03,173 INFO L462 AbstractCegarLoop]: Abstraction has 14079 states and 44586 transitions. [2019-11-16 00:03:03,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-16 00:03:03,173 INFO L276 IsEmpty]: Start isEmpty. Operand 14079 states and 44586 transitions. [2019-11-16 00:03:03,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-11-16 00:03:03,183 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:03,183 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] [2019-11-16 00:03:03,183 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:03,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:03,184 INFO L82 PathProgramCache]: Analyzing trace with hash -91760962, now seen corresponding path program 1 times [2019-11-16 00:03:03,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:03,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223826459] [2019-11-16 00:03:03,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:03,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:03,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:03,227 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-16 00:03:03,227 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223826459] [2019-11-16 00:03:03,227 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:03,227 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:03:03,227 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853801106] [2019-11-16 00:03:03,227 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:03,228 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:03,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:03,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:03,228 INFO L87 Difference]: Start difference. First operand 14079 states and 44586 transitions. Second operand 3 states. [2019-11-16 00:03:03,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:03,419 INFO L93 Difference]: Finished difference Result 15115 states and 47655 transitions. [2019-11-16 00:03:03,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:03,420 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 77 [2019-11-16 00:03:03,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:03,440 INFO L225 Difference]: With dead ends: 15115 [2019-11-16 00:03:03,440 INFO L226 Difference]: Without dead ends: 15115 [2019-11-16 00:03:03,441 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-16 00:03:03,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15115 states. [2019-11-16 00:03:03,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15115 to 14581. [2019-11-16 00:03:03,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14581 states. [2019-11-16 00:03:03,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14581 states to 14581 states and 46078 transitions. [2019-11-16 00:03:03,626 INFO L78 Accepts]: Start accepts. Automaton has 14581 states and 46078 transitions. Word has length 77 [2019-11-16 00:03:03,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:03,626 INFO L462 AbstractCegarLoop]: Abstraction has 14581 states and 46078 transitions. [2019-11-16 00:03:03,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:03,626 INFO L276 IsEmpty]: Start isEmpty. Operand 14581 states and 46078 transitions. [2019-11-16 00:03:03,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-16 00:03:03,637 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:03,637 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] [2019-11-16 00:03:03,637 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:03,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:03,638 INFO L82 PathProgramCache]: Analyzing trace with hash 2098836392, now seen corresponding path program 1 times [2019-11-16 00:03:03,638 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:03,638 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136232372] [2019-11-16 00:03:03,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:03,638 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:03,638 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:03,693 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-16 00:03:03,693 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136232372] [2019-11-16 00:03:03,693 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:03,694 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:03:03,694 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485190296] [2019-11-16 00:03:03,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:03:03,694 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:03,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:03:03,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:03,695 INFO L87 Difference]: Start difference. First operand 14581 states and 46078 transitions. Second operand 4 states. [2019-11-16 00:03:04,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:04,156 INFO L93 Difference]: Finished difference Result 17952 states and 55817 transitions. [2019-11-16 00:03:04,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-16 00:03:04,156 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 78 [2019-11-16 00:03:04,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:04,186 INFO L225 Difference]: With dead ends: 17952 [2019-11-16 00:03:04,187 INFO L226 Difference]: Without dead ends: 17952 [2019-11-16 00:03:04,190 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-16 00:03:04,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17952 states. [2019-11-16 00:03:04,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17952 to 16884. [2019-11-16 00:03:04,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16884 states. [2019-11-16 00:03:04,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16884 states to 16884 states and 52804 transitions. [2019-11-16 00:03:04,413 INFO L78 Accepts]: Start accepts. Automaton has 16884 states and 52804 transitions. Word has length 78 [2019-11-16 00:03:04,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:04,414 INFO L462 AbstractCegarLoop]: Abstraction has 16884 states and 52804 transitions. [2019-11-16 00:03:04,414 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:03:04,414 INFO L276 IsEmpty]: Start isEmpty. Operand 16884 states and 52804 transitions. [2019-11-16 00:03:04,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-16 00:03:04,428 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:04,428 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] [2019-11-16 00:03:04,428 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:04,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:04,429 INFO L82 PathProgramCache]: Analyzing trace with hash 163176105, now seen corresponding path program 1 times [2019-11-16 00:03:04,429 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:04,429 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485434762] [2019-11-16 00:03:04,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:04,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:04,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:04,479 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:04,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485434762] [2019-11-16 00:03:04,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:04,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-16 00:03:04,486 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108616745] [2019-11-16 00:03:04,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-16 00:03:04,487 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:04,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-16 00:03:04,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-16 00:03:04,491 INFO L87 Difference]: Start difference. First operand 16884 states and 52804 transitions. Second operand 3 states. [2019-11-16 00:03:04,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:04,742 INFO L93 Difference]: Finished difference Result 17987 states and 56059 transitions. [2019-11-16 00:03:04,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-16 00:03:04,742 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-16 00:03:04,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:04,766 INFO L225 Difference]: With dead ends: 17987 [2019-11-16 00:03:04,766 INFO L226 Difference]: Without dead ends: 17987 [2019-11-16 00:03:04,766 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-16 00:03:04,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17987 states. [2019-11-16 00:03:04,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17987 to 17442. [2019-11-16 00:03:04,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17442 states. [2019-11-16 00:03:04,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17442 states to 17442 states and 54446 transitions. [2019-11-16 00:03:04,983 INFO L78 Accepts]: Start accepts. Automaton has 17442 states and 54446 transitions. Word has length 78 [2019-11-16 00:03:04,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:04,983 INFO L462 AbstractCegarLoop]: Abstraction has 17442 states and 54446 transitions. [2019-11-16 00:03:04,983 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-16 00:03:04,984 INFO L276 IsEmpty]: Start isEmpty. Operand 17442 states and 54446 transitions. [2019-11-16 00:03:04,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-16 00:03:04,998 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:04,998 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] [2019-11-16 00:03:04,998 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:04,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:04,999 INFO L82 PathProgramCache]: Analyzing trace with hash 452490126, now seen corresponding path program 1 times [2019-11-16 00:03:04,999 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:04,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361864253] [2019-11-16 00:03:04,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:04,999 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:04,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:05,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:05,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-16 00:03:05,059 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361864253] [2019-11-16 00:03:05,059 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:05,060 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:03:05,060 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910543154] [2019-11-16 00:03:05,060 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:03:05,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:05,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:03:05,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:05,061 INFO L87 Difference]: Start difference. First operand 17442 states and 54446 transitions. Second operand 4 states. [2019-11-16 00:03:05,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:05,424 INFO L93 Difference]: Finished difference Result 28784 states and 89522 transitions. [2019-11-16 00:03:05,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:03:05,425 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 79 [2019-11-16 00:03:05,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:05,466 INFO L225 Difference]: With dead ends: 28784 [2019-11-16 00:03:05,466 INFO L226 Difference]: Without dead ends: 28784 [2019-11-16 00:03:05,466 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-16 00:03:05,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28784 states. [2019-11-16 00:03:05,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28784 to 16157. [2019-11-16 00:03:05,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16157 states. [2019-11-16 00:03:05,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16157 states to 16157 states and 49908 transitions. [2019-11-16 00:03:05,732 INFO L78 Accepts]: Start accepts. Automaton has 16157 states and 49908 transitions. Word has length 79 [2019-11-16 00:03:05,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:05,732 INFO L462 AbstractCegarLoop]: Abstraction has 16157 states and 49908 transitions. [2019-11-16 00:03:05,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:03:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 16157 states and 49908 transitions. [2019-11-16 00:03:05,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-16 00:03:05,746 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:05,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] [2019-11-16 00:03:05,746 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:05,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:05,746 INFO L82 PathProgramCache]: Analyzing trace with hash 782255887, now seen corresponding path program 1 times [2019-11-16 00:03:05,746 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:05,746 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176405479] [2019-11-16 00:03:05,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:05,746 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:05,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:05,803 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-16 00:03:05,803 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176405479] [2019-11-16 00:03:05,804 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:05,804 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:03:05,804 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332340721] [2019-11-16 00:03:05,804 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:03:05,805 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:05,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:03:05,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:05,805 INFO L87 Difference]: Start difference. First operand 16157 states and 49908 transitions. Second operand 5 states. [2019-11-16 00:03:06,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:06,579 INFO L93 Difference]: Finished difference Result 33616 states and 102443 transitions. [2019-11-16 00:03:06,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:03:06,579 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-11-16 00:03:06,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:06,626 INFO L225 Difference]: With dead ends: 33616 [2019-11-16 00:03:06,626 INFO L226 Difference]: Without dead ends: 33616 [2019-11-16 00:03:06,626 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 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-16 00:03:06,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33616 states. [2019-11-16 00:03:06,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33616 to 18628. [2019-11-16 00:03:06,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18628 states. [2019-11-16 00:03:06,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18628 states to 18628 states and 57315 transitions. [2019-11-16 00:03:06,939 INFO L78 Accepts]: Start accepts. Automaton has 18628 states and 57315 transitions. Word has length 79 [2019-11-16 00:03:06,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:06,939 INFO L462 AbstractCegarLoop]: Abstraction has 18628 states and 57315 transitions. [2019-11-16 00:03:06,939 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:03:06,940 INFO L276 IsEmpty]: Start isEmpty. Operand 18628 states and 57315 transitions. [2019-11-16 00:03:06,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-16 00:03:06,954 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:06,954 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] [2019-11-16 00:03:06,954 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:06,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:06,955 INFO L82 PathProgramCache]: Analyzing trace with hash -140427696, now seen corresponding path program 1 times [2019-11-16 00:03:06,955 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:06,955 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976528780] [2019-11-16 00:03:06,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:06,955 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:06,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:07,038 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-16 00:03:07,038 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976528780] [2019-11-16 00:03:07,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:07,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:03:07,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173352257] [2019-11-16 00:03:07,039 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:03:07,040 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:07,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:03:07,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:03:07,040 INFO L87 Difference]: Start difference. First operand 18628 states and 57315 transitions. Second operand 7 states. [2019-11-16 00:03:07,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:07,933 INFO L93 Difference]: Finished difference Result 33280 states and 101204 transitions. [2019-11-16 00:03:07,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-16 00:03:07,933 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 79 [2019-11-16 00:03:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:07,978 INFO L225 Difference]: With dead ends: 33280 [2019-11-16 00:03:07,979 INFO L226 Difference]: Without dead ends: 33280 [2019-11-16 00:03:07,979 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2019-11-16 00:03:08,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33280 states. [2019-11-16 00:03:08,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33280 to 21892. [2019-11-16 00:03:08,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21892 states. [2019-11-16 00:03:08,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21892 states to 21892 states and 67118 transitions. [2019-11-16 00:03:08,324 INFO L78 Accepts]: Start accepts. Automaton has 21892 states and 67118 transitions. Word has length 79 [2019-11-16 00:03:08,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:08,324 INFO L462 AbstractCegarLoop]: Abstraction has 21892 states and 67118 transitions. [2019-11-16 00:03:08,324 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:03:08,324 INFO L276 IsEmpty]: Start isEmpty. Operand 21892 states and 67118 transitions. [2019-11-16 00:03:08,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-16 00:03:08,341 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:08,341 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] [2019-11-16 00:03:08,341 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:08,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:08,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1104336785, now seen corresponding path program 1 times [2019-11-16 00:03:08,342 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:08,342 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605285880] [2019-11-16 00:03:08,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,342 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:08,409 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-16 00:03:08,409 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605285880] [2019-11-16 00:03:08,410 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:08,410 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:03:08,410 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336485945] [2019-11-16 00:03:08,410 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:03:08,410 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:08,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:03:08,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:08,411 INFO L87 Difference]: Start difference. First operand 21892 states and 67118 transitions. Second operand 5 states. [2019-11-16 00:03:08,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:08,463 INFO L93 Difference]: Finished difference Result 4171 states and 10139 transitions. [2019-11-16 00:03:08,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:03:08,464 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 79 [2019-11-16 00:03:08,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:08,468 INFO L225 Difference]: With dead ends: 4171 [2019-11-16 00:03:08,468 INFO L226 Difference]: Without dead ends: 3346 [2019-11-16 00:03:08,468 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-16 00:03:08,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2019-11-16 00:03:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2598. [2019-11-16 00:03:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2598 states. [2019-11-16 00:03:08,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2598 states to 2598 states and 6364 transitions. [2019-11-16 00:03:08,506 INFO L78 Accepts]: Start accepts. Automaton has 2598 states and 6364 transitions. Word has length 79 [2019-11-16 00:03:08,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:08,507 INFO L462 AbstractCegarLoop]: Abstraction has 2598 states and 6364 transitions. [2019-11-16 00:03:08,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:03:08,507 INFO L276 IsEmpty]: Start isEmpty. Operand 2598 states and 6364 transitions. [2019-11-16 00:03:08,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-16 00:03:08,510 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:08,510 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] [2019-11-16 00:03:08,510 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:08,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:08,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1234609342, now seen corresponding path program 1 times [2019-11-16 00:03:08,511 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:08,511 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710389893] [2019-11-16 00:03:08,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,511 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:08,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:08,610 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-16 00:03:08,610 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710389893] [2019-11-16 00:03:08,610 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:08,611 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:03:08,611 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912835025] [2019-11-16 00:03:08,612 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:03:08,614 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:08,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:03:08,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:03:08,615 INFO L87 Difference]: Start difference. First operand 2598 states and 6364 transitions. Second operand 6 states. [2019-11-16 00:03:08,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:08,732 INFO L93 Difference]: Finished difference Result 2927 states and 6970 transitions. [2019-11-16 00:03:08,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:03:08,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-11-16 00:03:08,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:08,736 INFO L225 Difference]: With dead ends: 2927 [2019-11-16 00:03:08,737 INFO L226 Difference]: Without dead ends: 2873 [2019-11-16 00:03:08,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:03:08,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2873 states. [2019-11-16 00:03:08,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2873 to 2617. [2019-11-16 00:03:08,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2617 states. [2019-11-16 00:03:08,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2617 states to 2617 states and 6337 transitions. [2019-11-16 00:03:08,772 INFO L78 Accepts]: Start accepts. Automaton has 2617 states and 6337 transitions. Word has length 91 [2019-11-16 00:03:08,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:08,772 INFO L462 AbstractCegarLoop]: Abstraction has 2617 states and 6337 transitions. [2019-11-16 00:03:08,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:03:08,773 INFO L276 IsEmpty]: Start isEmpty. Operand 2617 states and 6337 transitions. [2019-11-16 00:03:08,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-16 00:03:08,776 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:08,777 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] [2019-11-16 00:03:08,777 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:08,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:08,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1641017947, now seen corresponding path program 1 times [2019-11-16 00:03:08,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:08,778 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511501678] [2019-11-16 00:03:08,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,778 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,778 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:08,838 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-16 00:03:08,839 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511501678] [2019-11-16 00:03:08,839 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:08,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-16 00:03:08,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985494212] [2019-11-16 00:03:08,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-16 00:03:08,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:08,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-16 00:03:08,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-16 00:03:08,841 INFO L87 Difference]: Start difference. First operand 2617 states and 6337 transitions. Second operand 4 states. [2019-11-16 00:03:08,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:08,874 INFO L93 Difference]: Finished difference Result 2547 states and 6136 transitions. [2019-11-16 00:03:08,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-16 00:03:08,874 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-11-16 00:03:08,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:08,877 INFO L225 Difference]: With dead ends: 2547 [2019-11-16 00:03:08,878 INFO L226 Difference]: Without dead ends: 2547 [2019-11-16 00:03:08,879 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2547 states. [2019-11-16 00:03:08,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2547 to 2351. [2019-11-16 00:03:08,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2351 states. [2019-11-16 00:03:08,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2351 states to 2351 states and 5681 transitions. [2019-11-16 00:03:08,910 INFO L78 Accepts]: Start accepts. Automaton has 2351 states and 5681 transitions. Word has length 91 [2019-11-16 00:03:08,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:08,910 INFO L462 AbstractCegarLoop]: Abstraction has 2351 states and 5681 transitions. [2019-11-16 00:03:08,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-16 00:03:08,911 INFO L276 IsEmpty]: Start isEmpty. Operand 2351 states and 5681 transitions. [2019-11-16 00:03:08,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-16 00:03:08,913 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:08,914 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] [2019-11-16 00:03:08,914 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:08,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:08,914 INFO L82 PathProgramCache]: Analyzing trace with hash -222788327, now seen corresponding path program 1 times [2019-11-16 00:03:08,914 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:08,915 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984452475] [2019-11-16 00:03:08,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,915 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:08,915 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:08,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:08,980 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-16 00:03:08,980 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984452475] [2019-11-16 00:03:08,980 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:08,980 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:03:08,980 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657328847] [2019-11-16 00:03:08,981 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:03:08,981 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:08,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:03:08,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:08,982 INFO L87 Difference]: Start difference. First operand 2351 states and 5681 transitions. Second operand 5 states. [2019-11-16 00:03:09,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:09,225 INFO L93 Difference]: Finished difference Result 2739 states and 6538 transitions. [2019-11-16 00:03:09,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:03:09,226 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 91 [2019-11-16 00:03:09,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:09,228 INFO L225 Difference]: With dead ends: 2739 [2019-11-16 00:03:09,228 INFO L226 Difference]: Without dead ends: 2717 [2019-11-16 00:03:09,228 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:03:09,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2717 states. [2019-11-16 00:03:09,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2717 to 2398. [2019-11-16 00:03:09,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2398 states. [2019-11-16 00:03:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2398 states to 2398 states and 5775 transitions. [2019-11-16 00:03:09,250 INFO L78 Accepts]: Start accepts. Automaton has 2398 states and 5775 transitions. Word has length 91 [2019-11-16 00:03:09,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:09,250 INFO L462 AbstractCegarLoop]: Abstraction has 2398 states and 5775 transitions. [2019-11-16 00:03:09,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:03:09,251 INFO L276 IsEmpty]: Start isEmpty. Operand 2398 states and 5775 transitions. [2019-11-16 00:03:09,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-16 00:03:09,252 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:09,252 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] [2019-11-16 00:03:09,253 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:09,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:09,253 INFO L82 PathProgramCache]: Analyzing trace with hash 712926340, now seen corresponding path program 1 times [2019-11-16 00:03:09,253 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:09,253 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535645309] [2019-11-16 00:03:09,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:09,254 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:09,254 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:09,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:09,340 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-16 00:03:09,341 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535645309] [2019-11-16 00:03:09,341 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:09,341 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:03:09,341 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213783846] [2019-11-16 00:03:09,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:03:09,342 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:09,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:03:09,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:03:09,343 INFO L87 Difference]: Start difference. First operand 2398 states and 5775 transitions. Second operand 7 states. [2019-11-16 00:03:09,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:09,725 INFO L93 Difference]: Finished difference Result 4735 states and 11665 transitions. [2019-11-16 00:03:09,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-16 00:03:09,725 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 91 [2019-11-16 00:03:09,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:09,730 INFO L225 Difference]: With dead ends: 4735 [2019-11-16 00:03:09,730 INFO L226 Difference]: Without dead ends: 4735 [2019-11-16 00:03:09,731 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:03:09,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4735 states. [2019-11-16 00:03:09,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4735 to 2470. [2019-11-16 00:03:09,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2470 states. [2019-11-16 00:03:09,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 5945 transitions. [2019-11-16 00:03:09,772 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 5945 transitions. Word has length 91 [2019-11-16 00:03:09,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:09,772 INFO L462 AbstractCegarLoop]: Abstraction has 2470 states and 5945 transitions. [2019-11-16 00:03:09,772 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:03:09,772 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 5945 transitions. [2019-11-16 00:03:09,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-16 00:03:09,775 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:09,775 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] [2019-11-16 00:03:09,775 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:09,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:09,776 INFO L82 PathProgramCache]: Analyzing trace with hash 1957690821, now seen corresponding path program 2 times [2019-11-16 00:03:09,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:09,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898351512] [2019-11-16 00:03:09,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:09,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:09,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:09,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:09,879 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-16 00:03:09,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898351512] [2019-11-16 00:03:09,880 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:09,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:03:09,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301429586] [2019-11-16 00:03:09,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:03:09,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:09,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:03:09,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:03:09,881 INFO L87 Difference]: Start difference. First operand 2470 states and 5945 transitions. Second operand 6 states. [2019-11-16 00:03:09,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:09,942 INFO L93 Difference]: Finished difference Result 3946 states and 9690 transitions. [2019-11-16 00:03:09,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-16 00:03:09,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-11-16 00:03:09,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:09,948 INFO L225 Difference]: With dead ends: 3946 [2019-11-16 00:03:09,949 INFO L226 Difference]: Without dead ends: 3946 [2019-11-16 00:03:09,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:03:09,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3946 states. [2019-11-16 00:03:09,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3946 to 2482. [2019-11-16 00:03:09,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2482 states. [2019-11-16 00:03:10,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2482 states to 2482 states and 5939 transitions. [2019-11-16 00:03:10,000 INFO L78 Accepts]: Start accepts. Automaton has 2482 states and 5939 transitions. Word has length 91 [2019-11-16 00:03:10,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:10,000 INFO L462 AbstractCegarLoop]: Abstraction has 2482 states and 5939 transitions. [2019-11-16 00:03:10,001 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:03:10,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2482 states and 5939 transitions. [2019-11-16 00:03:10,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-11-16 00:03:10,004 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:10,005 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] [2019-11-16 00:03:10,005 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:10,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:10,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1856560059, now seen corresponding path program 1 times [2019-11-16 00:03:10,006 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:10,006 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043169290] [2019-11-16 00:03:10,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:10,006 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:10,006 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:10,124 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:10,124 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043169290] [2019-11-16 00:03:10,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:10,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:03:10,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524254656] [2019-11-16 00:03:10,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:03:10,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:10,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:03:10,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:03:10,127 INFO L87 Difference]: Start difference. First operand 2482 states and 5939 transitions. Second operand 6 states. [2019-11-16 00:03:10,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:10,260 INFO L93 Difference]: Finished difference Result 2257 states and 5261 transitions. [2019-11-16 00:03:10,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:03:10,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 91 [2019-11-16 00:03:10,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:10,263 INFO L225 Difference]: With dead ends: 2257 [2019-11-16 00:03:10,263 INFO L226 Difference]: Without dead ends: 2257 [2019-11-16 00:03:10,263 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:03:10,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2019-11-16 00:03:10,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 1722. [2019-11-16 00:03:10,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1722 states. [2019-11-16 00:03:10,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1722 states to 1722 states and 4078 transitions. [2019-11-16 00:03:10,285 INFO L78 Accepts]: Start accepts. Automaton has 1722 states and 4078 transitions. Word has length 91 [2019-11-16 00:03:10,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:10,286 INFO L462 AbstractCegarLoop]: Abstraction has 1722 states and 4078 transitions. [2019-11-16 00:03:10,286 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:03:10,286 INFO L276 IsEmpty]: Start isEmpty. Operand 1722 states and 4078 transitions. [2019-11-16 00:03:10,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:03:10,288 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:10,288 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-16 00:03:10,288 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:10,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:10,288 INFO L82 PathProgramCache]: Analyzing trace with hash -1713583962, now seen corresponding path program 1 times [2019-11-16 00:03:10,289 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:10,289 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153126454] [2019-11-16 00:03:10,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:10,289 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:10,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:10,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:10,381 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-16 00:03:10,382 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153126454] [2019-11-16 00:03:10,382 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:10,382 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:03:10,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029228343] [2019-11-16 00:03:10,383 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:03:10,383 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:10,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:03:10,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:03:10,383 INFO L87 Difference]: Start difference. First operand 1722 states and 4078 transitions. Second operand 6 states. [2019-11-16 00:03:10,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:10,606 INFO L93 Difference]: Finished difference Result 2057 states and 4762 transitions. [2019-11-16 00:03:10,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:03:10,607 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-16 00:03:10,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:10,608 INFO L225 Difference]: With dead ends: 2057 [2019-11-16 00:03:10,609 INFO L226 Difference]: Without dead ends: 2057 [2019-11-16 00:03:10,609 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:03:10,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2057 states. [2019-11-16 00:03:10,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2057 to 1820. [2019-11-16 00:03:10,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1820 states. [2019-11-16 00:03:10,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1820 states to 1820 states and 4277 transitions. [2019-11-16 00:03:10,625 INFO L78 Accepts]: Start accepts. Automaton has 1820 states and 4277 transitions. Word has length 93 [2019-11-16 00:03:10,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:10,625 INFO L462 AbstractCegarLoop]: Abstraction has 1820 states and 4277 transitions. [2019-11-16 00:03:10,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:03:10,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1820 states and 4277 transitions. [2019-11-16 00:03:10,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:03:10,629 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:10,629 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-16 00:03:10,630 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:10,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:10,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1383818201, now seen corresponding path program 1 times [2019-11-16 00:03:10,631 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:10,631 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761727901] [2019-11-16 00:03:10,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:10,631 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:10,631 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:10,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:10,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:10,736 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761727901] [2019-11-16 00:03:10,736 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:10,736 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:03:10,736 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020695404] [2019-11-16 00:03:10,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:03:10,737 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:10,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:03:10,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:03:10,737 INFO L87 Difference]: Start difference. First operand 1820 states and 4277 transitions. Second operand 6 states. [2019-11-16 00:03:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:10,894 INFO L93 Difference]: Finished difference Result 2011 states and 4637 transitions. [2019-11-16 00:03:10,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-16 00:03:10,895 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-16 00:03:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:10,897 INFO L225 Difference]: With dead ends: 2011 [2019-11-16 00:03:10,898 INFO L226 Difference]: Without dead ends: 2011 [2019-11-16 00:03:10,898 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-11-16 00:03:10,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2011 states. [2019-11-16 00:03:10,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2011 to 1754. [2019-11-16 00:03:10,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1754 states. [2019-11-16 00:03:10,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1754 states to 1754 states and 4118 transitions. [2019-11-16 00:03:10,922 INFO L78 Accepts]: Start accepts. Automaton has 1754 states and 4118 transitions. Word has length 93 [2019-11-16 00:03:10,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:10,922 INFO L462 AbstractCegarLoop]: Abstraction has 1754 states and 4118 transitions. [2019-11-16 00:03:10,922 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:03:10,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1754 states and 4118 transitions. [2019-11-16 00:03:10,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:03:10,925 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:10,925 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-16 00:03:10,925 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:10,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:10,926 INFO L82 PathProgramCache]: Analyzing trace with hash 2132686695, now seen corresponding path program 1 times [2019-11-16 00:03:10,926 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:10,926 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773742860] [2019-11-16 00:03:10,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:10,926 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:10,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:10,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:11,018 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-16 00:03:11,019 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773742860] [2019-11-16 00:03:11,019 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:11,019 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:03:11,019 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307537945] [2019-11-16 00:03:11,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:03:11,020 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:11,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:03:11,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:03:11,021 INFO L87 Difference]: Start difference. First operand 1754 states and 4118 transitions. Second operand 7 states. [2019-11-16 00:03:11,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:11,589 INFO L93 Difference]: Finished difference Result 2919 states and 6743 transitions. [2019-11-16 00:03:11,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-11-16 00:03:11,590 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-11-16 00:03:11,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:11,593 INFO L225 Difference]: With dead ends: 2919 [2019-11-16 00:03:11,593 INFO L226 Difference]: Without dead ends: 2901 [2019-11-16 00:03:11,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2019-11-16 00:03:11,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2901 states. [2019-11-16 00:03:11,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2901 to 2340. [2019-11-16 00:03:11,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2340 states. [2019-11-16 00:03:11,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2340 states to 2340 states and 5487 transitions. [2019-11-16 00:03:11,628 INFO L78 Accepts]: Start accepts. Automaton has 2340 states and 5487 transitions. Word has length 93 [2019-11-16 00:03:11,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:11,628 INFO L462 AbstractCegarLoop]: Abstraction has 2340 states and 5487 transitions. [2019-11-16 00:03:11,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:03:11,629 INFO L276 IsEmpty]: Start isEmpty. Operand 2340 states and 5487 transitions. [2019-11-16 00:03:11,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:03:11,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:11,632 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-16 00:03:11,632 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:11,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:11,632 INFO L82 PathProgramCache]: Analyzing trace with hash -917516120, now seen corresponding path program 1 times [2019-11-16 00:03:11,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:11,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139601631] [2019-11-16 00:03:11,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:11,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:11,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:11,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:11,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139601631] [2019-11-16 00:03:11,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:11,744 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:03:11,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255953837] [2019-11-16 00:03:11,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:03:11,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:11,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:03:11,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:03:11,746 INFO L87 Difference]: Start difference. First operand 2340 states and 5487 transitions. Second operand 6 states. [2019-11-16 00:03:11,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:11,979 INFO L93 Difference]: Finished difference Result 2346 states and 5468 transitions. [2019-11-16 00:03:11,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:03:11,980 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-16 00:03:11,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:11,983 INFO L225 Difference]: With dead ends: 2346 [2019-11-16 00:03:11,983 INFO L226 Difference]: Without dead ends: 2346 [2019-11-16 00:03:11,984 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2019-11-16 00:03:11,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2346 states. [2019-11-16 00:03:12,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2346 to 2258. [2019-11-16 00:03:12,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2258 states. [2019-11-16 00:03:12,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2258 states to 2258 states and 5294 transitions. [2019-11-16 00:03:12,013 INFO L78 Accepts]: Start accepts. Automaton has 2258 states and 5294 transitions. Word has length 93 [2019-11-16 00:03:12,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:12,014 INFO L462 AbstractCegarLoop]: Abstraction has 2258 states and 5294 transitions. [2019-11-16 00:03:12,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:03:12,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2258 states and 5294 transitions. [2019-11-16 00:03:12,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:03:12,016 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:12,017 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-16 00:03:12,017 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:12,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:12,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1832514840, now seen corresponding path program 1 times [2019-11-16 00:03:12,018 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:12,018 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236116650] [2019-11-16 00:03:12,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,018 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:12,142 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-16 00:03:12,142 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236116650] [2019-11-16 00:03:12,143 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:12,143 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-16 00:03:12,143 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594513486] [2019-11-16 00:03:12,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-16 00:03:12,143 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:12,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-16 00:03:12,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-16 00:03:12,144 INFO L87 Difference]: Start difference. First operand 2258 states and 5294 transitions. Second operand 5 states. [2019-11-16 00:03:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:12,369 INFO L93 Difference]: Finished difference Result 2510 states and 5873 transitions. [2019-11-16 00:03:12,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:03:12,370 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-11-16 00:03:12,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:12,372 INFO L225 Difference]: With dead ends: 2510 [2019-11-16 00:03:12,373 INFO L226 Difference]: Without dead ends: 2492 [2019-11-16 00:03:12,373 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:03:12,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2492 states. [2019-11-16 00:03:12,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2492 to 2116. [2019-11-16 00:03:12,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2116 states. [2019-11-16 00:03:12,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2116 states to 2116 states and 4953 transitions. [2019-11-16 00:03:12,402 INFO L78 Accepts]: Start accepts. Automaton has 2116 states and 4953 transitions. Word has length 93 [2019-11-16 00:03:12,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:12,402 INFO L462 AbstractCegarLoop]: Abstraction has 2116 states and 4953 transitions. [2019-11-16 00:03:12,402 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-16 00:03:12,402 INFO L276 IsEmpty]: Start isEmpty. Operand 2116 states and 4953 transitions. [2019-11-16 00:03:12,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:03:12,405 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:12,405 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-16 00:03:12,405 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:12,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:12,406 INFO L82 PathProgramCache]: Analyzing trace with hash -587750359, now seen corresponding path program 1 times [2019-11-16 00:03:12,406 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:12,408 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470019144] [2019-11-16 00:03:12,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,408 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:12,495 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-16 00:03:12,495 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470019144] [2019-11-16 00:03:12,496 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:12,496 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-16 00:03:12,496 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871977598] [2019-11-16 00:03:12,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-16 00:03:12,497 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:12,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-16 00:03:12,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-16 00:03:12,497 INFO L87 Difference]: Start difference. First operand 2116 states and 4953 transitions. Second operand 6 states. [2019-11-16 00:03:12,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:12,585 INFO L93 Difference]: Finished difference Result 2191 states and 5104 transitions. [2019-11-16 00:03:12,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-16 00:03:12,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-11-16 00:03:12,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:12,587 INFO L225 Difference]: With dead ends: 2191 [2019-11-16 00:03:12,587 INFO L226 Difference]: Without dead ends: 2191 [2019-11-16 00:03:12,587 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-11-16 00:03:12,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2191 states. [2019-11-16 00:03:12,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2191 to 2098. [2019-11-16 00:03:12,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2098 states. [2019-11-16 00:03:12,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 4917 transitions. [2019-11-16 00:03:12,606 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 4917 transitions. Word has length 93 [2019-11-16 00:03:12,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:12,606 INFO L462 AbstractCegarLoop]: Abstraction has 2098 states and 4917 transitions. [2019-11-16 00:03:12,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-16 00:03:12,606 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 4917 transitions. [2019-11-16 00:03:12,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:03:12,609 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:12,609 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 00:03:12,609 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:12,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:12,610 INFO L82 PathProgramCache]: Analyzing trace with hash 806204675, now seen corresponding path program 1 times [2019-11-16 00:03:12,610 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:12,610 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935264147] [2019-11-16 00:03:12,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,610 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:12,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:12,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:12,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-16 00:03:12,744 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935264147] [2019-11-16 00:03:12,744 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:12,745 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:03:12,745 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319946600] [2019-11-16 00:03:12,745 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:03:12,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:12,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:03:12,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:03:12,746 INFO L87 Difference]: Start difference. First operand 2098 states and 4917 transitions. Second operand 7 states. [2019-11-16 00:03:13,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:13,009 INFO L93 Difference]: Finished difference Result 2254 states and 5190 transitions. [2019-11-16 00:03:13,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-16 00:03:13,009 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-11-16 00:03:13,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:13,011 INFO L225 Difference]: With dead ends: 2254 [2019-11-16 00:03:13,011 INFO L226 Difference]: Without dead ends: 2210 [2019-11-16 00:03:13,011 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:03:13,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2210 states. [2019-11-16 00:03:13,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2210 to 2074. [2019-11-16 00:03:13,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2074 states. [2019-11-16 00:03:13,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2074 states to 2074 states and 4854 transitions. [2019-11-16 00:03:13,030 INFO L78 Accepts]: Start accepts. Automaton has 2074 states and 4854 transitions. Word has length 93 [2019-11-16 00:03:13,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:13,031 INFO L462 AbstractCegarLoop]: Abstraction has 2074 states and 4854 transitions. [2019-11-16 00:03:13,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:03:13,031 INFO L276 IsEmpty]: Start isEmpty. Operand 2074 states and 4854 transitions. [2019-11-16 00:03:13,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:03:13,033 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:13,033 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-16 00:03:13,033 INFO L410 AbstractCegarLoop]: === Iteration 34 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:13,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:13,034 INFO L82 PathProgramCache]: Analyzing trace with hash 357508036, now seen corresponding path program 1 times [2019-11-16 00:03:13,034 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:13,034 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174727024] [2019-11-16 00:03:13,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:13,034 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:13,035 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:13,148 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-16 00:03:13,149 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174727024] [2019-11-16 00:03:13,149 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:13,149 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-16 00:03:13,149 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098885640] [2019-11-16 00:03:13,149 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-16 00:03:13,149 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:13,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-16 00:03:13,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-11-16 00:03:13,150 INFO L87 Difference]: Start difference. First operand 2074 states and 4854 transitions. Second operand 7 states. [2019-11-16 00:03:13,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:13,233 INFO L93 Difference]: Finished difference Result 3472 states and 8195 transitions. [2019-11-16 00:03:13,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-16 00:03:13,234 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-11-16 00:03:13,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:13,235 INFO L225 Difference]: With dead ends: 3472 [2019-11-16 00:03:13,235 INFO L226 Difference]: Without dead ends: 1476 [2019-11-16 00:03:13,235 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-16 00:03:13,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1476 states. [2019-11-16 00:03:13,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1476 to 1396. [2019-11-16 00:03:13,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1396 states. [2019-11-16 00:03:13,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1396 states to 1396 states and 3309 transitions. [2019-11-16 00:03:13,248 INFO L78 Accepts]: Start accepts. Automaton has 1396 states and 3309 transitions. Word has length 93 [2019-11-16 00:03:13,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:13,248 INFO L462 AbstractCegarLoop]: Abstraction has 1396 states and 3309 transitions. [2019-11-16 00:03:13,248 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-16 00:03:13,248 INFO L276 IsEmpty]: Start isEmpty. Operand 1396 states and 3309 transitions. [2019-11-16 00:03:13,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:03:13,249 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:13,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] [2019-11-16 00:03:13,249 INFO L410 AbstractCegarLoop]: === Iteration 35 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:13,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:13,250 INFO L82 PathProgramCache]: Analyzing trace with hash -943421820, now seen corresponding path program 2 times [2019-11-16 00:03:13,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:13,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421451376] [2019-11-16 00:03:13,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:13,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:13,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:13,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-16 00:03:13,436 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-16 00:03:13,436 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421451376] [2019-11-16 00:03:13,436 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-16 00:03:13,436 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-11-16 00:03:13,436 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513683358] [2019-11-16 00:03:13,436 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-16 00:03:13,437 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-16 00:03:13,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-16 00:03:13,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-11-16 00:03:13,437 INFO L87 Difference]: Start difference. First operand 1396 states and 3309 transitions. Second operand 12 states. [2019-11-16 00:03:13,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-16 00:03:13,684 INFO L93 Difference]: Finished difference Result 2608 states and 6254 transitions. [2019-11-16 00:03:13,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-11-16 00:03:13,685 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 93 [2019-11-16 00:03:13,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-16 00:03:13,687 INFO L225 Difference]: With dead ends: 2608 [2019-11-16 00:03:13,687 INFO L226 Difference]: Without dead ends: 1969 [2019-11-16 00:03:13,687 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-11-16 00:03:13,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2019-11-16 00:03:13,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1857. [2019-11-16 00:03:13,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1857 states. [2019-11-16 00:03:13,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1857 states to 1857 states and 4308 transitions. [2019-11-16 00:03:13,703 INFO L78 Accepts]: Start accepts. Automaton has 1857 states and 4308 transitions. Word has length 93 [2019-11-16 00:03:13,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-16 00:03:13,703 INFO L462 AbstractCegarLoop]: Abstraction has 1857 states and 4308 transitions. [2019-11-16 00:03:13,703 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-16 00:03:13,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1857 states and 4308 transitions. [2019-11-16 00:03:13,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-16 00:03:13,705 INFO L372 BasicCegarLoop]: Found error trace [2019-11-16 00:03:13,705 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-16 00:03:13,705 INFO L410 AbstractCegarLoop]: === Iteration 36 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-16 00:03:13,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-16 00:03:13,705 INFO L82 PathProgramCache]: Analyzing trace with hash -1394134806, now seen corresponding path program 3 times [2019-11-16 00:03:13,705 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-16 00:03:13,705 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518760952] [2019-11-16 00:03:13,705 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:13,706 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-16 00:03:13,706 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-16 00:03:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:13,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-16 00:03:13,786 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-16 00:03:13,786 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-16 00:03:13,956 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-16 00:03:13,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 12:03:13 BasicIcfg [2019-11-16 00:03:13,958 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-16 00:03:13,958 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-16 00:03:13,958 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-16 00:03:13,958 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-16 00:03:13,959 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:02:35" (3/4) ... [2019-11-16 00:03:13,961 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-16 00:03:14,096 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_d3e071e5-fa50-4b22-b385-2654bf860bff/bin/uautomizer/witness.graphml [2019-11-16 00:03:14,097 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-16 00:03:14,099 INFO L168 Benchmark]: Toolchain (without parser) took 40525.23 ms. Allocated memory was 1.0 GB in the beginning and 4.1 GB in the end (delta: 3.1 GB). Free memory was 940.7 MB in the beginning and 3.0 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.0 GB. Max. memory is 11.5 GB. [2019-11-16 00:03:14,099 INFO L168 Benchmark]: CDTParser took 0.18 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-16 00:03:14,101 INFO L168 Benchmark]: CACSL2BoogieTranslator took 673.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:14,101 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.03 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-16 00:03:14,102 INFO L168 Benchmark]: Boogie Preprocessor took 37.57 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-16 00:03:14,102 INFO L168 Benchmark]: RCFGBuilder took 728.86 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:14,102 INFO L168 Benchmark]: TraceAbstraction took 38875.11 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 977.9 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:14,103 INFO L168 Benchmark]: Witness Printer took 138.74 ms. Allocated memory is still 4.1 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-16 00:03:14,105 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 673.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 149.9 MB). Free memory was 940.7 MB in the beginning and 1.1 GB in the end (delta: -180.9 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.03 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 37.57 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 728.86 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: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 38875.11 ms. Allocated memory was 1.2 GB in the beginning and 4.1 GB in the end (delta: 2.9 GB). Free memory was 1.1 GB in the beginning and 3.0 GB in the end (delta: -2.0 GB). Peak memory consumption was 977.9 MB. Max. memory is 11.5 GB. * Witness Printer took 138.74 ms. Allocated memory is still 4.1 GB. Free memory was 3.0 GB in the beginning and 3.0 GB in the end (delta: 17.7 MB). Peak memory consumption was 17.7 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] [L695] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0] [L696] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0] [L698] 0 int x = 0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L699] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L700] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L701] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L702] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=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] [L703] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=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] [L704] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=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] [L705] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=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] [L706] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=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] [L707] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=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] [L708] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=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}] [L709] 0 int x$w_buff0; VAL [__unbuffered_cnt=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] [L710] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=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] [L711] 0 int x$w_buff1; VAL [__unbuffered_cnt=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] [L712] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=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] [L714] 0 int y = 0; VAL [__unbuffered_cnt=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] [L715] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=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] [L716] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=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] [L776] 0 pthread_t t2479; VAL [__unbuffered_cnt=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] [L777] FCALL, FORK 0 pthread_create(&t2479, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L778] 0 pthread_t t2480; VAL [__unbuffered_cnt=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] [L779] FCALL, FORK 0 pthread_create(&t2480, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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] [L740] 2 x$w_buff1 = x$w_buff0 [L741] 2 x$w_buff0 = 2 [L742] 2 x$w_buff1_used = x$w_buff0_used [L743] 2 x$w_buff0_used = (_Bool)1 [L4] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L745] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L746] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L747] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L748] 2 x$r_buff0_thd2 = (_Bool)1 [L751] 2 y = 1 VAL [__unbuffered_cnt=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=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L754] 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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L720] 1 y = 2 [L723] 1 x = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L754] 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) [L755] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L726] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L755] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L726] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=2] [L726] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x)=2, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x=2, y=2] [L726] 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) [L727] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L727] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L728] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L728] 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 [L729] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L729] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L730] 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=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 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 [L733] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L756] 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=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L756] 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 [L757] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L757] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L758] 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=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L758] 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 [L761] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L785] 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) [L786] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L786] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L787] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L787] 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 [L788] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L788] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L789] 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, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L789] 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 [L792] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 0 x$flush_delayed = weak$$choice2 [L795] 0 x$mem_tmp = x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L796] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L797] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L797] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L798] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L798] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L799] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L799] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L800] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L800] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L801] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L802] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L802] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L803] 0 main$tmp_guard1 = !(x == 2 && y == 2) VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] EXPR 0 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 0 x = x$flush_delayed ? x$mem_tmp : x [L805] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L4] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 174 locations, 3 error locations. Result: UNSAFE, OverallTime: 38.7s, OverallIterations: 36, TraceHistogramMax: 1, AutomataDifference: 17.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8919 SDtfs, 9426 SDslu, 20344 SDs, 0 SdLazy, 8236 SolverSat, 536 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 100 SyntacticMatches, 16 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 483 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71293occurred in iteration=10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 15.3s AutomataMinimizationTime, 35 MinimizatonAttempts, 115789 StatesRemovedByMinimization, 34 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 2779 NumberOfCodeBlocks, 2779 NumberOfCodeBlocksAsserted, 36 NumberOfCheckSat, 2651 ConstructedInterpolants, 0 QuantifiedInterpolants, 543279 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 35 InterpolantComputations, 35 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...