./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.02.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b5699aa Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_241763d6-0d11-4c2f-a02b-76cb5fb286fa/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_241763d6-0d11-4c2f-a02b-76cb5fb286fa/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_241763d6-0d11-4c2f-a02b-76cb5fb286fa/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_241763d6-0d11-4c2f-a02b-76cb5fb286fa/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.02.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_241763d6-0d11-4c2f-a02b-76cb5fb286fa/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_241763d6-0d11-4c2f-a02b-76cb5fb286fa/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 0c244c639ec9718adcbacffa967b748c52a23cd0 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-6b5699a [2019-11-25 08:47:01,463 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-25 08:47:01,465 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-25 08:47:01,479 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-25 08:47:01,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-25 08:47:01,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-25 08:47:01,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-25 08:47:01,491 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-25 08:47:01,495 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-25 08:47:01,499 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-25 08:47:01,500 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-25 08:47:01,502 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-25 08:47:01,502 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-25 08:47:01,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-25 08:47:01,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-25 08:47:01,506 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-25 08:47:01,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-25 08:47:01,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-25 08:47:01,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-25 08:47:01,513 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-25 08:47:01,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-25 08:47:01,519 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-25 08:47:01,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-25 08:47:01,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-25 08:47:01,524 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-25 08:47:01,525 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-25 08:47:01,525 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-25 08:47:01,526 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-25 08:47:01,527 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-25 08:47:01,527 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-25 08:47:01,528 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-25 08:47:01,528 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-25 08:47:01,529 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-25 08:47:01,530 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-25 08:47:01,530 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-25 08:47:01,531 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-25 08:47:01,531 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-25 08:47:01,531 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-25 08:47:01,532 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-25 08:47:01,532 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-25 08:47:01,533 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-25 08:47:01,534 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_241763d6-0d11-4c2f-a02b-76cb5fb286fa/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-25 08:47:01,549 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-25 08:47:01,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-25 08:47:01,550 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-25 08:47:01,551 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-25 08:47:01,551 INFO L138 SettingsManager]: * Use SBE=true [2019-11-25 08:47:01,551 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-25 08:47:01,551 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-25 08:47:01,551 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-25 08:47:01,552 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-25 08:47:01,552 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-25 08:47:01,552 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-25 08:47:01,552 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-25 08:47:01,552 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-25 08:47:01,553 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-25 08:47:01,553 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-25 08:47:01,553 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-25 08:47:01,553 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-25 08:47:01,553 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-25 08:47:01,553 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-25 08:47:01,554 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-25 08:47:01,554 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-25 08:47:01,554 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-25 08:47:01,554 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-25 08:47:01,554 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-25 08:47:01,555 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-25 08:47:01,555 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-25 08:47:01,555 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-25 08:47:01,555 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-25 08:47:01,556 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_241763d6-0d11-4c2f-a02b-76cb5fb286fa/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 -> 0c244c639ec9718adcbacffa967b748c52a23cd0 [2019-11-25 08:47:01,696 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-25 08:47:01,704 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-25 08:47:01,707 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-25 08:47:01,708 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-25 08:47:01,708 INFO L275 PluginConnector]: CDTParser initialized [2019-11-25 08:47:01,709 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_241763d6-0d11-4c2f-a02b-76cb5fb286fa/bin/uautomizer/../../sv-benchmarks/c/systemc/transmitter.02.cil.c [2019-11-25 08:47:01,758 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_241763d6-0d11-4c2f-a02b-76cb5fb286fa/bin/uautomizer/data/9c75f663d/0e95384069f34da3b0345650d096f355/FLAG671ffdb10 [2019-11-25 08:47:02,182 INFO L306 CDTParser]: Found 1 translation units. [2019-11-25 08:47:02,185 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_241763d6-0d11-4c2f-a02b-76cb5fb286fa/sv-benchmarks/c/systemc/transmitter.02.cil.c [2019-11-25 08:47:02,192 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_241763d6-0d11-4c2f-a02b-76cb5fb286fa/bin/uautomizer/data/9c75f663d/0e95384069f34da3b0345650d096f355/FLAG671ffdb10 [2019-11-25 08:47:02,203 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_241763d6-0d11-4c2f-a02b-76cb5fb286fa/bin/uautomizer/data/9c75f663d/0e95384069f34da3b0345650d096f355 [2019-11-25 08:47:02,205 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-25 08:47:02,206 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-25 08:47:02,209 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:02,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-25 08:47:02,211 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-25 08:47:02,211 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:02" (1/1) ... [2019-11-25 08:47:02,213 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@507bdbf1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:02, skipping insertion in model container [2019-11-25 08:47:02,213 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 08:47:02" (1/1) ... [2019-11-25 08:47:02,219 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-25 08:47:02,250 INFO L179 MainTranslator]: Built tables and reachable declarations [2019-11-25 08:47:02,468 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:02,473 INFO L201 MainTranslator]: Completed pre-run [2019-11-25 08:47:02,510 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-25 08:47:02,527 INFO L205 MainTranslator]: Completed translation [2019-11-25 08:47:02,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:02 WrapperNode [2019-11-25 08:47:02,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-25 08:47:02,529 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:02,529 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-25 08:47:02,529 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-25 08:47:02,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:02" (1/1) ... [2019-11-25 08:47:02,542 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:02" (1/1) ... [2019-11-25 08:47:02,579 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-25 08:47:02,581 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-25 08:47:02,581 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-25 08:47:02,581 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-25 08:47:02,589 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:02" (1/1) ... [2019-11-25 08:47:02,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:02" (1/1) ... [2019-11-25 08:47:02,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:02" (1/1) ... [2019-11-25 08:47:02,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:02" (1/1) ... [2019-11-25 08:47:02,622 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:02" (1/1) ... [2019-11-25 08:47:02,649 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:02" (1/1) ... [2019-11-25 08:47:02,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:02" (1/1) ... [2019-11-25 08:47:02,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-25 08:47:02,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-25 08:47:02,672 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-25 08:47:02,672 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-25 08:47:02,673 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_241763d6-0d11-4c2f-a02b-76cb5fb286fa/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-25 08:47:02,747 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-25 08:47:02,748 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-25 08:47:03,440 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-25 08:47:03,440 INFO L284 CfgBuilder]: Removed 94 assume(true) statements. [2019-11-25 08:47:03,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:03 BoogieIcfgContainer [2019-11-25 08:47:03,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-25 08:47:03,442 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-25 08:47:03,442 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-25 08:47:03,445 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-25 08:47:03,445 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 08:47:02" (1/3) ... [2019-11-25 08:47:03,445 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d05f86d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:47:03, skipping insertion in model container [2019-11-25 08:47:03,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 08:47:02" (2/3) ... [2019-11-25 08:47:03,446 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1d05f86d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 08:47:03, skipping insertion in model container [2019-11-25 08:47:03,446 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:03" (3/3) ... [2019-11-25 08:47:03,447 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2019-11-25 08:47:03,456 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-25 08:47:03,462 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-25 08:47:03,471 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-25 08:47:03,492 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-25 08:47:03,492 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-25 08:47:03,492 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-25 08:47:03,492 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-25 08:47:03,492 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-25 08:47:03,493 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-25 08:47:03,493 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-25 08:47:03,493 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-25 08:47:03,510 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2019-11-25 08:47:03,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-25 08:47:03,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:03,518 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:03,518 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:03,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:03,522 INFO L82 PathProgramCache]: Analyzing trace with hash 550865253, now seen corresponding path program 1 times [2019-11-25 08:47:03,529 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:03,529 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549098981] [2019-11-25 08:47:03,529 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:03,666 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-25 08:47:03,667 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549098981] [2019-11-25 08:47:03,668 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:03,668 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:03,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303158232] [2019-11-25 08:47:03,677 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:03,677 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:03,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:03,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:03,692 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 3 states. [2019-11-25 08:47:03,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:03,751 INFO L93 Difference]: Finished difference Result 379 states and 595 transitions. [2019-11-25 08:47:03,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:03,753 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-25 08:47:03,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:03,763 INFO L225 Difference]: With dead ends: 379 [2019-11-25 08:47:03,763 INFO L226 Difference]: Without dead ends: 188 [2019-11-25 08:47:03,766 INFO L630 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-25 08:47:03,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-25 08:47:03,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-11-25 08:47:03,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-25 08:47:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 283 transitions. [2019-11-25 08:47:03,813 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 283 transitions. Word has length 49 [2019-11-25 08:47:03,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:03,814 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 283 transitions. [2019-11-25 08:47:03,814 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:03,814 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 283 transitions. [2019-11-25 08:47:03,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-25 08:47:03,816 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:03,816 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:03,816 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:03,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:03,817 INFO L82 PathProgramCache]: Analyzing trace with hash -342621085, now seen corresponding path program 1 times [2019-11-25 08:47:03,817 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:03,817 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1566364915] [2019-11-25 08:47:03,817 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:03,859 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-25 08:47:03,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1566364915] [2019-11-25 08:47:03,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:03,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:03,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744428360] [2019-11-25 08:47:03,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:03,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:03,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:03,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:03,862 INFO L87 Difference]: Start difference. First operand 188 states and 283 transitions. Second operand 3 states. [2019-11-25 08:47:03,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:03,964 INFO L93 Difference]: Finished difference Result 498 states and 749 transitions. [2019-11-25 08:47:03,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:03,965 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-25 08:47:03,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:03,968 INFO L225 Difference]: With dead ends: 498 [2019-11-25 08:47:03,969 INFO L226 Difference]: Without dead ends: 317 [2019-11-25 08:47:03,970 INFO L630 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-25 08:47:03,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-25 08:47:04,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2019-11-25 08:47:04,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-25 08:47:04,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 467 transitions. [2019-11-25 08:47:04,020 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 467 transitions. Word has length 49 [2019-11-25 08:47:04,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:04,020 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 467 transitions. [2019-11-25 08:47:04,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:04,020 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 467 transitions. [2019-11-25 08:47:04,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-25 08:47:04,025 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:04,025 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:04,025 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:04,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:04,026 INFO L82 PathProgramCache]: Analyzing trace with hash -2057662813, now seen corresponding path program 1 times [2019-11-25 08:47:04,026 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:04,026 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780579104] [2019-11-25 08:47:04,026 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:04,065 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-25 08:47:04,065 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780579104] [2019-11-25 08:47:04,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:04,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:04,066 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710980788] [2019-11-25 08:47:04,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:04,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:04,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:04,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:04,068 INFO L87 Difference]: Start difference. First operand 315 states and 467 transitions. Second operand 3 states. [2019-11-25 08:47:04,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:04,113 INFO L93 Difference]: Finished difference Result 622 states and 923 transitions. [2019-11-25 08:47:04,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:04,114 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-25 08:47:04,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:04,118 INFO L225 Difference]: With dead ends: 622 [2019-11-25 08:47:04,118 INFO L226 Difference]: Without dead ends: 315 [2019-11-25 08:47:04,120 INFO L630 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-25 08:47:04,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-25 08:47:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-25 08:47:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-25 08:47:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 459 transitions. [2019-11-25 08:47:04,148 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 459 transitions. Word has length 49 [2019-11-25 08:47:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:04,148 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 459 transitions. [2019-11-25 08:47:04,149 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 459 transitions. [2019-11-25 08:47:04,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-25 08:47:04,150 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:04,150 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:04,150 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:04,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:04,151 INFO L82 PathProgramCache]: Analyzing trace with hash 796507235, now seen corresponding path program 1 times [2019-11-25 08:47:04,151 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:04,151 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876497781] [2019-11-25 08:47:04,152 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:04,192 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-25 08:47:04,192 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876497781] [2019-11-25 08:47:04,192 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:04,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:04,193 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278575453] [2019-11-25 08:47:04,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:04,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:04,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:04,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:04,195 INFO L87 Difference]: Start difference. First operand 315 states and 459 transitions. Second operand 3 states. [2019-11-25 08:47:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:04,231 INFO L93 Difference]: Finished difference Result 621 states and 906 transitions. [2019-11-25 08:47:04,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:04,231 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-25 08:47:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:04,234 INFO L225 Difference]: With dead ends: 621 [2019-11-25 08:47:04,234 INFO L226 Difference]: Without dead ends: 315 [2019-11-25 08:47:04,239 INFO L630 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-25 08:47:04,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-25 08:47:04,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-25 08:47:04,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-25 08:47:04,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 451 transitions. [2019-11-25 08:47:04,283 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 451 transitions. Word has length 49 [2019-11-25 08:47:04,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:04,283 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 451 transitions. [2019-11-25 08:47:04,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:04,284 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 451 transitions. [2019-11-25 08:47:04,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-25 08:47:04,288 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:04,288 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:04,289 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:04,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:04,289 INFO L82 PathProgramCache]: Analyzing trace with hash -773990749, now seen corresponding path program 1 times [2019-11-25 08:47:04,289 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:04,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813160931] [2019-11-25 08:47:04,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:04,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:04,342 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-25 08:47:04,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813160931] [2019-11-25 08:47:04,343 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:04,343 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:04,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799577715] [2019-11-25 08:47:04,343 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:04,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:04,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:04,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:04,344 INFO L87 Difference]: Start difference. First operand 315 states and 451 transitions. Second operand 3 states. [2019-11-25 08:47:04,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:04,406 INFO L93 Difference]: Finished difference Result 620 states and 889 transitions. [2019-11-25 08:47:04,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:04,407 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-25 08:47:04,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:04,409 INFO L225 Difference]: With dead ends: 620 [2019-11-25 08:47:04,409 INFO L226 Difference]: Without dead ends: 315 [2019-11-25 08:47:04,410 INFO L630 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-25 08:47:04,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-25 08:47:04,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-25 08:47:04,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-25 08:47:04,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 437 transitions. [2019-11-25 08:47:04,433 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 437 transitions. Word has length 49 [2019-11-25 08:47:04,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:04,435 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 437 transitions. [2019-11-25 08:47:04,435 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:04,435 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 437 transitions. [2019-11-25 08:47:04,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-25 08:47:04,436 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:04,437 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:04,437 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:04,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:04,438 INFO L82 PathProgramCache]: Analyzing trace with hash -1210649628, now seen corresponding path program 1 times [2019-11-25 08:47:04,438 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:04,438 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774629599] [2019-11-25 08:47:04,438 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:04,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:04,488 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-25 08:47:04,488 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774629599] [2019-11-25 08:47:04,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:04,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:04,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095539261] [2019-11-25 08:47:04,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:04,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:04,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:04,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:04,490 INFO L87 Difference]: Start difference. First operand 315 states and 437 transitions. Second operand 3 states. [2019-11-25 08:47:04,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:04,539 INFO L93 Difference]: Finished difference Result 619 states and 860 transitions. [2019-11-25 08:47:04,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:04,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-25 08:47:04,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:04,542 INFO L225 Difference]: With dead ends: 619 [2019-11-25 08:47:04,542 INFO L226 Difference]: Without dead ends: 315 [2019-11-25 08:47:04,543 INFO L630 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-25 08:47:04,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-25 08:47:04,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-25 08:47:04,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-25 08:47:04,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 423 transitions. [2019-11-25 08:47:04,561 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 423 transitions. Word has length 49 [2019-11-25 08:47:04,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:04,561 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 423 transitions. [2019-11-25 08:47:04,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:04,561 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 423 transitions. [2019-11-25 08:47:04,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-25 08:47:04,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:04,562 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:04,562 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:04,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:04,563 INFO L82 PathProgramCache]: Analyzing trace with hash 217882148, now seen corresponding path program 1 times [2019-11-25 08:47:04,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:04,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679525056] [2019-11-25 08:47:04,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:04,613 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-25 08:47:04,613 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679525056] [2019-11-25 08:47:04,613 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:04,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:04,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890776482] [2019-11-25 08:47:04,614 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:04,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:04,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:04,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:04,615 INFO L87 Difference]: Start difference. First operand 315 states and 423 transitions. Second operand 3 states. [2019-11-25 08:47:04,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:04,704 INFO L93 Difference]: Finished difference Result 870 states and 1162 transitions. [2019-11-25 08:47:04,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:04,705 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-25 08:47:04,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:04,708 INFO L225 Difference]: With dead ends: 870 [2019-11-25 08:47:04,708 INFO L226 Difference]: Without dead ends: 592 [2019-11-25 08:47:04,709 INFO L630 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-25 08:47:04,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-11-25 08:47:04,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 556. [2019-11-25 08:47:04,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-11-25 08:47:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 731 transitions. [2019-11-25 08:47:04,742 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 731 transitions. Word has length 49 [2019-11-25 08:47:04,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:04,742 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 731 transitions. [2019-11-25 08:47:04,742 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:04,742 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 731 transitions. [2019-11-25 08:47:04,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-25 08:47:04,743 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:04,744 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:04,744 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:04,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:04,745 INFO L82 PathProgramCache]: Analyzing trace with hash -397727545, now seen corresponding path program 1 times [2019-11-25 08:47:04,745 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:04,746 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124315557] [2019-11-25 08:47:04,746 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:04,815 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-25 08:47:04,816 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124315557] [2019-11-25 08:47:04,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:04,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:04,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786965132] [2019-11-25 08:47:04,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:04,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:04,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:04,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:04,817 INFO L87 Difference]: Start difference. First operand 556 states and 731 transitions. Second operand 3 states. [2019-11-25 08:47:04,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:04,906 INFO L93 Difference]: Finished difference Result 1454 states and 1913 transitions. [2019-11-25 08:47:04,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:04,906 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-25 08:47:04,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:04,913 INFO L225 Difference]: With dead ends: 1454 [2019-11-25 08:47:04,913 INFO L226 Difference]: Without dead ends: 968 [2019-11-25 08:47:04,914 INFO L630 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-25 08:47:04,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-11-25 08:47:04,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 926. [2019-11-25 08:47:04,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-25 08:47:04,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1204 transitions. [2019-11-25 08:47:04,981 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1204 transitions. Word has length 50 [2019-11-25 08:47:04,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:04,981 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1204 transitions. [2019-11-25 08:47:04,981 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:04,981 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1204 transitions. [2019-11-25 08:47:04,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-25 08:47:04,982 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:04,982 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:04,982 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:04,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:04,983 INFO L82 PathProgramCache]: Analyzing trace with hash 765911831, now seen corresponding path program 1 times [2019-11-25 08:47:04,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:04,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010433947] [2019-11-25 08:47:04,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:05,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,049 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-25 08:47:05,050 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010433947] [2019-11-25 08:47:05,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:05,050 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-25 08:47:05,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512239694] [2019-11-25 08:47:05,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:05,051 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:05,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:05,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:05,052 INFO L87 Difference]: Start difference. First operand 926 states and 1204 transitions. Second operand 3 states. [2019-11-25 08:47:05,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:05,157 INFO L93 Difference]: Finished difference Result 2626 states and 3421 transitions. [2019-11-25 08:47:05,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:05,157 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-25 08:47:05,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:05,166 INFO L225 Difference]: With dead ends: 2626 [2019-11-25 08:47:05,166 INFO L226 Difference]: Without dead ends: 1750 [2019-11-25 08:47:05,168 INFO L630 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-25 08:47:05,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2019-11-25 08:47:05,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1734. [2019-11-25 08:47:05,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1734 states. [2019-11-25 08:47:05,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2234 transitions. [2019-11-25 08:47:05,249 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2234 transitions. Word has length 51 [2019-11-25 08:47:05,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:05,249 INFO L462 AbstractCegarLoop]: Abstraction has 1734 states and 2234 transitions. [2019-11-25 08:47:05,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:05,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2234 transitions. [2019-11-25 08:47:05,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-25 08:47:05,251 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:05,251 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 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] [2019-11-25 08:47:05,251 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:05,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:05,252 INFO L82 PathProgramCache]: Analyzing trace with hash -1533277321, now seen corresponding path program 1 times [2019-11-25 08:47:05,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:05,252 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51558184] [2019-11-25 08:47:05,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,301 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:05,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51558184] [2019-11-25 08:47:05,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:05,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:05,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118678878] [2019-11-25 08:47:05,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:05,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:05,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:05,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:05,303 INFO L87 Difference]: Start difference. First operand 1734 states and 2234 transitions. Second operand 3 states. [2019-11-25 08:47:05,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:05,469 INFO L93 Difference]: Finished difference Result 5068 states and 6521 transitions. [2019-11-25 08:47:05,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:05,472 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-25 08:47:05,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:05,489 INFO L225 Difference]: With dead ends: 5068 [2019-11-25 08:47:05,489 INFO L226 Difference]: Without dead ends: 3402 [2019-11-25 08:47:05,492 INFO L630 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-25 08:47:05,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2019-11-25 08:47:05,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3402. [2019-11-25 08:47:05,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3402 states. [2019-11-25 08:47:05,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3402 states to 3402 states and 4340 transitions. [2019-11-25 08:47:05,640 INFO L78 Accepts]: Start accepts. Automaton has 3402 states and 4340 transitions. Word has length 66 [2019-11-25 08:47:05,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:05,647 INFO L462 AbstractCegarLoop]: Abstraction has 3402 states and 4340 transitions. [2019-11-25 08:47:05,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:05,648 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4340 transitions. [2019-11-25 08:47:05,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-25 08:47:05,651 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:05,651 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:05,651 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:05,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:05,652 INFO L82 PathProgramCache]: Analyzing trace with hash -883662481, now seen corresponding path program 1 times [2019-11-25 08:47:05,652 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:05,652 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856884253] [2019-11-25 08:47:05,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:05,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-25 08:47:05,717 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856884253] [2019-11-25 08:47:05,717 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:05,717 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:47:05,717 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446960657] [2019-11-25 08:47:05,718 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:47:05,718 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:05,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:47:05,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:05,718 INFO L87 Difference]: Start difference. First operand 3402 states and 4340 transitions. Second operand 5 states. [2019-11-25 08:47:06,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:06,148 INFO L93 Difference]: Finished difference Result 10802 states and 13699 transitions. [2019-11-25 08:47:06,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:47:06,149 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-11-25 08:47:06,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:06,185 INFO L225 Difference]: With dead ends: 10802 [2019-11-25 08:47:06,186 INFO L226 Difference]: Without dead ends: 7492 [2019-11-25 08:47:06,191 INFO L630 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-25 08:47:06,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7492 states. [2019-11-25 08:47:06,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7492 to 3546. [2019-11-25 08:47:06,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3546 states. [2019-11-25 08:47:06,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3546 states to 3546 states and 4448 transitions. [2019-11-25 08:47:06,411 INFO L78 Accepts]: Start accepts. Automaton has 3546 states and 4448 transitions. Word has length 89 [2019-11-25 08:47:06,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:06,411 INFO L462 AbstractCegarLoop]: Abstraction has 3546 states and 4448 transitions. [2019-11-25 08:47:06,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:47:06,412 INFO L276 IsEmpty]: Start isEmpty. Operand 3546 states and 4448 transitions. [2019-11-25 08:47:06,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-25 08:47:06,415 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:06,415 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:06,415 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:06,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:06,416 INFO L82 PathProgramCache]: Analyzing trace with hash -305176077, now seen corresponding path program 1 times [2019-11-25 08:47:06,416 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:06,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815500357] [2019-11-25 08:47:06,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:06,477 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-25 08:47:06,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815500357] [2019-11-25 08:47:06,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:06,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:06,478 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698296053] [2019-11-25 08:47:06,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:06,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:06,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:06,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:06,479 INFO L87 Difference]: Start difference. First operand 3546 states and 4448 transitions. Second operand 3 states. [2019-11-25 08:47:06,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:06,836 INFO L93 Difference]: Finished difference Result 10194 states and 12806 transitions. [2019-11-25 08:47:06,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:06,836 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-25 08:47:06,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:06,868 INFO L225 Difference]: With dead ends: 10194 [2019-11-25 08:47:06,868 INFO L226 Difference]: Without dead ends: 6712 [2019-11-25 08:47:06,873 INFO L630 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-25 08:47:06,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6712 states. [2019-11-25 08:47:07,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6712 to 6494. [2019-11-25 08:47:07,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6494 states. [2019-11-25 08:47:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6494 states to 6494 states and 8084 transitions. [2019-11-25 08:47:07,195 INFO L78 Accepts]: Start accepts. Automaton has 6494 states and 8084 transitions. Word has length 89 [2019-11-25 08:47:07,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:07,196 INFO L462 AbstractCegarLoop]: Abstraction has 6494 states and 8084 transitions. [2019-11-25 08:47:07,196 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:07,196 INFO L276 IsEmpty]: Start isEmpty. Operand 6494 states and 8084 transitions. [2019-11-25 08:47:07,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-25 08:47:07,200 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:07,200 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:07,200 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:07,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:07,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1278665036, now seen corresponding path program 1 times [2019-11-25 08:47:07,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:07,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593480394] [2019-11-25 08:47:07,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:07,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:07,261 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-25 08:47:07,261 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593480394] [2019-11-25 08:47:07,261 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:07,262 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:47:07,262 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542170943] [2019-11-25 08:47:07,262 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:47:07,262 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:07,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:47:07,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:07,263 INFO L87 Difference]: Start difference. First operand 6494 states and 8084 transitions. Second operand 5 states. [2019-11-25 08:47:07,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:07,819 INFO L93 Difference]: Finished difference Result 15348 states and 19199 transitions. [2019-11-25 08:47:07,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:47:07,820 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-11-25 08:47:07,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:07,867 INFO L225 Difference]: With dead ends: 15348 [2019-11-25 08:47:07,867 INFO L226 Difference]: Without dead ends: 8934 [2019-11-25 08:47:07,876 INFO L630 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-25 08:47:07,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8934 states. [2019-11-25 08:47:08,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8934 to 6542. [2019-11-25 08:47:08,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2019-11-25 08:47:08,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 8000 transitions. [2019-11-25 08:47:08,237 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 8000 transitions. Word has length 89 [2019-11-25 08:47:08,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:08,237 INFO L462 AbstractCegarLoop]: Abstraction has 6542 states and 8000 transitions. [2019-11-25 08:47:08,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:47:08,237 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 8000 transitions. [2019-11-25 08:47:08,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-25 08:47:08,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:08,243 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:08,244 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:08,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:08,244 INFO L82 PathProgramCache]: Analyzing trace with hash 211800632, now seen corresponding path program 1 times [2019-11-25 08:47:08,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:08,246 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764182577] [2019-11-25 08:47:08,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:08,292 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:08,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764182577] [2019-11-25 08:47:08,295 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:08,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:08,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081489692] [2019-11-25 08:47:08,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:08,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:08,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:08,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:08,296 INFO L87 Difference]: Start difference. First operand 6542 states and 8000 transitions. Second operand 3 states. [2019-11-25 08:47:08,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:08,674 INFO L93 Difference]: Finished difference Result 9812 states and 12049 transitions. [2019-11-25 08:47:08,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:08,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-25 08:47:08,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:08,685 INFO L225 Difference]: With dead ends: 9812 [2019-11-25 08:47:08,685 INFO L226 Difference]: Without dead ends: 6542 [2019-11-25 08:47:08,689 INFO L630 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-25 08:47:08,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6542 states. [2019-11-25 08:47:08,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6542 to 6512. [2019-11-25 08:47:08,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6512 states. [2019-11-25 08:47:08,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 7866 transitions. [2019-11-25 08:47:08,982 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 7866 transitions. Word has length 89 [2019-11-25 08:47:08,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:08,982 INFO L462 AbstractCegarLoop]: Abstraction has 6512 states and 7866 transitions. [2019-11-25 08:47:08,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:08,983 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 7866 transitions. [2019-11-25 08:47:08,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-25 08:47:08,986 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:08,986 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:08,987 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:08,987 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:08,987 INFO L82 PathProgramCache]: Analyzing trace with hash -974468191, now seen corresponding path program 1 times [2019-11-25 08:47:08,987 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:08,987 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391903727] [2019-11-25 08:47:08,988 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:09,028 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-25 08:47:09,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391903727] [2019-11-25 08:47:09,029 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:09,029 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-25 08:47:09,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648680882] [2019-11-25 08:47:09,030 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-25 08:47:09,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:09,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-25 08:47:09,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-25 08:47:09,031 INFO L87 Difference]: Start difference. First operand 6512 states and 7866 transitions. Second operand 5 states. [2019-11-25 08:47:09,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:09,501 INFO L93 Difference]: Finished difference Result 12634 states and 15323 transitions. [2019-11-25 08:47:09,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-25 08:47:09,501 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-11-25 08:47:09,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:09,510 INFO L225 Difference]: With dead ends: 12634 [2019-11-25 08:47:09,511 INFO L226 Difference]: Without dead ends: 6178 [2019-11-25 08:47:09,518 INFO L630 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-25 08:47:09,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6178 states. [2019-11-25 08:47:09,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6178 to 4920. [2019-11-25 08:47:09,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4920 states. [2019-11-25 08:47:09,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4920 states to 4920 states and 5854 transitions. [2019-11-25 08:47:09,769 INFO L78 Accepts]: Start accepts. Automaton has 4920 states and 5854 transitions. Word has length 90 [2019-11-25 08:47:09,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:09,770 INFO L462 AbstractCegarLoop]: Abstraction has 4920 states and 5854 transitions. [2019-11-25 08:47:09,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-25 08:47:09,770 INFO L276 IsEmpty]: Start isEmpty. Operand 4920 states and 5854 transitions. [2019-11-25 08:47:09,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-25 08:47:09,773 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:09,773 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-25 08:47:09,773 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:09,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:09,774 INFO L82 PathProgramCache]: Analyzing trace with hash 724986355, now seen corresponding path program 1 times [2019-11-25 08:47:09,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:09,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230485308] [2019-11-25 08:47:09,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:09,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:09,799 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:09,799 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230485308] [2019-11-25 08:47:09,799 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:09,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:09,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565825254] [2019-11-25 08:47:09,800 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:09,800 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:09,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:09,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:09,801 INFO L87 Difference]: Start difference. First operand 4920 states and 5854 transitions. Second operand 3 states. [2019-11-25 08:47:10,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:10,050 INFO L93 Difference]: Finished difference Result 9778 states and 11642 transitions. [2019-11-25 08:47:10,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:10,051 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-25 08:47:10,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:10,058 INFO L225 Difference]: With dead ends: 9778 [2019-11-25 08:47:10,058 INFO L226 Difference]: Without dead ends: 4190 [2019-11-25 08:47:10,065 INFO L630 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-25 08:47:10,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2019-11-25 08:47:10,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 4186. [2019-11-25 08:47:10,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4186 states. [2019-11-25 08:47:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 4930 transitions. [2019-11-25 08:47:10,289 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 4930 transitions. Word has length 92 [2019-11-25 08:47:10,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:10,289 INFO L462 AbstractCegarLoop]: Abstraction has 4186 states and 4930 transitions. [2019-11-25 08:47:10,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:10,290 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 4930 transitions. [2019-11-25 08:47:10,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-25 08:47:10,293 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:10,293 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 08:47:10,294 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:10,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:10,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2141342848, now seen corresponding path program 1 times [2019-11-25 08:47:10,294 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:10,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759404646] [2019-11-25 08:47:10,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:10,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:10,341 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-25 08:47:10,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759404646] [2019-11-25 08:47:10,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:10,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:10,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734301367] [2019-11-25 08:47:10,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:10,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:10,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:10,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:10,343 INFO L87 Difference]: Start difference. First operand 4186 states and 4930 transitions. Second operand 3 states. [2019-11-25 08:47:10,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:10,687 INFO L93 Difference]: Finished difference Result 8752 states and 10233 transitions. [2019-11-25 08:47:10,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:10,687 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-25 08:47:10,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:10,692 INFO L225 Difference]: With dead ends: 8752 [2019-11-25 08:47:10,692 INFO L226 Difference]: Without dead ends: 2868 [2019-11-25 08:47:10,698 INFO L630 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-25 08:47:10,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2019-11-25 08:47:10,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 2790. [2019-11-25 08:47:10,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-11-25 08:47:10,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 3146 transitions. [2019-11-25 08:47:10,833 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 3146 transitions. Word has length 116 [2019-11-25 08:47:10,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:10,834 INFO L462 AbstractCegarLoop]: Abstraction has 2790 states and 3146 transitions. [2019-11-25 08:47:10,834 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 3146 transitions. [2019-11-25 08:47:10,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-25 08:47:10,836 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:10,837 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 08:47:10,837 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:10,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:10,837 INFO L82 PathProgramCache]: Analyzing trace with hash 1717534558, now seen corresponding path program 1 times [2019-11-25 08:47:10,837 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:10,838 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180577926] [2019-11-25 08:47:10,838 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:10,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-25 08:47:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-25 08:47:10,880 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180577926] [2019-11-25 08:47:10,880 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-25 08:47:10,880 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-25 08:47:10,880 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381132406] [2019-11-25 08:47:10,881 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-25 08:47:10,882 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-25 08:47:10,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-25 08:47:10,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-25 08:47:10,883 INFO L87 Difference]: Start difference. First operand 2790 states and 3146 transitions. Second operand 3 states. [2019-11-25 08:47:11,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-25 08:47:11,008 INFO L93 Difference]: Finished difference Result 3172 states and 3583 transitions. [2019-11-25 08:47:11,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-25 08:47:11,008 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-25 08:47:11,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-25 08:47:11,012 INFO L225 Difference]: With dead ends: 3172 [2019-11-25 08:47:11,012 INFO L226 Difference]: Without dead ends: 2470 [2019-11-25 08:47:11,014 INFO L630 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-25 08:47:11,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2019-11-25 08:47:11,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2470. [2019-11-25 08:47:11,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2470 states. [2019-11-25 08:47:11,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 2766 transitions. [2019-11-25 08:47:11,135 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 2766 transitions. Word has length 117 [2019-11-25 08:47:11,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-25 08:47:11,135 INFO L462 AbstractCegarLoop]: Abstraction has 2470 states and 2766 transitions. [2019-11-25 08:47:11,135 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-25 08:47:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 2766 transitions. [2019-11-25 08:47:11,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-25 08:47:11,138 INFO L402 BasicCegarLoop]: Found error trace [2019-11-25 08:47:11,139 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 08:47:11,139 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-25 08:47:11,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-25 08:47:11,139 INFO L82 PathProgramCache]: Analyzing trace with hash -692010475, now seen corresponding path program 1 times [2019-11-25 08:47:11,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-25 08:47:11,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249068184] [2019-11-25 08:47:11,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-25 08:47:11,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-25 08:47:11,224 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-25 08:47:11,224 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-25 08:47:11,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 08:47:11 BoogieIcfgContainer [2019-11-25 08:47:11,347 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-25 08:47:11,347 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-25 08:47:11,347 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-25 08:47:11,347 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-25 08:47:11,348 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 08:47:03" (3/4) ... [2019-11-25 08:47:11,349 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-25 08:47:11,470 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_241763d6-0d11-4c2f-a02b-76cb5fb286fa/bin/uautomizer/witness.graphml [2019-11-25 08:47:11,470 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-25 08:47:11,472 INFO L168 Benchmark]: Toolchain (without parser) took 9265.48 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 513.8 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -199.1 MB). Peak memory consumption was 314.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:11,472 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:11,472 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:11,473 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-25 08:47:11,473 INFO L168 Benchmark]: Boogie Preprocessor took 90.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:11,473 INFO L168 Benchmark]: RCFGBuilder took 769.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:11,474 INFO L168 Benchmark]: TraceAbstraction took 7904.64 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 367.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -79.8 MB). Peak memory consumption was 287.7 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:11,474 INFO L168 Benchmark]: Witness Printer took 123.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. [2019-11-25 08:47:11,476 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.22 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 319.70 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 943.4 MB in the beginning and 1.1 GB in the end (delta: -192.4 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.22 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 769.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7904.64 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 367.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -79.8 MB). Peak memory consumption was 287.7 MB. Max. memory is 11.5 GB. * Witness Printer took 123.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 17.2 MB). Peak memory consumption was 17.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int t2_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int t2_st ; [L21] int m_i ; [L22] int t1_i ; [L23] int t2_i ; [L24] int M_E = 2; [L25] int T1_E = 2; [L26] int T2_E = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; VAL [E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L563] int __retres1 ; [L477] m_i = 1 [L478] t1_i = 1 [L479] t2_i = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L504] int kernel_st ; [L505] int tmp ; [L506] int tmp___0 ; [L510] kernel_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L211] COND TRUE m_i == 1 [L212] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L216] COND TRUE t1_i == 1 [L217] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L221] COND TRUE t2_i == 1 [L222] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L324] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L329] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L339] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L344] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L143] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L146] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L156] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L158] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L162] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L165] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L175] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L177] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L181] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L184] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L194] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L196] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L357] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L362] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L372] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L377] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L518] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L521] kernel_st = 1 [L257] int tmp ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L261] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L231] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L252] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L264] tmp = exists_runnable_thread() [L266] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE m_st == 0 [L272] int tmp_ndt_1; [L273] tmp_ndt_1 = __VERIFIER_nondet_int() [L274] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L285] COND TRUE t1_st == 0 [L286] int tmp_ndt_2; [L287] tmp_ndt_2 = __VERIFIER_nondet_int() [L288] COND TRUE \read(tmp_ndt_2) [L290] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L78] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L89] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L91] t1_pc = 1 [L92] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L299] COND TRUE t2_st == 0 [L300] int tmp_ndt_3; [L301] tmp_ndt_3 = __VERIFIER_nondet_int() [L302] COND TRUE \read(tmp_ndt_3) [L304] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L113] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L124] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L126] t2_pc = 1 [L127] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L261] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L231] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L252] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L264] tmp = exists_runnable_thread() [L266] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L271] COND TRUE m_st == 0 [L272] int tmp_ndt_1; [L273] tmp_ndt_1 = __VERIFIER_nondet_int() [L274] COND TRUE \read(tmp_ndt_1) [L276] m_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L37] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L48] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L51] E_1 = 1 [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L143] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L146] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L162] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L165] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] COND TRUE E_1 == 1 [L167] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L401] tmp___0 = is_transmit1_triggered() [L403] COND TRUE \read(tmp___0) [L404] t1_st = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L181] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L184] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L53] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L56] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] m_pc = 1 [L59] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L285] COND TRUE t1_st == 0 [L286] int tmp_ndt_2; [L287] tmp_ndt_2 = __VERIFIER_nondet_int() [L288] COND TRUE \read(tmp_ndt_2) [L290] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L78] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L81] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L97] E_2 = 1 [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L143] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L146] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L147] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L162] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L165] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L181] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L184] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] COND TRUE E_2 == 1 [L186] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L409] tmp___1 = is_transmit2_triggered() [L411] COND TRUE \read(tmp___1) [L412] t2_st = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L99] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L89] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L91] t1_pc = 1 [L92] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L299] COND TRUE t2_st == 0 [L300] int tmp_ndt_3; [L301] tmp_ndt_3 = __VERIFIER_nondet_int() [L302] COND TRUE \read(tmp_ndt_3) [L304] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L113] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L116] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L11] __VERIFIER_error() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 192 locations, 1 error locations. Result: UNSAFE, OverallTime: 7.8s, OverallIterations: 19, TraceHistogramMax: 2, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5274 SDtfs, 4949 SDslu, 4000 SDs, 0 SdLazy, 329 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6542occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 8022 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1399 NumberOfCodeBlocks, 1399 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1263 ConstructedInterpolants, 0 QuantifiedInterpolants, 148665 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 126/126 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...