./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_1e4b678a-fc19-4181-8b5d-e69cf97b7932/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_1e4b678a-fc19-4181-8b5d-e69cf97b7932/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_1e4b678a-fc19-4181-8b5d-e69cf97b7932/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_1e4b678a-fc19-4181-8b5d-e69cf97b7932/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_1e4b678a-fc19-4181-8b5d-e69cf97b7932/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_1e4b678a-fc19-4181-8b5d-e69cf97b7932/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 59598ef74ac7afb6c962e2cc2ba26af488759b7c ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 23:34:31,383 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 23:34:31,385 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 23:34:31,398 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 23:34:31,399 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 23:34:31,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 23:34:31,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 23:34:31,410 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 23:34:31,414 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 23:34:31,419 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 23:34:31,420 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 23:34:31,421 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 23:34:31,421 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 23:34:31,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 23:34:31,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 23:34:31,425 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 23:34:31,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 23:34:31,426 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 23:34:31,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 23:34:31,432 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 23:34:31,434 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 23:34:31,436 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 23:34:31,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 23:34:31,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 23:34:31,441 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 23:34:31,441 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 23:34:31,441 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 23:34:31,443 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 23:34:31,443 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 23:34:31,444 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 23:34:31,444 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 23:34:31,445 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 23:34:31,446 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 23:34:31,446 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 23:34:31,447 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 23:34:31,448 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 23:34:31,448 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 23:34:31,449 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 23:34:31,449 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 23:34:31,450 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 23:34:31,450 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 23:34:31,451 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_1e4b678a-fc19-4181-8b5d-e69cf97b7932/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 23:34:31,474 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 23:34:31,484 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 23:34:31,485 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 23:34:31,486 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 23:34:31,486 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 23:34:31,486 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 23:34:31,487 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 23:34:31,487 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 23:34:31,487 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 23:34:31,487 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 23:34:31,487 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 23:34:31,488 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 23:34:31,488 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 23:34:31,488 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 23:34:31,488 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 23:34:31,489 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 23:34:31,490 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 23:34:31,490 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 23:34:31,490 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 23:34:31,490 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 23:34:31,491 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 23:34:31,491 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:34:31,491 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 23:34:31,491 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 23:34:31,491 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 23:34:31,492 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 23:34:31,492 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 23:34:31,492 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 23:34:31,492 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_1e4b678a-fc19-4181-8b5d-e69cf97b7932/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 -> 59598ef74ac7afb6c962e2cc2ba26af488759b7c [2019-11-15 23:34:31,522 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 23:34:31,531 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 23:34:31,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 23:34:31,538 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 23:34:31,538 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 23:34:31,539 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_1e4b678a-fc19-4181-8b5d-e69cf97b7932/bin/uautomizer/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-11-15 23:34:31,593 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1e4b678a-fc19-4181-8b5d-e69cf97b7932/bin/uautomizer/data/4cbc24ec6/1bf3b98bc9ab4e219a1fcc6258354293/FLAG723b65efa [2019-11-15 23:34:31,990 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 23:34:31,990 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_1e4b678a-fc19-4181-8b5d-e69cf97b7932/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2019-11-15 23:34:32,002 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_1e4b678a-fc19-4181-8b5d-e69cf97b7932/bin/uautomizer/data/4cbc24ec6/1bf3b98bc9ab4e219a1fcc6258354293/FLAG723b65efa [2019-11-15 23:34:32,382 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_1e4b678a-fc19-4181-8b5d-e69cf97b7932/bin/uautomizer/data/4cbc24ec6/1bf3b98bc9ab4e219a1fcc6258354293 [2019-11-15 23:34:32,384 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 23:34:32,386 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 23:34:32,386 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 23:34:32,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 23:34:32,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 23:34:32,390 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:34:32" (1/1) ... [2019-11-15 23:34:32,393 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b38c14d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:32, skipping insertion in model container [2019-11-15 23:34:32,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 11:34:32" (1/1) ... [2019-11-15 23:34:32,399 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 23:34:32,423 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 23:34:32,646 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:34:32,656 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 23:34:32,694 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 23:34:32,715 INFO L192 MainTranslator]: Completed translation [2019-11-15 23:34:32,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:32 WrapperNode [2019-11-15 23:34:32,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 23:34:32,719 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 23:34:32,719 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 23:34:32,719 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 23:34:32,727 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:32" (1/1) ... [2019-11-15 23:34:32,740 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:32" (1/1) ... [2019-11-15 23:34:32,774 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 23:34:32,774 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 23:34:32,774 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 23:34:32,775 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 23:34:32,783 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:32" (1/1) ... [2019-11-15 23:34:32,783 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:32" (1/1) ... [2019-11-15 23:34:32,785 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:32" (1/1) ... [2019-11-15 23:34:32,786 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:32" (1/1) ... [2019-11-15 23:34:32,793 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:32" (1/1) ... [2019-11-15 23:34:32,801 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:32" (1/1) ... [2019-11-15 23:34:32,804 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:32" (1/1) ... [2019-11-15 23:34:32,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 23:34:32,809 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 23:34:32,809 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 23:34:32,809 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 23:34:32,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_1e4b678a-fc19-4181-8b5d-e69cf97b7932/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 23:34:32,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 23:34:32,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 23:34:33,542 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 23:34:33,543 INFO L284 CfgBuilder]: Removed 82 assume(true) statements. [2019-11-15 23:34:33,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:34:33 BoogieIcfgContainer [2019-11-15 23:34:33,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 23:34:33,545 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 23:34:33,545 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 23:34:33,548 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 23:34:33,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 11:34:32" (1/3) ... [2019-11-15 23:34:33,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3167e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:34:33, skipping insertion in model container [2019-11-15 23:34:33,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 11:34:32" (2/3) ... [2019-11-15 23:34:33,550 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3167e33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 11:34:33, skipping insertion in model container [2019-11-15 23:34:33,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:34:33" (3/3) ... [2019-11-15 23:34:33,552 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2019-11-15 23:34:33,561 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 23:34:33,569 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-15 23:34:33,580 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-15 23:34:33,619 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 23:34:33,619 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 23:34:33,619 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 23:34:33,619 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 23:34:33,620 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 23:34:33,620 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 23:34:33,620 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 23:34:33,620 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 23:34:33,651 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2019-11-15 23:34:33,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:34:33,664 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:33,665 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] [2019-11-15 23:34:33,666 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:33,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:33,672 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2019-11-15 23:34:33,679 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:33,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803165476] [2019-11-15 23:34:33,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:33,680 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:33,680 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:33,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:33,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:33,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803165476] [2019-11-15 23:34:33,836 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:33,836 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:34:33,836 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907764021] [2019-11-15 23:34:33,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:34:33,841 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:33,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:34:33,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:33,856 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2019-11-15 23:34:33,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:33,908 INFO L93 Difference]: Finished difference Result 291 states and 455 transitions. [2019-11-15 23:34:33,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:34:33,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 23:34:33,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:33,920 INFO L225 Difference]: With dead ends: 291 [2019-11-15 23:34:33,920 INFO L226 Difference]: Without dead ends: 144 [2019-11-15 23:34:33,924 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:33,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2019-11-15 23:34:33,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2019-11-15 23:34:33,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2019-11-15 23:34:33,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2019-11-15 23:34:33,966 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 39 [2019-11-15 23:34:33,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:33,967 INFO L462 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2019-11-15 23:34:33,967 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:34:33,967 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2019-11-15 23:34:33,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:34:33,969 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:33,969 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] [2019-11-15 23:34:33,969 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:33,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:33,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2019-11-15 23:34:33,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:33,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922278566] [2019-11-15 23:34:33,970 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:33,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:33,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:34,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:34,004 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922278566] [2019-11-15 23:34:34,004 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:34,004 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:34:34,004 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835551564] [2019-11-15 23:34:34,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:34:34,006 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:34,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:34:34,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:34,006 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand 3 states. [2019-11-15 23:34:34,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:34,104 INFO L93 Difference]: Finished difference Result 384 states and 576 transitions. [2019-11-15 23:34:34,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:34:34,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 23:34:34,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:34,107 INFO L225 Difference]: With dead ends: 384 [2019-11-15 23:34:34,107 INFO L226 Difference]: Without dead ends: 246 [2019-11-15 23:34:34,109 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:34,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2019-11-15 23:34:34,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2019-11-15 23:34:34,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-15 23:34:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 362 transitions. [2019-11-15 23:34:34,135 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 362 transitions. Word has length 39 [2019-11-15 23:34:34,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:34,136 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 362 transitions. [2019-11-15 23:34:34,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:34:34,136 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 362 transitions. [2019-11-15 23:34:34,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:34:34,137 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:34,138 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] [2019-11-15 23:34:34,138 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:34,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:34,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2019-11-15 23:34:34,139 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:34,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195776176] [2019-11-15 23:34:34,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:34,139 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:34,139 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:34,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:34,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:34,179 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195776176] [2019-11-15 23:34:34,179 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:34,179 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:34:34,179 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414540041] [2019-11-15 23:34:34,180 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:34:34,180 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:34,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:34:34,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:34,181 INFO L87 Difference]: Start difference. First operand 242 states and 362 transitions. Second operand 3 states. [2019-11-15 23:34:34,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:34,219 INFO L93 Difference]: Finished difference Result 477 states and 715 transitions. [2019-11-15 23:34:34,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:34:34,220 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 23:34:34,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:34,222 INFO L225 Difference]: With dead ends: 477 [2019-11-15 23:34:34,222 INFO L226 Difference]: Without dead ends: 242 [2019-11-15 23:34:34,224 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:34,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-15 23:34:34,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-15 23:34:34,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-15 23:34:34,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 354 transitions. [2019-11-15 23:34:34,247 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 354 transitions. Word has length 39 [2019-11-15 23:34:34,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:34,247 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 354 transitions. [2019-11-15 23:34:34,247 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:34:34,247 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 354 transitions. [2019-11-15 23:34:34,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:34:34,249 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:34,249 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:34,249 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:34,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:34,250 INFO L82 PathProgramCache]: Analyzing trace with hash -5694440, now seen corresponding path program 1 times [2019-11-15 23:34:34,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:34,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057899014] [2019-11-15 23:34:34,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:34,251 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:34,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:34,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:34,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:34,279 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057899014] [2019-11-15 23:34:34,279 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:34,279 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:34:34,279 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503273394] [2019-11-15 23:34:34,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:34:34,280 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:34,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:34:34,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:34,280 INFO L87 Difference]: Start difference. First operand 242 states and 354 transitions. Second operand 3 states. [2019-11-15 23:34:34,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:34,327 INFO L93 Difference]: Finished difference Result 476 states and 698 transitions. [2019-11-15 23:34:34,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:34:34,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 23:34:34,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:34,330 INFO L225 Difference]: With dead ends: 476 [2019-11-15 23:34:34,330 INFO L226 Difference]: Without dead ends: 242 [2019-11-15 23:34:34,332 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:34,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-15 23:34:34,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-15 23:34:34,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-15 23:34:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 340 transitions. [2019-11-15 23:34:34,355 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 340 transitions. Word has length 39 [2019-11-15 23:34:34,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:34,355 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 340 transitions. [2019-11-15 23:34:34,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:34:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 340 transitions. [2019-11-15 23:34:34,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:34:34,356 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:34,356 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] [2019-11-15 23:34:34,357 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:34,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:34,357 INFO L82 PathProgramCache]: Analyzing trace with hash -752003180, now seen corresponding path program 1 times [2019-11-15 23:34:34,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:34,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376134229] [2019-11-15 23:34:34,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:34,358 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:34,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:34,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:34,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:34,402 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376134229] [2019-11-15 23:34:34,402 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:34,402 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:34:34,402 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836393586] [2019-11-15 23:34:34,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:34:34,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:34,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:34:34,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:34,404 INFO L87 Difference]: Start difference. First operand 242 states and 340 transitions. Second operand 3 states. [2019-11-15 23:34:34,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:34,446 INFO L93 Difference]: Finished difference Result 475 states and 669 transitions. [2019-11-15 23:34:34,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:34:34,447 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 23:34:34,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:34,449 INFO L225 Difference]: With dead ends: 475 [2019-11-15 23:34:34,449 INFO L226 Difference]: Without dead ends: 242 [2019-11-15 23:34:34,450 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:34,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2019-11-15 23:34:34,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2019-11-15 23:34:34,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2019-11-15 23:34:34,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 326 transitions. [2019-11-15 23:34:34,467 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 326 transitions. Word has length 39 [2019-11-15 23:34:34,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:34,467 INFO L462 AbstractCegarLoop]: Abstraction has 242 states and 326 transitions. [2019-11-15 23:34:34,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:34:34,467 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 326 transitions. [2019-11-15 23:34:34,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-11-15 23:34:34,469 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:34,469 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] [2019-11-15 23:34:34,469 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:34,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:34,470 INFO L82 PathProgramCache]: Analyzing trace with hash 729577623, now seen corresponding path program 1 times [2019-11-15 23:34:34,470 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:34,470 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061907526] [2019-11-15 23:34:34,470 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:34,471 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:34,471 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:34,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:34,530 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:34,530 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061907526] [2019-11-15 23:34:34,530 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:34,530 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 23:34:34,531 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693252300] [2019-11-15 23:34:34,531 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:34:34,531 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:34,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:34:34,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:34,532 INFO L87 Difference]: Start difference. First operand 242 states and 326 transitions. Second operand 3 states. [2019-11-15 23:34:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:34,606 INFO L93 Difference]: Finished difference Result 662 states and 893 transitions. [2019-11-15 23:34:34,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:34:34,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-11-15 23:34:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:34,611 INFO L225 Difference]: With dead ends: 662 [2019-11-15 23:34:34,612 INFO L226 Difference]: Without dead ends: 431 [2019-11-15 23:34:34,613 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:34,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2019-11-15 23:34:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 407. [2019-11-15 23:34:34,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2019-11-15 23:34:34,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 538 transitions. [2019-11-15 23:34:34,644 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 538 transitions. Word has length 39 [2019-11-15 23:34:34,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:34,645 INFO L462 AbstractCegarLoop]: Abstraction has 407 states and 538 transitions. [2019-11-15 23:34:34,645 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:34:34,646 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 538 transitions. [2019-11-15 23:34:34,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 23:34:34,652 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:34,653 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:34,653 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:34,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:34,660 INFO L82 PathProgramCache]: Analyzing trace with hash 407580417, now seen corresponding path program 1 times [2019-11-15 23:34:34,660 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:34,660 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749966178] [2019-11-15 23:34:34,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:34,661 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:34,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:34,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:34,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749966178] [2019-11-15 23:34:34,774 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:34,774 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:34:34,774 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647975074] [2019-11-15 23:34:34,775 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:34:34,775 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:34,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:34:34,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:34:34,776 INFO L87 Difference]: Start difference. First operand 407 states and 538 transitions. Second operand 5 states. [2019-11-15 23:34:34,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:34,893 INFO L93 Difference]: Finished difference Result 985 states and 1321 transitions. [2019-11-15 23:34:34,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:34:34,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-11-15 23:34:34,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:34,897 INFO L225 Difference]: With dead ends: 985 [2019-11-15 23:34:34,898 INFO L226 Difference]: Without dead ends: 593 [2019-11-15 23:34:34,899 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:34:34,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-11-15 23:34:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 413. [2019-11-15 23:34:34,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2019-11-15 23:34:34,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 533 transitions. [2019-11-15 23:34:34,930 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 533 transitions. Word has length 63 [2019-11-15 23:34:34,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:34,931 INFO L462 AbstractCegarLoop]: Abstraction has 413 states and 533 transitions. [2019-11-15 23:34:34,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:34:34,931 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 533 transitions. [2019-11-15 23:34:34,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 23:34:34,932 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:34,933 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:34,933 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:34,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:34,933 INFO L82 PathProgramCache]: Analyzing trace with hash 830282243, now seen corresponding path program 1 times [2019-11-15 23:34:34,934 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:34,934 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175000757] [2019-11-15 23:34:34,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:34,934 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:34,935 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:34,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:34,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175000757] [2019-11-15 23:34:34,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:34,994 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:34:34,994 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555605834] [2019-11-15 23:34:34,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:34:34,995 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:34,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:34:34,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:34,995 INFO L87 Difference]: Start difference. First operand 413 states and 533 transitions. Second operand 3 states. [2019-11-15 23:34:35,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:35,075 INFO L93 Difference]: Finished difference Result 1143 states and 1486 transitions. [2019-11-15 23:34:35,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:34:35,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-15 23:34:35,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:35,081 INFO L225 Difference]: With dead ends: 1143 [2019-11-15 23:34:35,081 INFO L226 Difference]: Without dead ends: 747 [2019-11-15 23:34:35,082 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:35,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 747 states. [2019-11-15 23:34:35,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 747 to 715. [2019-11-15 23:34:35,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 715 states. [2019-11-15 23:34:35,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 925 transitions. [2019-11-15 23:34:35,132 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 925 transitions. Word has length 63 [2019-11-15 23:34:35,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:35,133 INFO L462 AbstractCegarLoop]: Abstraction has 715 states and 925 transitions. [2019-11-15 23:34:35,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:34:35,133 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 925 transitions. [2019-11-15 23:34:35,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 23:34:35,134 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:35,134 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:35,134 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:35,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:35,135 INFO L82 PathProgramCache]: Analyzing trace with hash 1821446916, now seen corresponding path program 1 times [2019-11-15 23:34:35,135 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:35,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900243531] [2019-11-15 23:34:35,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:35,136 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:35,136 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:35,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:35,203 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900243531] [2019-11-15 23:34:35,203 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:35,203 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 23:34:35,204 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727816315] [2019-11-15 23:34:35,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 23:34:35,204 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:35,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 23:34:35,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 23:34:35,205 INFO L87 Difference]: Start difference. First operand 715 states and 925 transitions. Second operand 5 states. [2019-11-15 23:34:35,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:35,346 INFO L93 Difference]: Finished difference Result 1617 states and 2113 transitions. [2019-11-15 23:34:35,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 23:34:35,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2019-11-15 23:34:35,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:35,352 INFO L225 Difference]: With dead ends: 1617 [2019-11-15 23:34:35,353 INFO L226 Difference]: Without dead ends: 923 [2019-11-15 23:34:35,354 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 23:34:35,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 923 states. [2019-11-15 23:34:35,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 923 to 721. [2019-11-15 23:34:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2019-11-15 23:34:35,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 912 transitions. [2019-11-15 23:34:35,422 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 912 transitions. Word has length 63 [2019-11-15 23:34:35,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:35,422 INFO L462 AbstractCegarLoop]: Abstraction has 721 states and 912 transitions. [2019-11-15 23:34:35,422 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 23:34:35,422 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 912 transitions. [2019-11-15 23:34:35,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-11-15 23:34:35,423 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:35,424 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:35,424 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:35,424 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:35,424 INFO L82 PathProgramCache]: Analyzing trace with hash -355810040, now seen corresponding path program 1 times [2019-11-15 23:34:35,424 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:35,425 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992339046] [2019-11-15 23:34:35,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:35,425 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:35,425 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:35,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:35,456 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:35,457 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992339046] [2019-11-15 23:34:35,457 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:35,457 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:34:35,457 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606174784] [2019-11-15 23:34:35,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:34:35,458 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:35,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:34:35,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:35,458 INFO L87 Difference]: Start difference. First operand 721 states and 912 transitions. Second operand 3 states. [2019-11-15 23:34:35,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:35,557 INFO L93 Difference]: Finished difference Result 2017 states and 2558 transitions. [2019-11-15 23:34:35,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:34:35,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-11-15 23:34:35,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:35,565 INFO L225 Difference]: With dead ends: 2017 [2019-11-15 23:34:35,565 INFO L226 Difference]: Without dead ends: 1321 [2019-11-15 23:34:35,566 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:35,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1321 states. [2019-11-15 23:34:35,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1321 to 1317. [2019-11-15 23:34:35,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1317 states. [2019-11-15 23:34:35,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1317 states to 1317 states and 1638 transitions. [2019-11-15 23:34:35,643 INFO L78 Accepts]: Start accepts. Automaton has 1317 states and 1638 transitions. Word has length 63 [2019-11-15 23:34:35,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:35,643 INFO L462 AbstractCegarLoop]: Abstraction has 1317 states and 1638 transitions. [2019-11-15 23:34:35,643 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:34:35,644 INFO L276 IsEmpty]: Start isEmpty. Operand 1317 states and 1638 transitions. [2019-11-15 23:34:35,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-11-15 23:34:35,645 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:35,645 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:35,645 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:35,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:35,645 INFO L82 PathProgramCache]: Analyzing trace with hash 801765960, now seen corresponding path program 1 times [2019-11-15 23:34:35,646 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:35,646 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059559796] [2019-11-15 23:34:35,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:35,646 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:35,646 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:35,677 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:35,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059559796] [2019-11-15 23:34:35,677 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:35,677 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:34:35,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581637016] [2019-11-15 23:34:35,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:34:35,678 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:35,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:34:35,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:35,679 INFO L87 Difference]: Start difference. First operand 1317 states and 1638 transitions. Second operand 3 states. [2019-11-15 23:34:35,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:35,840 INFO L93 Difference]: Finished difference Result 3670 states and 4533 transitions. [2019-11-15 23:34:35,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:34:35,841 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-11-15 23:34:35,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:35,851 INFO L225 Difference]: With dead ends: 3670 [2019-11-15 23:34:35,852 INFO L226 Difference]: Without dead ends: 1847 [2019-11-15 23:34:35,854 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:35,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1847 states. [2019-11-15 23:34:35,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1847 to 1847. [2019-11-15 23:34:35,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1847 states. [2019-11-15 23:34:35,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1847 states to 1847 states and 2255 transitions. [2019-11-15 23:34:35,959 INFO L78 Accepts]: Start accepts. Automaton has 1847 states and 2255 transitions. Word has length 64 [2019-11-15 23:34:35,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:35,960 INFO L462 AbstractCegarLoop]: Abstraction has 1847 states and 2255 transitions. [2019-11-15 23:34:35,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:34:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 1847 states and 2255 transitions. [2019-11-15 23:34:35,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-15 23:34:35,964 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:35,965 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:35,965 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:35,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:35,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1159062640, now seen corresponding path program 1 times [2019-11-15 23:34:35,965 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:35,966 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194636526] [2019-11-15 23:34:35,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:35,966 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:35,966 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:35,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:36,008 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-11-15 23:34:36,008 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194636526] [2019-11-15 23:34:36,008 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:36,009 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:34:36,009 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312802295] [2019-11-15 23:34:36,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:34:36,009 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:36,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:34:36,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:36,010 INFO L87 Difference]: Start difference. First operand 1847 states and 2255 transitions. Second operand 3 states. [2019-11-15 23:34:36,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:36,128 INFO L93 Difference]: Finished difference Result 3621 states and 4413 transitions. [2019-11-15 23:34:36,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:34:36,129 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-15 23:34:36,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:36,139 INFO L225 Difference]: With dead ends: 3621 [2019-11-15 23:34:36,139 INFO L226 Difference]: Without dead ends: 1799 [2019-11-15 23:34:36,142 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:36,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1799 states. [2019-11-15 23:34:36,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1799 to 1799. [2019-11-15 23:34:36,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1799 states. [2019-11-15 23:34:36,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1799 states to 1799 states and 2119 transitions. [2019-11-15 23:34:36,253 INFO L78 Accepts]: Start accepts. Automaton has 1799 states and 2119 transitions. Word has length 93 [2019-11-15 23:34:36,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:36,253 INFO L462 AbstractCegarLoop]: Abstraction has 1799 states and 2119 transitions. [2019-11-15 23:34:36,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:34:36,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1799 states and 2119 transitions. [2019-11-15 23:34:36,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:34:36,256 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:36,256 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:36,256 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:36,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:36,257 INFO L82 PathProgramCache]: Analyzing trace with hash -2067380816, now seen corresponding path program 1 times [2019-11-15 23:34:36,257 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:36,257 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219035536] [2019-11-15 23:34:36,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:36,258 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:36,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:36,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:36,307 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 23:34:36,307 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219035536] [2019-11-15 23:34:36,307 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:36,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:34:36,308 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990689744] [2019-11-15 23:34:36,308 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:34:36,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:36,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:34:36,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:36,310 INFO L87 Difference]: Start difference. First operand 1799 states and 2119 transitions. Second operand 3 states. [2019-11-15 23:34:36,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:36,442 INFO L93 Difference]: Finished difference Result 3078 states and 3607 transitions. [2019-11-15 23:34:36,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:34:36,443 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-15 23:34:36,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:36,447 INFO L225 Difference]: With dead ends: 3078 [2019-11-15 23:34:36,448 INFO L226 Difference]: Without dead ends: 724 [2019-11-15 23:34:36,450 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:36,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 724 states. [2019-11-15 23:34:36,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 724 to 716. [2019-11-15 23:34:36,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2019-11-15 23:34:36,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 806 transitions. [2019-11-15 23:34:36,488 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 806 transitions. Word has length 94 [2019-11-15 23:34:36,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:36,488 INFO L462 AbstractCegarLoop]: Abstraction has 716 states and 806 transitions. [2019-11-15 23:34:36,488 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:34:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 806 transitions. [2019-11-15 23:34:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-11-15 23:34:36,490 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:36,490 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:36,490 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:36,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:36,491 INFO L82 PathProgramCache]: Analyzing trace with hash -899403247, now seen corresponding path program 1 times [2019-11-15 23:34:36,491 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:36,491 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323643804] [2019-11-15 23:34:36,491 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:36,492 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:36,492 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:36,531 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 23:34:36,531 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323643804] [2019-11-15 23:34:36,532 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:36,532 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:34:36,532 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371336673] [2019-11-15 23:34:36,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:34:36,533 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:36,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:34:36,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:36,533 INFO L87 Difference]: Start difference. First operand 716 states and 806 transitions. Second operand 3 states. [2019-11-15 23:34:36,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:36,588 INFO L93 Difference]: Finished difference Result 1048 states and 1187 transitions. [2019-11-15 23:34:36,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:34:36,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2019-11-15 23:34:36,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:36,592 INFO L225 Difference]: With dead ends: 1048 [2019-11-15 23:34:36,592 INFO L226 Difference]: Without dead ends: 594 [2019-11-15 23:34:36,593 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:36,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2019-11-15 23:34:36,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2019-11-15 23:34:36,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-11-15 23:34:36,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 662 transitions. [2019-11-15 23:34:36,629 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 662 transitions. Word has length 94 [2019-11-15 23:34:36,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:36,630 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 662 transitions. [2019-11-15 23:34:36,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:34:36,630 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 662 transitions. [2019-11-15 23:34:36,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-11-15 23:34:36,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:36,632 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:36,632 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:36,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:36,633 INFO L82 PathProgramCache]: Analyzing trace with hash -1716798106, now seen corresponding path program 1 times [2019-11-15 23:34:36,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:36,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313375965] [2019-11-15 23:34:36,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:36,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:36,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 23:34:36,722 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313375965] [2019-11-15 23:34:36,722 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:36,723 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 23:34:36,723 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764492499] [2019-11-15 23:34:36,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 23:34:36,724 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:36,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 23:34:36,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:34:36,724 INFO L87 Difference]: Start difference. First operand 594 states and 662 transitions. Second operand 4 states. [2019-11-15 23:34:36,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:36,778 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2019-11-15 23:34:36,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 23:34:36,779 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2019-11-15 23:34:36,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:36,783 INFO L225 Difference]: With dead ends: 598 [2019-11-15 23:34:36,783 INFO L226 Difference]: Without dead ends: 596 [2019-11-15 23:34:36,784 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 23:34:36,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-11-15 23:34:36,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 592. [2019-11-15 23:34:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2019-11-15 23:34:36,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 659 transitions. [2019-11-15 23:34:36,825 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 659 transitions. Word has length 95 [2019-11-15 23:34:36,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:36,826 INFO L462 AbstractCegarLoop]: Abstraction has 592 states and 659 transitions. [2019-11-15 23:34:36,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 23:34:36,826 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 659 transitions. [2019-11-15 23:34:36,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-15 23:34:36,827 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:36,828 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:36,828 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:36,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:36,829 INFO L82 PathProgramCache]: Analyzing trace with hash 1152111348, now seen corresponding path program 1 times [2019-11-15 23:34:36,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:36,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779095165] [2019-11-15 23:34:36,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:36,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:36,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:36,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 23:34:36,858 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-15 23:34:36,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779095165] [2019-11-15 23:34:36,859 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 23:34:36,859 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 23:34:36,859 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436623510] [2019-11-15 23:34:36,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 23:34:36,860 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 23:34:36,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 23:34:36,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:36,860 INFO L87 Difference]: Start difference. First operand 592 states and 659 transitions. Second operand 3 states. [2019-11-15 23:34:36,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 23:34:36,924 INFO L93 Difference]: Finished difference Result 1230 states and 1372 transitions. [2019-11-15 23:34:36,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 23:34:36,924 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-15 23:34:36,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 23:34:36,929 INFO L225 Difference]: With dead ends: 1230 [2019-11-15 23:34:36,929 INFO L226 Difference]: Without dead ends: 900 [2019-11-15 23:34:36,930 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 23:34:36,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2019-11-15 23:34:36,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 594. [2019-11-15 23:34:36,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-11-15 23:34:36,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 661 transitions. [2019-11-15 23:34:36,970 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 661 transitions. Word has length 99 [2019-11-15 23:34:36,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 23:34:36,971 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 661 transitions. [2019-11-15 23:34:36,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 23:34:36,971 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 661 transitions. [2019-11-15 23:34:36,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-15 23:34:36,972 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 23:34:36,972 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 23:34:36,973 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 23:34:36,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 23:34:36,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1118276470, now seen corresponding path program 1 times [2019-11-15 23:34:36,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 23:34:36,973 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042957013] [2019-11-15 23:34:36,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:36,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 23:34:36,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 23:34:36,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:34:37,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 23:34:37,033 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 23:34:37,033 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 23:34:37,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 11:34:37 BoogieIcfgContainer [2019-11-15 23:34:37,115 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 23:34:37,116 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 23:34:37,116 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 23:34:37,116 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 23:34:37,116 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 11:34:33" (3/4) ... [2019-11-15 23:34:37,118 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 23:34:37,268 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_1e4b678a-fc19-4181-8b5d-e69cf97b7932/bin/uautomizer/witness.graphml [2019-11-15 23:34:37,268 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 23:34:37,270 INFO L168 Benchmark]: Toolchain (without parser) took 4884.29 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.7 MB). Free memory was 950.1 MB in the beginning and 1.1 GB in the end (delta: -117.5 MB). Peak memory consumption was 200.2 MB. Max. memory is 11.5 GB. [2019-11-15 23:34:37,270 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:34:37,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -228.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. [2019-11-15 23:34:37,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:34:37,272 INFO L168 Benchmark]: Boogie Preprocessor took 34.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 23:34:37,272 INFO L168 Benchmark]: RCFGBuilder took 735.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. [2019-11-15 23:34:37,272 INFO L168 Benchmark]: TraceAbstraction took 3570.25 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 130.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.2 MB). Peak memory consumption was 177.7 MB. Max. memory is 11.5 GB. [2019-11-15 23:34:37,273 INFO L168 Benchmark]: Witness Printer took 152.98 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. [2019-11-15 23:34:37,276 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 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 332.14 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 187.2 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -228.0 MB). Peak memory consumption was 23.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 55.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 34.21 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 735.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 45.3 MB). Peak memory consumption was 45.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3570.25 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 130.5 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 47.2 MB). Peak memory consumption was 177.7 MB. Max. memory is 11.5 GB. * Witness Printer took 152.98 ms. Allocated memory is still 1.3 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 11.6 MB). Peak memory consumption was 11.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int m_st ; [L17] int t1_st ; [L18] int m_i ; [L19] int t1_i ; [L20] int M_E = 2; [L21] int T1_E = 2; [L22] int E_M = 2; [L23] int E_1 = 2; [L27] int token ; [L29] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L475] int __retres1 ; [L390] m_i = 1 [L391] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L416] int kernel_st ; [L417] int tmp ; [L418] int tmp___0 ; [L422] kernel_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L172] COND TRUE m_i == 1 [L173] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L177] COND TRUE t1_i == 1 [L178] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L261] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L266] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L271] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L276] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L126] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L142] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L145] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L289] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L294] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L299] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L304] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L430] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L433] kernel_st = 1 [L208] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L187] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L203] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L90] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L101] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L187] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L203] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L45] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L48] token = __VERIFIER_nondet_int() [L49] local = token [L50] E_1 = 1 [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L126] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L136] __retres1 = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L319] tmp = is_master_triggered() [L321] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L142] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L145] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L146] COND TRUE E_1 == 1 [L147] __retres1 = 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L157] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L327] tmp___0 = is_transmit1_triggered() [L329] COND TRUE \read(tmp___0) [L330] t1_st = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L52] E_1 = 2 [L53] m_pc = 1 [L54] m_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L236] COND TRUE t1_st == 0 [L237] int tmp_ndt_2; [L238] tmp_ndt_2 = __VERIFIER_nondet_int() [L239] COND TRUE \read(tmp_ndt_2) [L241] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L90] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L93] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L109] token += 1 [L110] E_M = 1 [L314] int tmp ; [L315] int tmp___0 ; [L123] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L126] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L127] COND TRUE E_M == 1 [L128] __retres1 = 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L138] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L319] tmp = is_master_triggered() [L321] COND TRUE \read(tmp) [L322] m_st = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L142] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L145] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L146] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L155] __retres1 = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L327] tmp___0 = is_transmit1_triggered() [L329] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L112] E_M = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L101] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] t1_pc = 1 [L104] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L212] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L187] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L190] COND TRUE m_st == 0 [L191] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L203] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L215] tmp = exists_runnable_thread() [L217] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L222] COND TRUE m_st == 0 [L223] int tmp_ndt_1; [L224] tmp_ndt_1 = __VERIFIER_nondet_int() [L225] COND TRUE \read(tmp_ndt_1) [L227] m_st = 1 [L32] int tmp_var = __VERIFIER_nondet_int(); [L34] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L37] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L59] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L64] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L65] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L70] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L71] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L72] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L10] __VERIFIER_error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 2 error locations. Result: UNSAFE, OverallTime: 3.4s, OverallIterations: 17, TraceHistogramMax: 3, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3381 SDtfs, 2968 SDslu, 2280 SDs, 0 SdLazy, 233 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1847occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 16 MinimizatonAttempts, 764 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1125 NumberOfCodeBlocks, 1125 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1009 ConstructedInterpolants, 0 QuantifiedInterpolants, 125079 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 191/191 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...