./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc.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/working_dir_6d055ebc-8539-4835-a1ec-6bf0d40f387e/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_6d055ebc-8539-4835-a1ec-6bf0d40f387e/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_6d055ebc-8539-4835-a1ec-6bf0d40f387e/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_6d055ebc-8539-4835-a1ec-6bf0d40f387e/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc.i -s /tmp/vcloud-vcloud-master/worker/working_dir_6d055ebc-8539-4835-a1ec-6bf0d40f387e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_6d055ebc-8539-4835-a1ec-6bf0d40f387e/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 35bf62843afe343d6081d581a50aa46de13dea5e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-10-22 08:57:35,237 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 08:57:35,238 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 08:57:35,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 08:57:35,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 08:57:35,252 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 08:57:35,254 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 08:57:35,256 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 08:57:35,258 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 08:57:35,261 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 08:57:35,263 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 08:57:35,265 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 08:57:35,270 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 08:57:35,271 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 08:57:35,272 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 08:57:35,273 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 08:57:35,273 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 08:57:35,274 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 08:57:35,275 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 08:57:35,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 08:57:35,282 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 08:57:35,283 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 08:57:35,286 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 08:57:35,287 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 08:57:35,288 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 08:57:35,289 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 08:57:35,289 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 08:57:35,289 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 08:57:35,290 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 08:57:35,291 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 08:57:35,291 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 08:57:35,293 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 08:57:35,294 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 08:57:35,294 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 08:57:35,295 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 08:57:35,297 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 08:57:35,298 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 08:57:35,299 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 08:57:35,299 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 08:57:35,300 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 08:57:35,301 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 08:57:35,302 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_6d055ebc-8539-4835-a1ec-6bf0d40f387e/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 08:57:35,314 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 08:57:35,323 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 08:57:35,326 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 08:57:35,326 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 08:57:35,326 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 08:57:35,327 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 08:57:35,327 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 08:57:35,327 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 08:57:35,327 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 08:57:35,327 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 08:57:35,328 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 08:57:35,328 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 08:57:35,328 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 08:57:35,328 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 08:57:35,328 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 08:57:35,329 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 08:57:35,329 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 08:57:35,329 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 08:57:35,329 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 08:57:35,329 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 08:57:35,330 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 08:57:35,330 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 08:57:35,330 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 08:57:35,330 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 08:57:35,330 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 08:57:35,331 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 08:57:35,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 08:57:35,331 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 08:57:35,331 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/working_dir_6d055ebc-8539-4835-a1ec-6bf0d40f387e/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 -> 35bf62843afe343d6081d581a50aa46de13dea5e [2019-10-22 08:57:35,367 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 08:57:35,382 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 08:57:35,385 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 08:57:35,387 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 08:57:35,387 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 08:57:35,388 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_6d055ebc-8539-4835-a1ec-6bf0d40f387e/bin/uautomizer/../../sv-benchmarks/c/pthread-wmm/rfi003_power.oepc.i [2019-10-22 08:57:35,445 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6d055ebc-8539-4835-a1ec-6bf0d40f387e/bin/uautomizer/data/760c39927/ebe7cb76713d4074b34c020369ecfc3e/FLAGac365858e [2019-10-22 08:57:35,921 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 08:57:35,921 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_6d055ebc-8539-4835-a1ec-6bf0d40f387e/sv-benchmarks/c/pthread-wmm/rfi003_power.oepc.i [2019-10-22 08:57:35,934 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_6d055ebc-8539-4835-a1ec-6bf0d40f387e/bin/uautomizer/data/760c39927/ebe7cb76713d4074b34c020369ecfc3e/FLAGac365858e [2019-10-22 08:57:36,213 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_6d055ebc-8539-4835-a1ec-6bf0d40f387e/bin/uautomizer/data/760c39927/ebe7cb76713d4074b34c020369ecfc3e [2019-10-22 08:57:36,216 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 08:57:36,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 08:57:36,218 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:36,218 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 08:57:36,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 08:57:36,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:36" (1/1) ... [2019-10-22 08:57:36,225 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5c85f56b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:36, skipping insertion in model container [2019-10-22 08:57:36,225 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 08:57:36" (1/1) ... [2019-10-22 08:57:36,232 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 08:57:36,288 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 08:57:36,785 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:36,798 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 08:57:36,872 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 08:57:36,945 INFO L192 MainTranslator]: Completed translation [2019-10-22 08:57:36,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:36 WrapperNode [2019-10-22 08:57:36,946 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 08:57:36,947 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:36,947 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 08:57:36,947 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 08:57:36,955 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:36" (1/1) ... [2019-10-22 08:57:36,971 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:36" (1/1) ... [2019-10-22 08:57:36,999 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 08:57:37,000 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 08:57:37,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 08:57:37,000 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 08:57:37,009 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:36" (1/1) ... [2019-10-22 08:57:37,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:36" (1/1) ... [2019-10-22 08:57:37,014 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:36" (1/1) ... [2019-10-22 08:57:37,015 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:36" (1/1) ... [2019-10-22 08:57:37,023 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:36" (1/1) ... [2019-10-22 08:57:37,026 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:36" (1/1) ... [2019-10-22 08:57:37,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:36" (1/1) ... [2019-10-22 08:57:37,032 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 08:57:37,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 08:57:37,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 08:57:37,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 08:57:37,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:36" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_6d055ebc-8539-4835-a1ec-6bf0d40f387e/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-10-22 08:57:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 08:57:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-10-22 08:57:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 08:57:37,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 08:57:37,106 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-10-22 08:57:37,106 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-10-22 08:57:37,106 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-10-22 08:57:37,108 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-10-22 08:57:37,109 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-10-22 08:57:37,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 08:57:37,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 08:57:37,111 WARN L202 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-10-22 08:57:37,656 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 08:57:37,661 INFO L284 CfgBuilder]: Removed 8 assume(true) statements. [2019-10-22 08:57:37,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:37 BoogieIcfgContainer [2019-10-22 08:57:37,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 08:57:37,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 08:57:37,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 08:57:37,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 08:57:37,667 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 08:57:36" (1/3) ... [2019-10-22 08:57:37,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61985fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:37, skipping insertion in model container [2019-10-22 08:57:37,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 08:57:36" (2/3) ... [2019-10-22 08:57:37,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61985fbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 08:57:37, skipping insertion in model container [2019-10-22 08:57:37,672 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:37" (3/3) ... [2019-10-22 08:57:37,677 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_power.oepc.i [2019-10-22 08:57:37,727 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,727 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,727 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,727 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,728 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,728 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,728 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,728 WARN L315 ript$VariableManager]: TermVariabe Thread1_P0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,728 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,729 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,729 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,729 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,729 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,729 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,730 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,730 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,730 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,730 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,730 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,730 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,731 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,731 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,731 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,731 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,733 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,733 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,734 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,734 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,734 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,734 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,734 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,735 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,735 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,735 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,735 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,735 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,736 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,736 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,736 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,736 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,736 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,736 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,737 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,737 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,737 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,737 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,737 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,738 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,738 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,738 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,738 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,738 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,738 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,739 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,739 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,739 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,739 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,739 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,741 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,741 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,741 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,742 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,742 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,742 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,742 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,742 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,742 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,743 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,743 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,743 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,743 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,743 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,744 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,744 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,744 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,744 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,744 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,744 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,745 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,745 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,745 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,745 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,745 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,746 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,746 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,746 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,746 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,746 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,746 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,747 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,747 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,747 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,747 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,749 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,749 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,749 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,749 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,749 WARN L315 ript$VariableManager]: TermVariabe |Thread1_P0_#t~nondet26.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,750 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,750 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,750 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,750 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,750 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,751 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,751 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,751 WARN L315 ript$VariableManager]: TermVariabe Thread0_P1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,751 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,751 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,752 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,752 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,752 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,752 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,752 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,753 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,753 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,753 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,753 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,753 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,754 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,754 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,754 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,754 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,754 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,754 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,755 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,755 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,755 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,755 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,757 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,758 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,758 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,758 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,758 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,758 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,758 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,758 WARN L315 ript$VariableManager]: TermVariabe |Thread0_P1_#t~nondet33.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-10-22 08:57:37,767 WARN L141 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-10-22 08:57:37,768 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 08:57:37,782 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-22 08:57:37,795 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-22 08:57:37,818 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 08:57:37,818 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 08:57:37,818 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 08:57:37,818 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 08:57:37,818 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 08:57:37,818 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 08:57:37,819 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 08:57:37,819 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 08:57:37,834 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 131 places, 163 transitions [2019-10-22 08:57:40,101 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27855 states. [2019-10-22 08:57:40,103 INFO L276 IsEmpty]: Start isEmpty. Operand 27855 states. [2019-10-22 08:57:40,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-10-22 08:57:40,112 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:40,113 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] [2019-10-22 08:57:40,115 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:40,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:40,120 INFO L82 PathProgramCache]: Analyzing trace with hash -361473251, now seen corresponding path program 1 times [2019-10-22 08:57:40,128 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:40,128 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774076183] [2019-10-22 08:57:40,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,129 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:40,129 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:40,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:40,380 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774076183] [2019-10-22 08:57:40,381 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:40,381 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:40,382 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172712272] [2019-10-22 08:57:40,386 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:40,386 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:40,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:40,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:40,402 INFO L87 Difference]: Start difference. First operand 27855 states. Second operand 4 states. [2019-10-22 08:57:40,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:40,960 INFO L93 Difference]: Finished difference Result 28523 states and 108880 transitions. [2019-10-22 08:57:40,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:40,962 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 38 [2019-10-22 08:57:40,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:41,154 INFO L225 Difference]: With dead ends: 28523 [2019-10-22 08:57:41,154 INFO L226 Difference]: Without dead ends: 21755 [2019-10-22 08:57:41,157 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-10-22 08:57:41,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21755 states. [2019-10-22 08:57:42,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21755 to 21755. [2019-10-22 08:57:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21755 states. [2019-10-22 08:57:42,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21755 states to 21755 states and 83440 transitions. [2019-10-22 08:57:42,222 INFO L78 Accepts]: Start accepts. Automaton has 21755 states and 83440 transitions. Word has length 38 [2019-10-22 08:57:42,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:42,223 INFO L462 AbstractCegarLoop]: Abstraction has 21755 states and 83440 transitions. [2019-10-22 08:57:42,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:42,223 INFO L276 IsEmpty]: Start isEmpty. Operand 21755 states and 83440 transitions. [2019-10-22 08:57:42,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-22 08:57:42,235 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:42,235 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:42,235 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:42,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:42,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1780861984, now seen corresponding path program 1 times [2019-10-22 08:57:42,236 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:42,236 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732744178] [2019-10-22 08:57:42,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,236 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:42,236 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:42,363 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:42,363 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732744178] [2019-10-22 08:57:42,364 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:42,364 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:42,364 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678332913] [2019-10-22 08:57:42,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:57:42,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:42,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:42,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:42,366 INFO L87 Difference]: Start difference. First operand 21755 states and 83440 transitions. Second operand 5 states. [2019-10-22 08:57:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:43,029 INFO L93 Difference]: Finished difference Result 34169 states and 124040 transitions. [2019-10-22 08:57:43,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:57:43,030 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 46 [2019-10-22 08:57:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:43,523 INFO L225 Difference]: With dead ends: 34169 [2019-10-22 08:57:43,523 INFO L226 Difference]: Without dead ends: 33601 [2019-10-22 08:57:43,524 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-10-22 08:57:43,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33601 states. [2019-10-22 08:57:44,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33601 to 31795. [2019-10-22 08:57:44,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31795 states. [2019-10-22 08:57:44,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31795 states to 31795 states and 116818 transitions. [2019-10-22 08:57:44,361 INFO L78 Accepts]: Start accepts. Automaton has 31795 states and 116818 transitions. Word has length 46 [2019-10-22 08:57:44,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:44,362 INFO L462 AbstractCegarLoop]: Abstraction has 31795 states and 116818 transitions. [2019-10-22 08:57:44,362 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:57:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 31795 states and 116818 transitions. [2019-10-22 08:57:44,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-22 08:57:44,366 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:44,366 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] [2019-10-22 08:57:44,367 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:44,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:44,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1509414878, now seen corresponding path program 1 times [2019-10-22 08:57:44,367 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:44,368 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838062130] [2019-10-22 08:57:44,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,368 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:44,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:44,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:44,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:44,439 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838062130] [2019-10-22 08:57:44,439 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:44,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:57:44,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379610892] [2019-10-22 08:57:44,440 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:57:44,440 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:44,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:57:44,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:57:44,440 INFO L87 Difference]: Start difference. First operand 31795 states and 116818 transitions. Second operand 5 states. [2019-10-22 08:57:45,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:45,183 INFO L93 Difference]: Finished difference Result 41643 states and 149742 transitions. [2019-10-22 08:57:45,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:57:45,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 47 [2019-10-22 08:57:45,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:45,374 INFO L225 Difference]: With dead ends: 41643 [2019-10-22 08:57:45,374 INFO L226 Difference]: Without dead ends: 41179 [2019-10-22 08:57:45,374 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-10-22 08:57:45,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41179 states. [2019-10-22 08:57:46,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41179 to 35363. [2019-10-22 08:57:46,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35363 states. [2019-10-22 08:57:46,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35363 states to 35363 states and 128876 transitions. [2019-10-22 08:57:46,231 INFO L78 Accepts]: Start accepts. Automaton has 35363 states and 128876 transitions. Word has length 47 [2019-10-22 08:57:46,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:46,232 INFO L462 AbstractCegarLoop]: Abstraction has 35363 states and 128876 transitions. [2019-10-22 08:57:46,232 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:57:46,232 INFO L276 IsEmpty]: Start isEmpty. Operand 35363 states and 128876 transitions. [2019-10-22 08:57:46,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-10-22 08:57:46,239 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:46,240 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] [2019-10-22 08:57:46,240 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:46,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:46,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1591090696, now seen corresponding path program 1 times [2019-10-22 08:57:46,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:46,241 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272007999] [2019-10-22 08:57:46,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:46,241 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:46,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:46,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:46,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:46,294 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272007999] [2019-10-22 08:57:46,294 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:46,294 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:46,294 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992988788] [2019-10-22 08:57:46,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:46,295 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:46,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:46,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:46,296 INFO L87 Difference]: Start difference. First operand 35363 states and 128876 transitions. Second operand 3 states. [2019-10-22 08:57:46,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:46,953 INFO L93 Difference]: Finished difference Result 45909 states and 163944 transitions. [2019-10-22 08:57:46,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:46,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-10-22 08:57:46,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:47,084 INFO L225 Difference]: With dead ends: 45909 [2019-10-22 08:57:47,084 INFO L226 Difference]: Without dead ends: 45909 [2019-10-22 08:57:47,084 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-10-22 08:57:47,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45909 states. [2019-10-22 08:57:47,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45909 to 40246. [2019-10-22 08:57:47,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40246 states. [2019-10-22 08:57:47,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40246 states to 40246 states and 145214 transitions. [2019-10-22 08:57:47,833 INFO L78 Accepts]: Start accepts. Automaton has 40246 states and 145214 transitions. Word has length 49 [2019-10-22 08:57:47,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:47,834 INFO L462 AbstractCegarLoop]: Abstraction has 40246 states and 145214 transitions. [2019-10-22 08:57:47,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:47,834 INFO L276 IsEmpty]: Start isEmpty. Operand 40246 states and 145214 transitions. [2019-10-22 08:57:47,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 08:57:47,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:47,846 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:47,846 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:47,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:47,847 INFO L82 PathProgramCache]: Analyzing trace with hash -518299885, now seen corresponding path program 1 times [2019-10-22 08:57:47,847 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:47,847 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340009957] [2019-10-22 08:57:47,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:47,848 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:47,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:47,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:47,923 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340009957] [2019-10-22 08:57:47,923 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:47,923 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:57:47,924 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772914652] [2019-10-22 08:57:47,924 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:57:47,924 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:47,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:47,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:47,925 INFO L87 Difference]: Start difference. First operand 40246 states and 145214 transitions. Second operand 6 states. [2019-10-22 08:57:48,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:48,949 INFO L93 Difference]: Finished difference Result 52465 states and 185476 transitions. [2019-10-22 08:57:48,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-22 08:57:48,950 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-10-22 08:57:48,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:49,047 INFO L225 Difference]: With dead ends: 52465 [2019-10-22 08:57:49,048 INFO L226 Difference]: Without dead ends: 51929 [2019-10-22 08:57:49,048 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:57:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51929 states. [2019-10-22 08:57:49,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51929 to 40897. [2019-10-22 08:57:49,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40897 states. [2019-10-22 08:57:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40897 states to 40897 states and 147667 transitions. [2019-10-22 08:57:49,824 INFO L78 Accepts]: Start accepts. Automaton has 40897 states and 147667 transitions. Word has length 53 [2019-10-22 08:57:49,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:49,824 INFO L462 AbstractCegarLoop]: Abstraction has 40897 states and 147667 transitions. [2019-10-22 08:57:49,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:57:49,825 INFO L276 IsEmpty]: Start isEmpty. Operand 40897 states and 147667 transitions. [2019-10-22 08:57:49,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 08:57:49,841 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:49,841 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:49,841 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:49,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:49,842 INFO L82 PathProgramCache]: Analyzing trace with hash -173831608, now seen corresponding path program 1 times [2019-10-22 08:57:49,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:49,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [603928201] [2019-10-22 08:57:49,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:49,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:49,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:49,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:49,944 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [603928201] [2019-10-22 08:57:49,944 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:49,944 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:57:49,944 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466633404] [2019-10-22 08:57:49,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:57:49,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:49,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:49,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:49,945 INFO L87 Difference]: Start difference. First operand 40897 states and 147667 transitions. Second operand 6 states. [2019-10-22 08:57:50,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:50,564 INFO L93 Difference]: Finished difference Result 56598 states and 201647 transitions. [2019-10-22 08:57:50,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:57:50,565 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 53 [2019-10-22 08:57:50,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:50,681 INFO L225 Difference]: With dead ends: 56598 [2019-10-22 08:57:50,681 INFO L226 Difference]: Without dead ends: 55459 [2019-10-22 08:57:50,681 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:57:50,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55459 states. [2019-10-22 08:57:52,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55459 to 51954. [2019-10-22 08:57:52,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51954 states. [2019-10-22 08:57:52,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51954 states to 51954 states and 186006 transitions. [2019-10-22 08:57:52,183 INFO L78 Accepts]: Start accepts. Automaton has 51954 states and 186006 transitions. Word has length 53 [2019-10-22 08:57:52,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:52,184 INFO L462 AbstractCegarLoop]: Abstraction has 51954 states and 186006 transitions. [2019-10-22 08:57:52,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:57:52,184 INFO L276 IsEmpty]: Start isEmpty. Operand 51954 states and 186006 transitions. [2019-10-22 08:57:52,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 08:57:52,200 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:52,200 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:52,200 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:52,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:52,200 INFO L82 PathProgramCache]: Analyzing trace with hash -1970782967, now seen corresponding path program 1 times [2019-10-22 08:57:52,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:52,201 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88602060] [2019-10-22 08:57:52,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:52,201 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:52,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:52,321 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88602060] [2019-10-22 08:57:52,321 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:52,321 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:57:52,321 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152199628] [2019-10-22 08:57:52,322 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:57:52,322 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:52,322 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:57:52,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:57:52,323 INFO L87 Difference]: Start difference. First operand 51954 states and 186006 transitions. Second operand 7 states. [2019-10-22 08:57:53,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:53,222 INFO L93 Difference]: Finished difference Result 75637 states and 260103 transitions. [2019-10-22 08:57:53,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:57:53,223 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 53 [2019-10-22 08:57:53,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:53,369 INFO L225 Difference]: With dead ends: 75637 [2019-10-22 08:57:53,369 INFO L226 Difference]: Without dead ends: 75637 [2019-10-22 08:57:53,369 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:57:53,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75637 states. [2019-10-22 08:57:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75637 to 61472. [2019-10-22 08:57:54,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61472 states. [2019-10-22 08:57:55,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61472 states to 61472 states and 215183 transitions. [2019-10-22 08:57:55,200 INFO L78 Accepts]: Start accepts. Automaton has 61472 states and 215183 transitions. Word has length 53 [2019-10-22 08:57:55,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:55,200 INFO L462 AbstractCegarLoop]: Abstraction has 61472 states and 215183 transitions. [2019-10-22 08:57:55,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:57:55,200 INFO L276 IsEmpty]: Start isEmpty. Operand 61472 states and 215183 transitions. [2019-10-22 08:57:55,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-22 08:57:55,212 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:55,213 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:55,213 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:55,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:55,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1083279286, now seen corresponding path program 1 times [2019-10-22 08:57:55,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:55,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060254996] [2019-10-22 08:57:55,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:55,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:55,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:55,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:55,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:55,283 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060254996] [2019-10-22 08:57:55,283 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:55,283 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:55,283 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494025928] [2019-10-22 08:57:55,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:55,284 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:55,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:55,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:55,284 INFO L87 Difference]: Start difference. First operand 61472 states and 215183 transitions. Second operand 4 states. [2019-10-22 08:57:55,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:55,350 INFO L93 Difference]: Finished difference Result 13777 states and 43273 transitions. [2019-10-22 08:57:55,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:55,351 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 53 [2019-10-22 08:57:55,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:55,372 INFO L225 Difference]: With dead ends: 13777 [2019-10-22 08:57:55,373 INFO L226 Difference]: Without dead ends: 12160 [2019-10-22 08:57:55,373 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-10-22 08:57:55,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12160 states. [2019-10-22 08:57:55,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12160 to 12112. [2019-10-22 08:57:55,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12112 states. [2019-10-22 08:57:55,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12112 states to 12112 states and 37957 transitions. [2019-10-22 08:57:55,516 INFO L78 Accepts]: Start accepts. Automaton has 12112 states and 37957 transitions. Word has length 53 [2019-10-22 08:57:55,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:55,516 INFO L462 AbstractCegarLoop]: Abstraction has 12112 states and 37957 transitions. [2019-10-22 08:57:55,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:55,516 INFO L276 IsEmpty]: Start isEmpty. Operand 12112 states and 37957 transitions. [2019-10-22 08:57:55,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 08:57:55,520 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:55,520 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-10-22 08:57:55,520 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:55,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:55,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1572618351, now seen corresponding path program 1 times [2019-10-22 08:57:55,521 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:55,521 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400354995] [2019-10-22 08:57:55,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:55,521 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:55,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:55,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:55,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:55,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400354995] [2019-10-22 08:57:55,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:55,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:55,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694595471] [2019-10-22 08:57:55,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:55,576 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:55,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:55,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:55,577 INFO L87 Difference]: Start difference. First operand 12112 states and 37957 transitions. Second operand 4 states. [2019-10-22 08:57:55,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:55,732 INFO L93 Difference]: Finished difference Result 14275 states and 44580 transitions. [2019-10-22 08:57:55,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:57:55,733 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2019-10-22 08:57:55,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:55,760 INFO L225 Difference]: With dead ends: 14275 [2019-10-22 08:57:55,760 INFO L226 Difference]: Without dead ends: 14275 [2019-10-22 08:57:55,760 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-10-22 08:57:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14275 states. [2019-10-22 08:57:55,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14275 to 12843. [2019-10-22 08:57:55,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12843 states. [2019-10-22 08:57:55,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12843 states to 12843 states and 40182 transitions. [2019-10-22 08:57:55,996 INFO L78 Accepts]: Start accepts. Automaton has 12843 states and 40182 transitions. Word has length 63 [2019-10-22 08:57:55,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:55,997 INFO L462 AbstractCegarLoop]: Abstraction has 12843 states and 40182 transitions. [2019-10-22 08:57:55,997 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:55,997 INFO L276 IsEmpty]: Start isEmpty. Operand 12843 states and 40182 transitions. [2019-10-22 08:57:56,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-22 08:57:56,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:56,003 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-10-22 08:57:56,003 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:56,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:56,003 INFO L82 PathProgramCache]: Analyzing trace with hash 170191984, now seen corresponding path program 1 times [2019-10-22 08:57:56,003 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:56,003 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157013343] [2019-10-22 08:57:56,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,004 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,004 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:56,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:56,092 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157013343] [2019-10-22 08:57:56,092 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:56,093 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:57:56,093 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373737298] [2019-10-22 08:57:56,093 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:57:56,093 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:56,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:56,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:56,094 INFO L87 Difference]: Start difference. First operand 12843 states and 40182 transitions. Second operand 6 states. [2019-10-22 08:57:56,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:56,520 INFO L93 Difference]: Finished difference Result 16769 states and 51611 transitions. [2019-10-22 08:57:56,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 08:57:56,521 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2019-10-22 08:57:56,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:56,551 INFO L225 Difference]: With dead ends: 16769 [2019-10-22 08:57:56,551 INFO L226 Difference]: Without dead ends: 16705 [2019-10-22 08:57:56,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-10-22 08:57:56,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16705 states. [2019-10-22 08:57:56,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16705 to 13812. [2019-10-22 08:57:56,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13812 states. [2019-10-22 08:57:56,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13812 states to 13812 states and 42966 transitions. [2019-10-22 08:57:56,750 INFO L78 Accepts]: Start accepts. Automaton has 13812 states and 42966 transitions. Word has length 63 [2019-10-22 08:57:56,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:56,750 INFO L462 AbstractCegarLoop]: Abstraction has 13812 states and 42966 transitions. [2019-10-22 08:57:56,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:57:56,751 INFO L276 IsEmpty]: Start isEmpty. Operand 13812 states and 42966 transitions. [2019-10-22 08:57:56,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 08:57:56,758 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:56,758 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] [2019-10-22 08:57:56,759 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:56,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:56,759 INFO L82 PathProgramCache]: Analyzing trace with hash -830371060, now seen corresponding path program 1 times [2019-10-22 08:57:56,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:56,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103695551] [2019-10-22 08:57:56,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:56,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:56,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:56,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:56,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103695551] [2019-10-22 08:57:56,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:56,834 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:57:56,834 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543463172] [2019-10-22 08:57:56,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:57:56,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:56,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:57:56,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:57:56,835 INFO L87 Difference]: Start difference. First operand 13812 states and 42966 transitions. Second operand 4 states. [2019-10-22 08:57:57,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:57,093 INFO L93 Difference]: Finished difference Result 17359 states and 53255 transitions. [2019-10-22 08:57:57,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 08:57:57,093 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-10-22 08:57:57,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:57,128 INFO L225 Difference]: With dead ends: 17359 [2019-10-22 08:57:57,128 INFO L226 Difference]: Without dead ends: 17359 [2019-10-22 08:57:57,129 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-10-22 08:57:57,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17359 states. [2019-10-22 08:57:57,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17359 to 15783. [2019-10-22 08:57:57,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15783 states. [2019-10-22 08:57:57,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15783 states to 15783 states and 48578 transitions. [2019-10-22 08:57:57,416 INFO L78 Accepts]: Start accepts. Automaton has 15783 states and 48578 transitions. Word has length 65 [2019-10-22 08:57:57,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:57,416 INFO L462 AbstractCegarLoop]: Abstraction has 15783 states and 48578 transitions. [2019-10-22 08:57:57,417 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:57:57,417 INFO L276 IsEmpty]: Start isEmpty. Operand 15783 states and 48578 transitions. [2019-10-22 08:57:57,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-10-22 08:57:57,426 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:57,426 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] [2019-10-22 08:57:57,426 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:57,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:57,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1387386893, now seen corresponding path program 1 times [2019-10-22 08:57:57,427 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:57,427 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059505705] [2019-10-22 08:57:57,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,427 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,427 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:57,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059505705] [2019-10-22 08:57:57,465 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:57,465 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 08:57:57,465 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397960473] [2019-10-22 08:57:57,466 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-22 08:57:57,466 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:57,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 08:57:57,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 08:57:57,466 INFO L87 Difference]: Start difference. First operand 15783 states and 48578 transitions. Second operand 3 states. [2019-10-22 08:57:57,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:57,675 INFO L93 Difference]: Finished difference Result 16413 states and 50318 transitions. [2019-10-22 08:57:57,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 08:57:57,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-10-22 08:57:57,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:57,709 INFO L225 Difference]: With dead ends: 16413 [2019-10-22 08:57:57,709 INFO L226 Difference]: Without dead ends: 16413 [2019-10-22 08:57:57,709 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-10-22 08:57:57,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16413 states. [2019-10-22 08:57:57,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16413 to 16125. [2019-10-22 08:57:57,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16125 states. [2019-10-22 08:57:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 49516 transitions. [2019-10-22 08:57:57,925 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 49516 transitions. Word has length 65 [2019-10-22 08:57:57,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:57,925 INFO L462 AbstractCegarLoop]: Abstraction has 16125 states and 49516 transitions. [2019-10-22 08:57:57,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-22 08:57:57,925 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 49516 transitions. [2019-10-22 08:57:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 08:57:57,936 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:57,937 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:57:57,937 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:57,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:57,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1580877020, now seen corresponding path program 1 times [2019-10-22 08:57:57,937 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:57,937 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [675024837] [2019-10-22 08:57:57,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,937 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:57,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:58,036 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [675024837] [2019-10-22 08:57:58,036 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:58,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:57:58,037 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214108211] [2019-10-22 08:57:58,037 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:57:58,037 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:58,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:58,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:58,037 INFO L87 Difference]: Start difference. First operand 16125 states and 49516 transitions. Second operand 6 states. [2019-10-22 08:57:58,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:58,437 INFO L93 Difference]: Finished difference Result 17577 states and 53335 transitions. [2019-10-22 08:57:58,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:57:58,438 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-22 08:57:58,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:58,463 INFO L225 Difference]: With dead ends: 17577 [2019-10-22 08:57:58,463 INFO L226 Difference]: Without dead ends: 17577 [2019-10-22 08:57:58,463 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:57:58,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17577 states. [2019-10-22 08:57:58,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17577 to 17008. [2019-10-22 08:57:58,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17008 states. [2019-10-22 08:57:58,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17008 states to 17008 states and 51782 transitions. [2019-10-22 08:57:58,686 INFO L78 Accepts]: Start accepts. Automaton has 17008 states and 51782 transitions. Word has length 67 [2019-10-22 08:57:58,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:58,686 INFO L462 AbstractCegarLoop]: Abstraction has 17008 states and 51782 transitions. [2019-10-22 08:57:58,686 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:57:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand 17008 states and 51782 transitions. [2019-10-22 08:57:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 08:57:58,700 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:58,700 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] [2019-10-22 08:57:58,700 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:58,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:58,700 INFO L82 PathProgramCache]: Analyzing trace with hash -496332323, now seen corresponding path program 1 times [2019-10-22 08:57:58,700 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:58,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525965769] [2019-10-22 08:57:58,700 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:58,701 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:58,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:58,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:57:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:57:58,817 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525965769] [2019-10-22 08:57:58,818 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:57:58,818 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:57:58,818 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473448179] [2019-10-22 08:57:58,818 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:57:58,818 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:57:58,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:57:58,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:57:58,819 INFO L87 Difference]: Start difference. First operand 17008 states and 51782 transitions. Second operand 6 states. [2019-10-22 08:57:59,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:57:59,201 INFO L93 Difference]: Finished difference Result 19873 states and 58892 transitions. [2019-10-22 08:57:59,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:57:59,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 67 [2019-10-22 08:57:59,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:57:59,237 INFO L225 Difference]: With dead ends: 19873 [2019-10-22 08:57:59,237 INFO L226 Difference]: Without dead ends: 19873 [2019-10-22 08:57:59,237 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:57:59,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19873 states. [2019-10-22 08:57:59,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19873 to 17684. [2019-10-22 08:57:59,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17684 states. [2019-10-22 08:57:59,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17684 states to 17684 states and 52848 transitions. [2019-10-22 08:57:59,479 INFO L78 Accepts]: Start accepts. Automaton has 17684 states and 52848 transitions. Word has length 67 [2019-10-22 08:57:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:57:59,479 INFO L462 AbstractCegarLoop]: Abstraction has 17684 states and 52848 transitions. [2019-10-22 08:57:59,479 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:57:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 17684 states and 52848 transitions. [2019-10-22 08:57:59,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 08:57:59,493 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:57:59,493 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] [2019-10-22 08:57:59,493 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:57:59,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:57:59,494 INFO L82 PathProgramCache]: Analyzing trace with hash -284981410, now seen corresponding path program 1 times [2019-10-22 08:57:59,494 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:57:59,494 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252910659] [2019-10-22 08:57:59,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:59,494 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:57:59,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:57:59,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:00,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:00,033 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252910659] [2019-10-22 08:58:00,033 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:00,033 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:00,033 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655232398] [2019-10-22 08:58:00,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:58:00,034 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:00,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:00,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:00,034 INFO L87 Difference]: Start difference. First operand 17684 states and 52848 transitions. Second operand 5 states. [2019-10-22 08:58:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:00,351 INFO L93 Difference]: Finished difference Result 22458 states and 66796 transitions. [2019-10-22 08:58:00,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:58:00,352 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-22 08:58:00,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:00,383 INFO L225 Difference]: With dead ends: 22458 [2019-10-22 08:58:00,384 INFO L226 Difference]: Without dead ends: 22458 [2019-10-22 08:58:00,384 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:00,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22458 states. [2019-10-22 08:58:00,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22458 to 18978. [2019-10-22 08:58:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18978 states. [2019-10-22 08:58:00,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18978 states to 18978 states and 56244 transitions. [2019-10-22 08:58:00,650 INFO L78 Accepts]: Start accepts. Automaton has 18978 states and 56244 transitions. Word has length 67 [2019-10-22 08:58:00,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:00,650 INFO L462 AbstractCegarLoop]: Abstraction has 18978 states and 56244 transitions. [2019-10-22 08:58:00,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:58:00,651 INFO L276 IsEmpty]: Start isEmpty. Operand 18978 states and 56244 transitions. [2019-10-22 08:58:00,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 08:58:00,663 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:00,663 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] [2019-10-22 08:58:00,663 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:00,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:00,663 INFO L82 PathProgramCache]: Analyzing trace with hash -795515587, now seen corresponding path program 1 times [2019-10-22 08:58:00,663 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:00,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345200559] [2019-10-22 08:58:00,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:00,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:00,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:00,723 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345200559] [2019-10-22 08:58:00,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:00,724 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:00,724 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96854692] [2019-10-22 08:58:00,724 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:58:00,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:00,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:00,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:00,725 INFO L87 Difference]: Start difference. First operand 18978 states and 56244 transitions. Second operand 5 states. [2019-10-22 08:58:01,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:01,135 INFO L93 Difference]: Finished difference Result 25572 states and 75564 transitions. [2019-10-22 08:58:01,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:58:01,136 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-22 08:58:01,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:01,175 INFO L225 Difference]: With dead ends: 25572 [2019-10-22 08:58:01,175 INFO L226 Difference]: Without dead ends: 25572 [2019-10-22 08:58:01,175 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:58:01,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25572 states. [2019-10-22 08:58:01,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25572 to 20144. [2019-10-22 08:58:01,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20144 states. [2019-10-22 08:58:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20144 states to 20144 states and 59688 transitions. [2019-10-22 08:58:01,469 INFO L78 Accepts]: Start accepts. Automaton has 20144 states and 59688 transitions. Word has length 67 [2019-10-22 08:58:01,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:01,470 INFO L462 AbstractCegarLoop]: Abstraction has 20144 states and 59688 transitions. [2019-10-22 08:58:01,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:58:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 20144 states and 59688 transitions. [2019-10-22 08:58:01,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 08:58:01,481 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:01,481 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] [2019-10-22 08:58:01,481 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:01,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:01,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1691997246, now seen corresponding path program 1 times [2019-10-22 08:58:01,481 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:01,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281892563] [2019-10-22 08:58:01,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:01,482 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:01,482 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:01,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:01,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:01,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281892563] [2019-10-22 08:58:01,531 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:01,531 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 08:58:01,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580450822] [2019-10-22 08:58:01,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 08:58:01,532 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:01,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 08:58:01,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 08:58:01,532 INFO L87 Difference]: Start difference. First operand 20144 states and 59688 transitions. Second operand 4 states. [2019-10-22 08:58:01,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:01,928 INFO L93 Difference]: Finished difference Result 26772 states and 79459 transitions. [2019-10-22 08:58:01,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 08:58:01,928 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 67 [2019-10-22 08:58:01,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:01,969 INFO L225 Difference]: With dead ends: 26772 [2019-10-22 08:58:01,969 INFO L226 Difference]: Without dead ends: 26392 [2019-10-22 08:58:01,969 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-10-22 08:58:02,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26392 states. [2019-10-22 08:58:02,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26392 to 24448. [2019-10-22 08:58:02,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24448 states. [2019-10-22 08:58:02,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24448 states to 24448 states and 72600 transitions. [2019-10-22 08:58:02,302 INFO L78 Accepts]: Start accepts. Automaton has 24448 states and 72600 transitions. Word has length 67 [2019-10-22 08:58:02,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:02,302 INFO L462 AbstractCegarLoop]: Abstraction has 24448 states and 72600 transitions. [2019-10-22 08:58:02,302 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 08:58:02,302 INFO L276 IsEmpty]: Start isEmpty. Operand 24448 states and 72600 transitions. [2019-10-22 08:58:02,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-22 08:58:02,319 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:02,320 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] [2019-10-22 08:58:02,320 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:02,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:02,320 INFO L82 PathProgramCache]: Analyzing trace with hash -104954113, now seen corresponding path program 1 times [2019-10-22 08:58:02,320 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:02,320 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422181527] [2019-10-22 08:58:02,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:02,321 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:02,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:02,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-10-22 08:58:02,389 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422181527] [2019-10-22 08:58:02,389 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:02,390 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:02,390 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525216909] [2019-10-22 08:58:02,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:58:02,390 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:02,390 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:02,390 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:02,390 INFO L87 Difference]: Start difference. First operand 24448 states and 72600 transitions. Second operand 5 states. [2019-10-22 08:58:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:02,438 INFO L93 Difference]: Finished difference Result 6904 states and 16562 transitions. [2019-10-22 08:58:02,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:58:02,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-10-22 08:58:02,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:02,443 INFO L225 Difference]: With dead ends: 6904 [2019-10-22 08:58:02,443 INFO L226 Difference]: Without dead ends: 5460 [2019-10-22 08:58:02,444 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-10-22 08:58:02,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5460 states. [2019-10-22 08:58:02,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5460 to 4790. [2019-10-22 08:58:02,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4790 states. [2019-10-22 08:58:02,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4790 states to 4790 states and 11258 transitions. [2019-10-22 08:58:02,490 INFO L78 Accepts]: Start accepts. Automaton has 4790 states and 11258 transitions. Word has length 67 [2019-10-22 08:58:02,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:02,490 INFO L462 AbstractCegarLoop]: Abstraction has 4790 states and 11258 transitions. [2019-10-22 08:58:02,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:58:02,491 INFO L276 IsEmpty]: Start isEmpty. Operand 4790 states and 11258 transitions. [2019-10-22 08:58:02,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 08:58:02,494 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:02,494 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] [2019-10-22 08:58:02,495 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:02,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:02,495 INFO L82 PathProgramCache]: Analyzing trace with hash 835678018, now seen corresponding path program 1 times [2019-10-22 08:58:02,495 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:02,495 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106394388] [2019-10-22 08:58:02,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:02,495 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:02,495 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:02,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:02,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:02,554 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106394388] [2019-10-22 08:58:02,554 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:02,554 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 08:58:02,554 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847896124] [2019-10-22 08:58:02,554 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-22 08:58:02,555 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:02,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 08:58:02,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 08:58:02,555 INFO L87 Difference]: Start difference. First operand 4790 states and 11258 transitions. Second operand 5 states. [2019-10-22 08:58:02,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:02,715 INFO L93 Difference]: Finished difference Result 5631 states and 13084 transitions. [2019-10-22 08:58:02,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 08:58:02,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2019-10-22 08:58:02,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:02,719 INFO L225 Difference]: With dead ends: 5631 [2019-10-22 08:58:02,719 INFO L226 Difference]: Without dead ends: 5597 [2019-10-22 08:58:02,720 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:58:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2019-10-22 08:58:02,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 4943. [2019-10-22 08:58:02,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4943 states. [2019-10-22 08:58:02,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4943 states to 4943 states and 11559 transitions. [2019-10-22 08:58:02,767 INFO L78 Accepts]: Start accepts. Automaton has 4943 states and 11559 transitions. Word has length 82 [2019-10-22 08:58:02,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:02,767 INFO L462 AbstractCegarLoop]: Abstraction has 4943 states and 11559 transitions. [2019-10-22 08:58:02,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-22 08:58:02,767 INFO L276 IsEmpty]: Start isEmpty. Operand 4943 states and 11559 transitions. [2019-10-22 08:58:02,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 08:58:02,773 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:02,773 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 08:58:02,773 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:02,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:02,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1617551583, now seen corresponding path program 1 times [2019-10-22 08:58:02,774 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:02,774 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756167106] [2019-10-22 08:58:02,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:02,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:02,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:02,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:02,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756167106] [2019-10-22 08:58:02,920 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:02,920 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:58:02,921 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765384282] [2019-10-22 08:58:02,921 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:58:02,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:02,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:58:02,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:58:02,922 INFO L87 Difference]: Start difference. First operand 4943 states and 11559 transitions. Second operand 6 states. [2019-10-22 08:58:03,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:03,135 INFO L93 Difference]: Finished difference Result 6527 states and 15285 transitions. [2019-10-22 08:58:03,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:58:03,135 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 08:58:03,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:03,140 INFO L225 Difference]: With dead ends: 6527 [2019-10-22 08:58:03,140 INFO L226 Difference]: Without dead ends: 6495 [2019-10-22 08:58:03,140 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-10-22 08:58:03,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6495 states. [2019-10-22 08:58:03,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6495 to 5297. [2019-10-22 08:58:03,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5297 states. [2019-10-22 08:58:03,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5297 states to 5297 states and 12427 transitions. [2019-10-22 08:58:03,200 INFO L78 Accepts]: Start accepts. Automaton has 5297 states and 12427 transitions. Word has length 82 [2019-10-22 08:58:03,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:03,200 INFO L462 AbstractCegarLoop]: Abstraction has 5297 states and 12427 transitions. [2019-10-22 08:58:03,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:58:03,200 INFO L276 IsEmpty]: Start isEmpty. Operand 5297 states and 12427 transitions. [2019-10-22 08:58:03,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 08:58:03,206 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:03,207 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] [2019-10-22 08:58:03,207 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:03,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:03,207 INFO L82 PathProgramCache]: Analyzing trace with hash 880464354, now seen corresponding path program 1 times [2019-10-22 08:58:03,207 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:03,208 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880360629] [2019-10-22 08:58:03,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,208 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,208 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:03,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:03,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:03,296 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880360629] [2019-10-22 08:58:03,296 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:03,296 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:58:03,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127589189] [2019-10-22 08:58:03,297 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:58:03,297 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:03,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:58:03,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:03,298 INFO L87 Difference]: Start difference. First operand 5297 states and 12427 transitions. Second operand 7 states. [2019-10-22 08:58:03,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:03,586 INFO L93 Difference]: Finished difference Result 8627 states and 20707 transitions. [2019-10-22 08:58:03,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-22 08:58:03,586 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 82 [2019-10-22 08:58:03,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:03,594 INFO L225 Difference]: With dead ends: 8627 [2019-10-22 08:58:03,594 INFO L226 Difference]: Without dead ends: 8627 [2019-10-22 08:58:03,594 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2019-10-22 08:58:03,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8627 states. [2019-10-22 08:58:03,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8627 to 6038. [2019-10-22 08:58:03,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6038 states. [2019-10-22 08:58:03,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6038 states to 6038 states and 14311 transitions. [2019-10-22 08:58:03,667 INFO L78 Accepts]: Start accepts. Automaton has 6038 states and 14311 transitions. Word has length 82 [2019-10-22 08:58:03,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:03,667 INFO L462 AbstractCegarLoop]: Abstraction has 6038 states and 14311 transitions. [2019-10-22 08:58:03,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:58:03,668 INFO L276 IsEmpty]: Start isEmpty. Operand 6038 states and 14311 transitions. [2019-10-22 08:58:03,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 08:58:03,673 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:03,673 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] [2019-10-22 08:58:03,673 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:03,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:03,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1767968035, now seen corresponding path program 1 times [2019-10-22 08:58:03,674 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:03,674 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67600291] [2019-10-22 08:58:03,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,674 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,674 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:03,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:03,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:03,765 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67600291] [2019-10-22 08:58:03,765 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:03,766 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:58:03,766 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000139755] [2019-10-22 08:58:03,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:58:03,766 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:03,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:58:03,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:58:03,767 INFO L87 Difference]: Start difference. First operand 6038 states and 14311 transitions. Second operand 6 states. [2019-10-22 08:58:03,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:03,825 INFO L93 Difference]: Finished difference Result 7206 states and 17082 transitions. [2019-10-22 08:58:03,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:58:03,825 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 08:58:03,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:03,831 INFO L225 Difference]: With dead ends: 7206 [2019-10-22 08:58:03,831 INFO L226 Difference]: Without dead ends: 7206 [2019-10-22 08:58:03,831 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-10-22 08:58:03,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7206 states. [2019-10-22 08:58:03,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7206 to 5373. [2019-10-22 08:58:03,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5373 states. [2019-10-22 08:58:03,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5373 states to 5373 states and 12587 transitions. [2019-10-22 08:58:03,886 INFO L78 Accepts]: Start accepts. Automaton has 5373 states and 12587 transitions. Word has length 82 [2019-10-22 08:58:03,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:03,886 INFO L462 AbstractCegarLoop]: Abstraction has 5373 states and 12587 transitions. [2019-10-22 08:58:03,886 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:58:03,886 INFO L276 IsEmpty]: Start isEmpty. Operand 5373 states and 12587 transitions. [2019-10-22 08:58:03,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-10-22 08:58:03,890 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:03,890 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] [2019-10-22 08:58:03,890 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:03,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:03,890 INFO L82 PathProgramCache]: Analyzing trace with hash 35992483, now seen corresponding path program 1 times [2019-10-22 08:58:03,891 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:03,891 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947648175] [2019-10-22 08:58:03,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,891 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:03,891 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:03,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:03,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:03,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947648175] [2019-10-22 08:58:03,992 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:03,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:58:03,992 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132138966] [2019-10-22 08:58:03,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:58:03,996 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:03,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:58:03,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:58:03,996 INFO L87 Difference]: Start difference. First operand 5373 states and 12587 transitions. Second operand 6 states. [2019-10-22 08:58:04,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:04,105 INFO L93 Difference]: Finished difference Result 4989 states and 11419 transitions. [2019-10-22 08:58:04,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:58:04,106 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 82 [2019-10-22 08:58:04,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:04,109 INFO L225 Difference]: With dead ends: 4989 [2019-10-22 08:58:04,110 INFO L226 Difference]: Without dead ends: 4989 [2019-10-22 08:58:04,110 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-10-22 08:58:04,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4989 states. [2019-10-22 08:58:04,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4989 to 3166. [2019-10-22 08:58:04,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3166 states. [2019-10-22 08:58:04,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3166 states to 3166 states and 7283 transitions. [2019-10-22 08:58:04,146 INFO L78 Accepts]: Start accepts. Automaton has 3166 states and 7283 transitions. Word has length 82 [2019-10-22 08:58:04,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:04,146 INFO L462 AbstractCegarLoop]: Abstraction has 3166 states and 7283 transitions. [2019-10-22 08:58:04,146 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:58:04,146 INFO L276 IsEmpty]: Start isEmpty. Operand 3166 states and 7283 transitions. [2019-10-22 08:58:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:58:04,148 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:04,149 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] [2019-10-22 08:58:04,149 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:04,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:04,149 INFO L82 PathProgramCache]: Analyzing trace with hash -974894291, now seen corresponding path program 1 times [2019-10-22 08:58:04,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:04,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099873212] [2019-10-22 08:58:04,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:04,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:04,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:04,248 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099873212] [2019-10-22 08:58:04,248 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:04,248 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:58:04,248 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636896237] [2019-10-22 08:58:04,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:58:04,249 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:04,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:58:04,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:04,249 INFO L87 Difference]: Start difference. First operand 3166 states and 7283 transitions. Second operand 7 states. [2019-10-22 08:58:04,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:04,808 INFO L93 Difference]: Finished difference Result 3830 states and 8738 transitions. [2019-10-22 08:58:04,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-22 08:58:04,808 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-10-22 08:58:04,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:04,812 INFO L225 Difference]: With dead ends: 3830 [2019-10-22 08:58:04,812 INFO L226 Difference]: Without dead ends: 3796 [2019-10-22 08:58:04,813 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2019-10-22 08:58:04,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3796 states. [2019-10-22 08:58:04,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3796 to 3338. [2019-10-22 08:58:04,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3338 states. [2019-10-22 08:58:04,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3338 states to 3338 states and 7644 transitions. [2019-10-22 08:58:04,857 INFO L78 Accepts]: Start accepts. Automaton has 3338 states and 7644 transitions. Word has length 84 [2019-10-22 08:58:04,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:04,857 INFO L462 AbstractCegarLoop]: Abstraction has 3338 states and 7644 transitions. [2019-10-22 08:58:04,857 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:58:04,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3338 states and 7644 transitions. [2019-10-22 08:58:04,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:58:04,861 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:04,861 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] [2019-10-22 08:58:04,861 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:04,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:04,862 INFO L82 PathProgramCache]: Analyzing trace with hash -624094354, now seen corresponding path program 1 times [2019-10-22 08:58:04,862 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:04,862 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930468132] [2019-10-22 08:58:04,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,862 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:04,862 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:04,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:04,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:04,966 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930468132] [2019-10-22 08:58:04,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:04,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:58:04,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364939552] [2019-10-22 08:58:04,967 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:58:04,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:04,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:58:04,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:04,968 INFO L87 Difference]: Start difference. First operand 3338 states and 7644 transitions. Second operand 7 states. [2019-10-22 08:58:05,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:05,180 INFO L93 Difference]: Finished difference Result 3881 states and 8863 transitions. [2019-10-22 08:58:05,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:58:05,180 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-10-22 08:58:05,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:05,185 INFO L225 Difference]: With dead ends: 3881 [2019-10-22 08:58:05,185 INFO L226 Difference]: Without dead ends: 3881 [2019-10-22 08:58:05,185 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:58:05,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3881 states. [2019-10-22 08:58:05,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3881 to 3781. [2019-10-22 08:58:05,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3781 states. [2019-10-22 08:58:05,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3781 states to 3781 states and 8665 transitions. [2019-10-22 08:58:05,236 INFO L78 Accepts]: Start accepts. Automaton has 3781 states and 8665 transitions. Word has length 84 [2019-10-22 08:58:05,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:05,236 INFO L462 AbstractCegarLoop]: Abstraction has 3781 states and 8665 transitions. [2019-10-22 08:58:05,236 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:58:05,237 INFO L276 IsEmpty]: Start isEmpty. Operand 3781 states and 8665 transitions. [2019-10-22 08:58:05,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:58:05,241 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:05,241 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] [2019-10-22 08:58:05,242 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:05,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:05,242 INFO L82 PathProgramCache]: Analyzing trace with hash 263409327, now seen corresponding path program 1 times [2019-10-22 08:58:05,242 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:05,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263089398] [2019-10-22 08:58:05,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,242 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:05,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:05,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:05,355 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263089398] [2019-10-22 08:58:05,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:05,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:58:05,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292020788] [2019-10-22 08:58:05,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:58:05,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:05,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:58:05,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:05,357 INFO L87 Difference]: Start difference. First operand 3781 states and 8665 transitions. Second operand 7 states. [2019-10-22 08:58:05,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:05,436 INFO L93 Difference]: Finished difference Result 6388 states and 14770 transitions. [2019-10-22 08:58:05,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 08:58:05,436 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-10-22 08:58:05,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:05,439 INFO L225 Difference]: With dead ends: 6388 [2019-10-22 08:58:05,439 INFO L226 Difference]: Without dead ends: 2713 [2019-10-22 08:58:05,439 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:58:05,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2713 states. [2019-10-22 08:58:05,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2713 to 2713. [2019-10-22 08:58:05,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2713 states. [2019-10-22 08:58:05,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 6295 transitions. [2019-10-22 08:58:05,476 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 6295 transitions. Word has length 84 [2019-10-22 08:58:05,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:05,476 INFO L462 AbstractCegarLoop]: Abstraction has 2713 states and 6295 transitions. [2019-10-22 08:58:05,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:58:05,477 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 6295 transitions. [2019-10-22 08:58:05,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:58:05,480 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:05,480 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] [2019-10-22 08:58:05,480 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:05,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:05,481 INFO L82 PathProgramCache]: Analyzing trace with hash 1037747623, now seen corresponding path program 2 times [2019-10-22 08:58:05,481 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:05,481 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875619413] [2019-10-22 08:58:05,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:05,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:05,562 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875619413] [2019-10-22 08:58:05,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:05,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 08:58:05,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884724345] [2019-10-22 08:58:05,563 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-22 08:58:05,563 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:05,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-22 08:58:05,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-22 08:58:05,564 INFO L87 Difference]: Start difference. First operand 2713 states and 6295 transitions. Second operand 6 states. [2019-10-22 08:58:05,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:05,714 INFO L93 Difference]: Finished difference Result 2997 states and 6941 transitions. [2019-10-22 08:58:05,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-22 08:58:05,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 84 [2019-10-22 08:58:05,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:05,717 INFO L225 Difference]: With dead ends: 2997 [2019-10-22 08:58:05,717 INFO L226 Difference]: Without dead ends: 2997 [2019-10-22 08:58:05,717 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-10-22 08:58:05,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-10-22 08:58:05,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 2655. [2019-10-22 08:58:05,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2655 states. [2019-10-22 08:58:05,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 6173 transitions. [2019-10-22 08:58:05,738 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 6173 transitions. Word has length 84 [2019-10-22 08:58:05,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:05,739 INFO L462 AbstractCegarLoop]: Abstraction has 2655 states and 6173 transitions. [2019-10-22 08:58:05,739 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-22 08:58:05,739 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 6173 transitions. [2019-10-22 08:58:05,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:58:05,741 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:05,741 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] [2019-10-22 08:58:05,741 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:05,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:05,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1319103177, now seen corresponding path program 1 times [2019-10-22 08:58:05,741 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:05,742 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300156144] [2019-10-22 08:58:05,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,742 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:05,742 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:05,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:05,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:05,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300156144] [2019-10-22 08:58:05,910 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:05,910 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 08:58:05,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230389686] [2019-10-22 08:58:05,910 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-22 08:58:05,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:05,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-22 08:58:05,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2019-10-22 08:58:05,911 INFO L87 Difference]: Start difference. First operand 2655 states and 6173 transitions. Second operand 9 states. [2019-10-22 08:58:06,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:06,336 INFO L93 Difference]: Finished difference Result 3361 states and 7790 transitions. [2019-10-22 08:58:06,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:58:06,336 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 84 [2019-10-22 08:58:06,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:06,339 INFO L225 Difference]: With dead ends: 3361 [2019-10-22 08:58:06,339 INFO L226 Difference]: Without dead ends: 3361 [2019-10-22 08:58:06,339 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-10-22 08:58:06,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3361 states. [2019-10-22 08:58:06,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3361 to 2689. [2019-10-22 08:58:06,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2689 states. [2019-10-22 08:58:06,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2689 states to 2689 states and 6253 transitions. [2019-10-22 08:58:06,366 INFO L78 Accepts]: Start accepts. Automaton has 2689 states and 6253 transitions. Word has length 84 [2019-10-22 08:58:06,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:06,367 INFO L462 AbstractCegarLoop]: Abstraction has 2689 states and 6253 transitions. [2019-10-22 08:58:06,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-22 08:58:06,367 INFO L276 IsEmpty]: Start isEmpty. Operand 2689 states and 6253 transitions. [2019-10-22 08:58:06,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:58:06,369 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:06,369 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] [2019-10-22 08:58:06,369 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:06,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:06,369 INFO L82 PathProgramCache]: Analyzing trace with hash -2088360438, now seen corresponding path program 1 times [2019-10-22 08:58:06,370 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:06,370 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926479118] [2019-10-22 08:58:06,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,370 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:06,475 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926479118] [2019-10-22 08:58:06,475 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:06,475 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-22 08:58:06,475 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506544137] [2019-10-22 08:58:06,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 08:58:06,476 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:06,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 08:58:06,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-10-22 08:58:06,476 INFO L87 Difference]: Start difference. First operand 2689 states and 6253 transitions. Second operand 7 states. [2019-10-22 08:58:06,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:06,636 INFO L93 Difference]: Finished difference Result 2770 states and 6372 transitions. [2019-10-22 08:58:06,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-22 08:58:06,636 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 84 [2019-10-22 08:58:06,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:06,638 INFO L225 Difference]: With dead ends: 2770 [2019-10-22 08:58:06,638 INFO L226 Difference]: Without dead ends: 2770 [2019-10-22 08:58:06,639 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:58:06,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2019-10-22 08:58:06,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2655. [2019-10-22 08:58:06,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2655 states. [2019-10-22 08:58:06,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2655 states to 2655 states and 6142 transitions. [2019-10-22 08:58:06,661 INFO L78 Accepts]: Start accepts. Automaton has 2655 states and 6142 transitions. Word has length 84 [2019-10-22 08:58:06,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:06,661 INFO L462 AbstractCegarLoop]: Abstraction has 2655 states and 6142 transitions. [2019-10-22 08:58:06,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 08:58:06,661 INFO L276 IsEmpty]: Start isEmpty. Operand 2655 states and 6142 transitions. [2019-10-22 08:58:06,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:58:06,663 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:06,663 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] [2019-10-22 08:58:06,663 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:06,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:06,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1530454090, now seen corresponding path program 2 times [2019-10-22 08:58:06,664 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:06,664 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429933782] [2019-10-22 08:58:06,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,664 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:06,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:06,782 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:06,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429933782] [2019-10-22 08:58:06,783 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:06,783 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-22 08:58:06,783 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424949659] [2019-10-22 08:58:06,784 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-22 08:58:06,784 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:06,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-22 08:58:06,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-22 08:58:06,784 INFO L87 Difference]: Start difference. First operand 2655 states and 6142 transitions. Second operand 8 states. [2019-10-22 08:58:06,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:06,997 INFO L93 Difference]: Finished difference Result 3038 states and 7007 transitions. [2019-10-22 08:58:06,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 08:58:06,997 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2019-10-22 08:58:06,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:06,999 INFO L225 Difference]: With dead ends: 3038 [2019-10-22 08:58:06,999 INFO L226 Difference]: Without dead ends: 3038 [2019-10-22 08:58:06,999 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2019-10-22 08:58:07,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3038 states. [2019-10-22 08:58:07,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3038 to 2678. [2019-10-22 08:58:07,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2678 states. [2019-10-22 08:58:07,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2678 states to 2678 states and 6183 transitions. [2019-10-22 08:58:07,022 INFO L78 Accepts]: Start accepts. Automaton has 2678 states and 6183 transitions. Word has length 84 [2019-10-22 08:58:07,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:07,022 INFO L462 AbstractCegarLoop]: Abstraction has 2678 states and 6183 transitions. [2019-10-22 08:58:07,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-22 08:58:07,022 INFO L276 IsEmpty]: Start isEmpty. Operand 2678 states and 6183 transitions. [2019-10-22 08:58:07,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:58:07,024 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:07,024 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] [2019-10-22 08:58:07,024 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:07,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:07,025 INFO L82 PathProgramCache]: Analyzing trace with hash -1877009525, now seen corresponding path program 2 times [2019-10-22 08:58:07,025 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:07,025 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082992833] [2019-10-22 08:58:07,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,025 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,025 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 08:58:07,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 08:58:07,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082992833] [2019-10-22 08:58:07,126 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 08:58:07,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-22 08:58:07,127 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602468255] [2019-10-22 08:58:07,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 08:58:07,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 08:58:07,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 08:58:07,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-22 08:58:07,128 INFO L87 Difference]: Start difference. First operand 2678 states and 6183 transitions. Second operand 10 states. [2019-10-22 08:58:07,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 08:58:07,392 INFO L93 Difference]: Finished difference Result 4745 states and 11000 transitions. [2019-10-22 08:58:07,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-22 08:58:07,392 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 84 [2019-10-22 08:58:07,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 08:58:07,396 INFO L225 Difference]: With dead ends: 4745 [2019-10-22 08:58:07,396 INFO L226 Difference]: Without dead ends: 3041 [2019-10-22 08:58:07,397 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2019-10-22 08:58:07,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3041 states. [2019-10-22 08:58:07,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3041 to 2713. [2019-10-22 08:58:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2713 states. [2019-10-22 08:58:07,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2713 states to 2713 states and 6210 transitions. [2019-10-22 08:58:07,437 INFO L78 Accepts]: Start accepts. Automaton has 2713 states and 6210 transitions. Word has length 84 [2019-10-22 08:58:07,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 08:58:07,437 INFO L462 AbstractCegarLoop]: Abstraction has 2713 states and 6210 transitions. [2019-10-22 08:58:07,437 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 08:58:07,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2713 states and 6210 transitions. [2019-10-22 08:58:07,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-10-22 08:58:07,441 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 08:58:07,441 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] [2019-10-22 08:58:07,441 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 08:58:07,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 08:58:07,442 INFO L82 PathProgramCache]: Analyzing trace with hash 92723979, now seen corresponding path program 3 times [2019-10-22 08:58:07,442 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 08:58:07,442 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755946576] [2019-10-22 08:58:07,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,442 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 08:58:07,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 08:58:07,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 08:58:07,534 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 08:58:07,535 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-10-22 08:58:07,697 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-10-22 08:58:07,701 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 08:58:07 BasicIcfg [2019-10-22 08:58:07,702 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 08:58:07,702 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 08:58:07,702 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 08:58:07,703 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 08:58:07,703 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 08:57:37" (3/4) ... [2019-10-22 08:58:07,705 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-10-22 08:58:07,843 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_6d055ebc-8539-4835-a1ec-6bf0d40f387e/bin/uautomizer/witness.graphml [2019-10-22 08:58:07,845 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 08:58:07,847 INFO L168 Benchmark]: Toolchain (without parser) took 31629.55 ms. Allocated memory was 1.0 GB in the beginning and 4.0 GB in the end (delta: 2.9 GB). Free memory was 939.3 MB in the beginning and 2.5 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-10-22 08:58:07,848 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 08:58:07,848 INFO L168 Benchmark]: CACSL2BoogieTranslator took 728.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:07,849 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.88 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:07,849 INFO L168 Benchmark]: Boogie Preprocessor took 32.76 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:07,849 INFO L168 Benchmark]: RCFGBuilder took 629.98 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: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:07,849 INFO L168 Benchmark]: TraceAbstraction took 30038.27 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. [2019-10-22 08:58:07,850 INFO L168 Benchmark]: Witness Printer took 142.98 ms. Allocated memory is still 4.0 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. [2019-10-22 08:58:07,851 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.23 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 728.27 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 153.1 MB). Free memory was 939.3 MB in the beginning and 1.1 GB in the end (delta: -171.9 MB). Peak memory consumption was 22.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.88 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: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 32.76 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: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 629.98 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: 47.6 MB). Peak memory consumption was 47.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 30038.27 ms. Allocated memory was 1.2 GB in the beginning and 4.0 GB in the end (delta: 2.8 GB). Free memory was 1.1 GB in the beginning and 2.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.4 GB. Max. memory is 11.5 GB. * Witness Printer took 142.98 ms. Allocated memory is still 4.0 GB. Free memory was 2.5 GB in the beginning and 2.5 GB in the end (delta: 17.9 MB). Peak memory consumption was 17.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L695] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L697] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L699] 0 int __unbuffered_p1_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0] [L701] 0 int __unbuffered_p1_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0] [L702] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0] [L703] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L705] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L706] 0 _Bool x$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0] [L707] 0 int x$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0] [L708] 0 _Bool x$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0] [L709] 0 _Bool x$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0] [L710] 0 _Bool x$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0] [L711] 0 _Bool x$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L712] 0 _Bool x$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L713] 0 _Bool x$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L714] 0 _Bool x$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L715] 0 int *x$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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}] [L716] 0 int x$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L717] 0 _Bool x$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L718] 0 int x$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L719] 0 _Bool x$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L721] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, 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] [L722] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, 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] [L723] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L799] 0 pthread_t t1633; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L800] FCALL, FORK 0 pthread_create(&t1633, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L801] 0 pthread_t t1634; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L802] FCALL, FORK 0 pthread_create(&t1634, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, 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] [L757] 2 x$w_buff1 = x$w_buff0 [L758] 2 x$w_buff0 = 1 [L759] 2 x$w_buff1_used = x$w_buff0_used [L760] 2 x$w_buff0_used = (_Bool)1 [L5] COND FALSE 2 !(!expression) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L763] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L764] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L765] 2 x$r_buff0_thd2 = (_Bool)1 [L768] 2 y = 1 [L771] 2 __unbuffered_p1_EAX = y [L774] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L777] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L732] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L733] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L734] 1 x$flush_delayed = weak$$choice2 [L735] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L736] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L777] 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) [L778] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=1, x$flush_delayed=1, 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=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L778] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L736] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L779] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L779] 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 [L780] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] EXPR 1 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0))=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L737] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L738] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L738] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L739] EXPR 1 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used))=0, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L739] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L740] EXPR 1 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L740] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L741] EXPR 1 weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1))=0, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L741] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L742] EXPR 1 weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L742] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L743] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] EXPR 1 x$flush_delayed ? x$mem_tmp : x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=0, x$flush_delayed=1, x$flush_delayed ? x$mem_tmp : x=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L744] 1 x = x$flush_delayed ? x$mem_tmp : x [L745] 1 x$flush_delayed = (_Bool)0 [L750] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L780] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L781] 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, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L781] 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 [L784] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, 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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L804] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L808] 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) [L809] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L809] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L810] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L810] 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 [L811] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L811] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L812] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L812] 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 [L815] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] COND TRUE 0 !expression VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L5] 0 __VERIFIER_error() VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=5, weak$$choice2=1, x=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=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 199 locations, 3 error locations. Result: UNSAFE, OverallTime: 29.8s, OverallIterations: 32, TraceHistogramMax: 1, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8139 SDtfs, 9128 SDslu, 19473 SDs, 0 SdLazy, 6931 SolverSat, 404 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 301 GetRequests, 79 SyntacticMatches, 20 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61472occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.6s AutomataMinimizationTime, 31 MinimizatonAttempts, 72976 StatesRemovedByMinimization, 29 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 2216 NumberOfCodeBlocks, 2216 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 2101 ConstructedInterpolants, 0 QuantifiedInterpolants, 410924 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 31 InterpolantComputations, 31 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...