./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_b7e5ba55-1cf6-43de-b1c5-5681efe35706/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_b7e5ba55-1cf6-43de-b1c5-5681efe35706/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_b7e5ba55-1cf6-43de-b1c5-5681efe35706/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_b7e5ba55-1cf6-43de-b1c5-5681efe35706/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_b7e5ba55-1cf6-43de-b1c5-5681efe35706/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_b7e5ba55-1cf6-43de-b1c5-5681efe35706/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 69fb30bd96659b6c61b59030d7ea8c3053fedc35 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-678e011 [2019-11-20 00:15:43,330 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-20 00:15:43,332 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-20 00:15:43,345 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-20 00:15:43,346 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-20 00:15:43,347 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-20 00:15:43,348 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-20 00:15:43,351 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-20 00:15:43,353 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-20 00:15:43,362 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-20 00:15:43,363 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-20 00:15:43,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-20 00:15:43,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-20 00:15:43,367 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-20 00:15:43,368 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-20 00:15:43,369 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-20 00:15:43,370 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-20 00:15:43,371 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-20 00:15:43,373 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-20 00:15:43,375 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-20 00:15:43,377 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-20 00:15:43,382 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-20 00:15:43,386 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-20 00:15:43,387 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-20 00:15:43,391 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-20 00:15:43,393 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-20 00:15:43,394 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-20 00:15:43,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-20 00:15:43,396 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-20 00:15:43,399 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-20 00:15:43,400 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-20 00:15:43,401 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-20 00:15:43,401 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-20 00:15:43,402 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-20 00:15:43,406 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-20 00:15:43,406 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-20 00:15:43,407 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-20 00:15:43,407 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-20 00:15:43,407 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-20 00:15:43,408 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-20 00:15:43,410 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-20 00:15:43,411 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_b7e5ba55-1cf6-43de-b1c5-5681efe35706/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-20 00:15:43,443 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-20 00:15:43,443 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-20 00:15:43,444 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-20 00:15:43,444 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-20 00:15:43,445 INFO L138 SettingsManager]: * Use SBE=true [2019-11-20 00:15:43,445 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-20 00:15:43,445 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-20 00:15:43,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-20 00:15:43,445 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-20 00:15:43,446 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-20 00:15:43,446 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-20 00:15:43,446 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-20 00:15:43,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-20 00:15:43,447 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-20 00:15:43,447 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-20 00:15:43,447 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-20 00:15:43,447 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-20 00:15:43,447 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-20 00:15:43,448 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-20 00:15:43,448 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-20 00:15:43,448 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-20 00:15:43,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-20 00:15:43,449 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-20 00:15:43,449 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-20 00:15:43,449 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-20 00:15:43,449 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-20 00:15:43,449 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-20 00:15:43,450 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-20 00:15:43,450 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_b7e5ba55-1cf6-43de-b1c5-5681efe35706/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 -> 69fb30bd96659b6c61b59030d7ea8c3053fedc35 [2019-11-20 00:15:43,669 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-20 00:15:43,686 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-20 00:15:43,689 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-20 00:15:43,691 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-20 00:15:43,691 INFO L275 PluginConnector]: CDTParser initialized [2019-11-20 00:15:43,693 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_b7e5ba55-1cf6-43de-b1c5-5681efe35706/bin/uautomizer/../../sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2019-11-20 00:15:43,771 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b7e5ba55-1cf6-43de-b1c5-5681efe35706/bin/uautomizer/data/1138bf219/7ffc0426a0b747a185e0deca011fa09c/FLAGbb79cb460 [2019-11-20 00:15:44,334 INFO L306 CDTParser]: Found 1 translation units. [2019-11-20 00:15:44,335 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_b7e5ba55-1cf6-43de-b1c5-5681efe35706/sv-benchmarks/c/systemc/token_ring.03.cil-1.c [2019-11-20 00:15:44,351 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_b7e5ba55-1cf6-43de-b1c5-5681efe35706/bin/uautomizer/data/1138bf219/7ffc0426a0b747a185e0deca011fa09c/FLAGbb79cb460 [2019-11-20 00:15:44,611 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_b7e5ba55-1cf6-43de-b1c5-5681efe35706/bin/uautomizer/data/1138bf219/7ffc0426a0b747a185e0deca011fa09c [2019-11-20 00:15:44,614 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-20 00:15:44,616 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-20 00:15:44,621 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-20 00:15:44,621 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-20 00:15:44,626 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-20 00:15:44,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:15:44" (1/1) ... [2019-11-20 00:15:44,634 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4045b859 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:44, skipping insertion in model container [2019-11-20 00:15:44,634 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 12:15:44" (1/1) ... [2019-11-20 00:15:44,643 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-20 00:15:44,689 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-20 00:15:45,060 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:15:45,074 INFO L188 MainTranslator]: Completed pre-run [2019-11-20 00:15:45,159 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-20 00:15:45,184 INFO L192 MainTranslator]: Completed translation [2019-11-20 00:15:45,184 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:45 WrapperNode [2019-11-20 00:15:45,184 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-20 00:15:45,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-20 00:15:45,186 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-20 00:15:45,186 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-20 00:15:45,196 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:45" (1/1) ... [2019-11-20 00:15:45,206 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:45" (1/1) ... [2019-11-20 00:15:45,258 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-20 00:15:45,258 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-20 00:15:45,258 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-20 00:15:45,259 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-20 00:15:45,270 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:45" (1/1) ... [2019-11-20 00:15:45,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:45" (1/1) ... [2019-11-20 00:15:45,292 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:45" (1/1) ... [2019-11-20 00:15:45,292 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:45" (1/1) ... [2019-11-20 00:15:45,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:45" (1/1) ... [2019-11-20 00:15:45,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:45" (1/1) ... [2019-11-20 00:15:45,337 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:45" (1/1) ... [2019-11-20 00:15:45,344 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-20 00:15:45,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-20 00:15:45,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-20 00:15:45,345 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-20 00:15:45,359 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:45" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_b7e5ba55-1cf6-43de-b1c5-5681efe35706/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-20 00:15:45,435 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-20 00:15:45,435 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-20 00:15:46,710 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-20 00:15:46,710 INFO L285 CfgBuilder]: Removed 132 assume(true) statements. [2019-11-20 00:15:46,712 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:15:46 BoogieIcfgContainer [2019-11-20 00:15:46,712 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-20 00:15:46,713 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-20 00:15:46,713 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-20 00:15:46,716 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-20 00:15:46,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 12:15:44" (1/3) ... [2019-11-20 00:15:46,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de2ff64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:15:46, skipping insertion in model container [2019-11-20 00:15:46,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 12:15:45" (2/3) ... [2019-11-20 00:15:46,718 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3de2ff64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 12:15:46, skipping insertion in model container [2019-11-20 00:15:46,718 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:15:46" (3/3) ... [2019-11-20 00:15:46,720 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.03.cil-1.c [2019-11-20 00:15:46,730 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-20 00:15:46,737 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-20 00:15:46,748 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-20 00:15:46,776 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-20 00:15:46,776 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-20 00:15:46,776 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-20 00:15:46,776 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-20 00:15:46,776 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-20 00:15:46,776 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-20 00:15:46,777 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-20 00:15:46,777 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-20 00:15:46,803 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states. [2019-11-20 00:15:46,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 00:15:46,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:46,814 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:46,814 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:46,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:46,821 INFO L82 PathProgramCache]: Analyzing trace with hash -1976596934, now seen corresponding path program 1 times [2019-11-20 00:15:46,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:46,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083082544] [2019-11-20 00:15:46,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:46,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:47,017 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-20 00:15:47,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083082544] [2019-11-20 00:15:47,018 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:47,019 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:15:47,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396275582] [2019-11-20 00:15:47,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:15:47,027 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:47,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:47,038 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:47,040 INFO L87 Difference]: Start difference. First operand 316 states. Second operand 3 states. [2019-11-20 00:15:47,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:47,129 INFO L93 Difference]: Finished difference Result 627 states and 979 transitions. [2019-11-20 00:15:47,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:15:47,132 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-20 00:15:47,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:47,149 INFO L225 Difference]: With dead ends: 627 [2019-11-20 00:15:47,149 INFO L226 Difference]: Without dead ends: 312 [2019-11-20 00:15:47,154 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-20 00:15:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2019-11-20 00:15:47,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 312. [2019-11-20 00:15:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-11-20 00:15:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 474 transitions. [2019-11-20 00:15:47,227 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 474 transitions. Word has length 61 [2019-11-20 00:15:47,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:47,228 INFO L462 AbstractCegarLoop]: Abstraction has 312 states and 474 transitions. [2019-11-20 00:15:47,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:15:47,228 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 474 transitions. [2019-11-20 00:15:47,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 00:15:47,231 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:47,231 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:47,232 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:47,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:47,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1057453112, now seen corresponding path program 1 times [2019-11-20 00:15:47,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:47,233 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505665961] [2019-11-20 00:15:47,233 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:47,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:47,295 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-20 00:15:47,296 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505665961] [2019-11-20 00:15:47,296 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:47,296 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:15:47,297 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202998334] [2019-11-20 00:15:47,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:15:47,298 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:47,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:47,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:47,299 INFO L87 Difference]: Start difference. First operand 312 states and 474 transitions. Second operand 3 states. [2019-11-20 00:15:47,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:47,428 INFO L93 Difference]: Finished difference Result 848 states and 1286 transitions. [2019-11-20 00:15:47,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:15:47,433 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-20 00:15:47,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:47,439 INFO L225 Difference]: With dead ends: 848 [2019-11-20 00:15:47,439 INFO L226 Difference]: Without dead ends: 544 [2019-11-20 00:15:47,447 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-20 00:15:47,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2019-11-20 00:15:47,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 540. [2019-11-20 00:15:47,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-11-20 00:15:47,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 818 transitions. [2019-11-20 00:15:47,527 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 818 transitions. Word has length 61 [2019-11-20 00:15:47,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:47,528 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 818 transitions. [2019-11-20 00:15:47,528 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:15:47,528 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 818 transitions. [2019-11-20 00:15:47,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 00:15:47,538 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:47,539 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:47,539 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:47,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:47,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1933472118, now seen corresponding path program 1 times [2019-11-20 00:15:47,540 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:47,540 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864933995] [2019-11-20 00:15:47,540 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:47,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:47,605 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-20 00:15:47,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864933995] [2019-11-20 00:15:47,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:47,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:15:47,606 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927623124] [2019-11-20 00:15:47,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:15:47,607 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:47,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:47,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:47,607 INFO L87 Difference]: Start difference. First operand 540 states and 818 transitions. Second operand 3 states. [2019-11-20 00:15:47,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:47,659 INFO L93 Difference]: Finished difference Result 1071 states and 1623 transitions. [2019-11-20 00:15:47,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:15:47,660 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-20 00:15:47,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:47,665 INFO L225 Difference]: With dead ends: 1071 [2019-11-20 00:15:47,665 INFO L226 Difference]: Without dead ends: 540 [2019-11-20 00:15:47,667 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-20 00:15:47,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-20 00:15:47,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-11-20 00:15:47,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-11-20 00:15:47,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 810 transitions. [2019-11-20 00:15:47,699 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 810 transitions. Word has length 61 [2019-11-20 00:15:47,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:47,699 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 810 transitions. [2019-11-20 00:15:47,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:15:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 810 transitions. [2019-11-20 00:15:47,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 00:15:47,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:47,701 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:47,702 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:47,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:47,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1494892678, now seen corresponding path program 1 times [2019-11-20 00:15:47,703 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:47,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808649869] [2019-11-20 00:15:47,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:47,757 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-20 00:15:47,758 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808649869] [2019-11-20 00:15:47,758 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:47,758 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:15:47,758 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272213906] [2019-11-20 00:15:47,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:15:47,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:47,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:47,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:47,760 INFO L87 Difference]: Start difference. First operand 540 states and 810 transitions. Second operand 3 states. [2019-11-20 00:15:47,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:47,811 INFO L93 Difference]: Finished difference Result 1070 states and 1606 transitions. [2019-11-20 00:15:47,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:15:47,812 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-20 00:15:47,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:47,816 INFO L225 Difference]: With dead ends: 1070 [2019-11-20 00:15:47,817 INFO L226 Difference]: Without dead ends: 540 [2019-11-20 00:15:47,818 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-20 00:15:47,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-20 00:15:47,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-11-20 00:15:47,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-11-20 00:15:47,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 802 transitions. [2019-11-20 00:15:47,854 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 802 transitions. Word has length 61 [2019-11-20 00:15:47,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:47,854 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 802 transitions. [2019-11-20 00:15:47,854 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:15:47,855 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 802 transitions. [2019-11-20 00:15:47,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 00:15:47,856 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:47,856 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:47,856 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:47,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:47,857 INFO L82 PathProgramCache]: Analyzing trace with hash -774201098, now seen corresponding path program 1 times [2019-11-20 00:15:47,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:47,857 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61846226] [2019-11-20 00:15:47,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:47,916 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-20 00:15:47,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61846226] [2019-11-20 00:15:47,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:47,918 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:15:47,918 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010165501] [2019-11-20 00:15:47,919 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:15:47,919 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:47,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:47,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:47,920 INFO L87 Difference]: Start difference. First operand 540 states and 802 transitions. Second operand 3 states. [2019-11-20 00:15:47,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:47,973 INFO L93 Difference]: Finished difference Result 1069 states and 1589 transitions. [2019-11-20 00:15:47,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:15:47,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-20 00:15:47,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:47,979 INFO L225 Difference]: With dead ends: 1069 [2019-11-20 00:15:47,979 INFO L226 Difference]: Without dead ends: 540 [2019-11-20 00:15:47,981 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-20 00:15:47,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-20 00:15:48,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-11-20 00:15:48,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-11-20 00:15:48,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 794 transitions. [2019-11-20 00:15:48,018 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 794 transitions. Word has length 61 [2019-11-20 00:15:48,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:48,019 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 794 transitions. [2019-11-20 00:15:48,019 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:15:48,019 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 794 transitions. [2019-11-20 00:15:48,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 00:15:48,021 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:48,021 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:48,021 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:48,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:48,022 INFO L82 PathProgramCache]: Analyzing trace with hash -196763654, now seen corresponding path program 1 times [2019-11-20 00:15:48,022 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:48,023 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117197395] [2019-11-20 00:15:48,023 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:48,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:48,063 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-20 00:15:48,064 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117197395] [2019-11-20 00:15:48,064 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:48,065 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:15:48,065 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028102350] [2019-11-20 00:15:48,066 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:15:48,066 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:48,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:48,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:48,067 INFO L87 Difference]: Start difference. First operand 540 states and 794 transitions. Second operand 3 states. [2019-11-20 00:15:48,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:48,152 INFO L93 Difference]: Finished difference Result 1068 states and 1572 transitions. [2019-11-20 00:15:48,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:15:48,153 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-20 00:15:48,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:48,158 INFO L225 Difference]: With dead ends: 1068 [2019-11-20 00:15:48,158 INFO L226 Difference]: Without dead ends: 540 [2019-11-20 00:15:48,160 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-20 00:15:48,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-20 00:15:48,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-11-20 00:15:48,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-11-20 00:15:48,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 776 transitions. [2019-11-20 00:15:48,196 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 776 transitions. Word has length 61 [2019-11-20 00:15:48,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:48,196 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 776 transitions. [2019-11-20 00:15:48,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:15:48,197 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 776 transitions. [2019-11-20 00:15:48,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 00:15:48,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:48,198 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:48,199 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:48,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:48,199 INFO L82 PathProgramCache]: Analyzing trace with hash 749500983, now seen corresponding path program 1 times [2019-11-20 00:15:48,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:48,200 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804016981] [2019-11-20 00:15:48,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:48,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:48,289 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-20 00:15:48,291 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804016981] [2019-11-20 00:15:48,291 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:48,291 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:15:48,292 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735301372] [2019-11-20 00:15:48,293 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:15:48,294 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:48,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:48,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:48,302 INFO L87 Difference]: Start difference. First operand 540 states and 776 transitions. Second operand 3 states. [2019-11-20 00:15:48,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:48,374 INFO L93 Difference]: Finished difference Result 1066 states and 1533 transitions. [2019-11-20 00:15:48,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:15:48,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-20 00:15:48,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:48,379 INFO L225 Difference]: With dead ends: 1066 [2019-11-20 00:15:48,380 INFO L226 Difference]: Without dead ends: 540 [2019-11-20 00:15:48,381 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-20 00:15:48,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-20 00:15:48,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-11-20 00:15:48,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-11-20 00:15:48,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 758 transitions. [2019-11-20 00:15:48,411 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 758 transitions. Word has length 61 [2019-11-20 00:15:48,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:48,412 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 758 transitions. [2019-11-20 00:15:48,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:15:48,412 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 758 transitions. [2019-11-20 00:15:48,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 00:15:48,414 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:48,414 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:48,414 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:48,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:48,415 INFO L82 PathProgramCache]: Analyzing trace with hash 91036916, now seen corresponding path program 1 times [2019-11-20 00:15:48,415 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:48,416 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264712474] [2019-11-20 00:15:48,416 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:48,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:48,489 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-20 00:15:48,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264712474] [2019-11-20 00:15:48,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:48,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:15:48,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688180377] [2019-11-20 00:15:48,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:15:48,491 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:48,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:48,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:48,491 INFO L87 Difference]: Start difference. First operand 540 states and 758 transitions. Second operand 3 states. [2019-11-20 00:15:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:48,566 INFO L93 Difference]: Finished difference Result 1065 states and 1496 transitions. [2019-11-20 00:15:48,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:15:48,567 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-20 00:15:48,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:48,571 INFO L225 Difference]: With dead ends: 1065 [2019-11-20 00:15:48,571 INFO L226 Difference]: Without dead ends: 540 [2019-11-20 00:15:48,573 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-20 00:15:48,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-20 00:15:48,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-11-20 00:15:48,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-11-20 00:15:48,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 740 transitions. [2019-11-20 00:15:48,607 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 740 transitions. Word has length 61 [2019-11-20 00:15:48,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:48,607 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 740 transitions. [2019-11-20 00:15:48,608 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:15:48,608 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 740 transitions. [2019-11-20 00:15:48,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 00:15:48,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:48,609 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:48,609 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:48,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:48,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1080534521, now seen corresponding path program 1 times [2019-11-20 00:15:48,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:48,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515269082] [2019-11-20 00:15:48,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:48,691 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-20 00:15:48,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515269082] [2019-11-20 00:15:48,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:48,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:15:48,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264195431] [2019-11-20 00:15:48,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:15:48,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:48,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:48,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:48,698 INFO L87 Difference]: Start difference. First operand 540 states and 740 transitions. Second operand 3 states. [2019-11-20 00:15:48,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:48,767 INFO L93 Difference]: Finished difference Result 1067 states and 1463 transitions. [2019-11-20 00:15:48,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:15:48,768 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-20 00:15:48,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:48,773 INFO L225 Difference]: With dead ends: 1067 [2019-11-20 00:15:48,773 INFO L226 Difference]: Without dead ends: 540 [2019-11-20 00:15:48,774 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-20 00:15:48,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2019-11-20 00:15:48,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 540. [2019-11-20 00:15:48,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 540 states. [2019-11-20 00:15:48,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 722 transitions. [2019-11-20 00:15:48,806 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 722 transitions. Word has length 61 [2019-11-20 00:15:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:48,807 INFO L462 AbstractCegarLoop]: Abstraction has 540 states and 722 transitions. [2019-11-20 00:15:48,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:15:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 722 transitions. [2019-11-20 00:15:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-11-20 00:15:48,808 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:48,809 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:15:48,809 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:48,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:48,810 INFO L82 PathProgramCache]: Analyzing trace with hash -507813381, now seen corresponding path program 1 times [2019-11-20 00:15:48,810 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:48,810 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631853842] [2019-11-20 00:15:48,810 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:48,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:48,875 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-20 00:15:48,876 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631853842] [2019-11-20 00:15:48,876 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:48,877 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:15:48,877 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462895393] [2019-11-20 00:15:48,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:15:48,878 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:48,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:48,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:48,878 INFO L87 Difference]: Start difference. First operand 540 states and 722 transitions. Second operand 3 states. [2019-11-20 00:15:48,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:48,984 INFO L93 Difference]: Finished difference Result 1522 states and 2039 transitions. [2019-11-20 00:15:48,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:15:48,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-11-20 00:15:48,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:48,996 INFO L225 Difference]: With dead ends: 1522 [2019-11-20 00:15:48,996 INFO L226 Difference]: Without dead ends: 999 [2019-11-20 00:15:48,998 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-20 00:15:49,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2019-11-20 00:15:49,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 947. [2019-11-20 00:15:49,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 947 states. [2019-11-20 00:15:49,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1256 transitions. [2019-11-20 00:15:49,056 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1256 transitions. Word has length 61 [2019-11-20 00:15:49,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:49,060 INFO L462 AbstractCegarLoop]: Abstraction has 947 states and 1256 transitions. [2019-11-20 00:15:49,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:15:49,061 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1256 transitions. [2019-11-20 00:15:49,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 00:15:49,063 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:49,063 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:15:49,064 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:49,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:49,064 INFO L82 PathProgramCache]: Analyzing trace with hash -624063038, now seen corresponding path program 1 times [2019-11-20 00:15:49,065 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:49,065 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125016161] [2019-11-20 00:15:49,065 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:49,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:49,159 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:15:49,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125016161] [2019-11-20 00:15:49,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:49,160 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:15:49,160 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560474846] [2019-11-20 00:15:49,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:15:49,161 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:49,161 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:49,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:49,162 INFO L87 Difference]: Start difference. First operand 947 states and 1256 transitions. Second operand 3 states. [2019-11-20 00:15:49,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:49,312 INFO L93 Difference]: Finished difference Result 2713 states and 3613 transitions. [2019-11-20 00:15:49,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:15:49,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-20 00:15:49,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:49,329 INFO L225 Difference]: With dead ends: 2713 [2019-11-20 00:15:49,329 INFO L226 Difference]: Without dead ends: 1789 [2019-11-20 00:15:49,331 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-20 00:15:49,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1789 states. [2019-11-20 00:15:49,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1789 to 1701. [2019-11-20 00:15:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1701 states. [2019-11-20 00:15:49,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2254 transitions. [2019-11-20 00:15:49,435 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2254 transitions. Word has length 99 [2019-11-20 00:15:49,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:49,435 INFO L462 AbstractCegarLoop]: Abstraction has 1701 states and 2254 transitions. [2019-11-20 00:15:49,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:15:49,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2254 transitions. [2019-11-20 00:15:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 00:15:49,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:49,438 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:15:49,439 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:49,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:49,439 INFO L82 PathProgramCache]: Analyzing trace with hash 2094346499, now seen corresponding path program 1 times [2019-11-20 00:15:49,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:49,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684489658] [2019-11-20 00:15:49,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:49,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:49,527 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:15:49,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684489658] [2019-11-20 00:15:49,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:49,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:15:49,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185652613] [2019-11-20 00:15:49,529 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:15:49,529 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:49,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:15:49,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:15:49,530 INFO L87 Difference]: Start difference. First operand 1701 states and 2254 transitions. Second operand 5 states. [2019-11-20 00:15:49,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:49,823 INFO L93 Difference]: Finished difference Result 3741 states and 4988 transitions. [2019-11-20 00:15:49,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:15:49,824 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-20 00:15:49,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:49,837 INFO L225 Difference]: With dead ends: 3741 [2019-11-20 00:15:49,837 INFO L226 Difference]: Without dead ends: 2067 [2019-11-20 00:15:49,841 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-20 00:15:49,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2019-11-20 00:15:49,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1707. [2019-11-20 00:15:49,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1707 states. [2019-11-20 00:15:49,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2225 transitions. [2019-11-20 00:15:49,955 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2225 transitions. Word has length 99 [2019-11-20 00:15:49,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:49,956 INFO L462 AbstractCegarLoop]: Abstraction has 1707 states and 2225 transitions. [2019-11-20 00:15:49,956 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:15:49,956 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2225 transitions. [2019-11-20 00:15:49,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 00:15:49,959 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:49,959 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:15:49,959 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:49,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:49,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1569507335, now seen corresponding path program 1 times [2019-11-20 00:15:49,960 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:49,960 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385966318] [2019-11-20 00:15:49,961 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:50,019 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:15:50,019 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385966318] [2019-11-20 00:15:50,019 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:50,020 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:15:50,020 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089741634] [2019-11-20 00:15:50,020 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:15:50,021 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:50,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:15:50,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:15:50,021 INFO L87 Difference]: Start difference. First operand 1707 states and 2225 transitions. Second operand 5 states. [2019-11-20 00:15:50,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:50,297 INFO L93 Difference]: Finished difference Result 4182 states and 5468 transitions. [2019-11-20 00:15:50,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:15:50,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-20 00:15:50,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:50,314 INFO L225 Difference]: With dead ends: 4182 [2019-11-20 00:15:50,314 INFO L226 Difference]: Without dead ends: 2509 [2019-11-20 00:15:50,317 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-20 00:15:50,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2509 states. [2019-11-20 00:15:50,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2509 to 1719. [2019-11-20 00:15:50,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-11-20 00:15:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2204 transitions. [2019-11-20 00:15:50,445 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2204 transitions. Word has length 99 [2019-11-20 00:15:50,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:50,445 INFO L462 AbstractCegarLoop]: Abstraction has 1719 states and 2204 transitions. [2019-11-20 00:15:50,445 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:15:50,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2204 transitions. [2019-11-20 00:15:50,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 00:15:50,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:50,448 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:15:50,448 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:50,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:50,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1452084725, now seen corresponding path program 1 times [2019-11-20 00:15:50,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:50,449 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813056888] [2019-11-20 00:15:50,449 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:50,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:50,505 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:15:50,506 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813056888] [2019-11-20 00:15:50,506 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:50,506 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:15:50,507 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719110102] [2019-11-20 00:15:50,507 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:15:50,507 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:50,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:15:50,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:15:50,508 INFO L87 Difference]: Start difference. First operand 1719 states and 2204 transitions. Second operand 5 states. [2019-11-20 00:15:50,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:50,886 INFO L93 Difference]: Finished difference Result 4879 states and 6330 transitions. [2019-11-20 00:15:50,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:15:50,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 99 [2019-11-20 00:15:50,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:50,907 INFO L225 Difference]: With dead ends: 4879 [2019-11-20 00:15:50,907 INFO L226 Difference]: Without dead ends: 3201 [2019-11-20 00:15:50,910 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-20 00:15:50,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3201 states. [2019-11-20 00:15:51,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3201 to 1743. [2019-11-20 00:15:51,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1743 states. [2019-11-20 00:15:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1743 states to 1743 states and 2199 transitions. [2019-11-20 00:15:51,064 INFO L78 Accepts]: Start accepts. Automaton has 1743 states and 2199 transitions. Word has length 99 [2019-11-20 00:15:51,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:51,065 INFO L462 AbstractCegarLoop]: Abstraction has 1743 states and 2199 transitions. [2019-11-20 00:15:51,065 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:15:51,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1743 states and 2199 transitions. [2019-11-20 00:15:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-20 00:15:51,067 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:51,067 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:15:51,068 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:51,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:51,068 INFO L82 PathProgramCache]: Analyzing trace with hash -1078857969, now seen corresponding path program 1 times [2019-11-20 00:15:51,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:51,069 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426295472] [2019-11-20 00:15:51,069 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:51,117 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:15:51,118 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426295472] [2019-11-20 00:15:51,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:51,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:15:51,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145473914] [2019-11-20 00:15:51,119 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:15:51,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:51,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:51,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:51,120 INFO L87 Difference]: Start difference. First operand 1743 states and 2199 transitions. Second operand 3 states. [2019-11-20 00:15:51,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:51,379 INFO L93 Difference]: Finished difference Result 4925 states and 6187 transitions. [2019-11-20 00:15:51,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:15:51,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-20 00:15:51,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:51,401 INFO L225 Difference]: With dead ends: 4925 [2019-11-20 00:15:51,401 INFO L226 Difference]: Without dead ends: 3231 [2019-11-20 00:15:51,405 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-20 00:15:51,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3231 states. [2019-11-20 00:15:51,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3231 to 3227. [2019-11-20 00:15:51,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3227 states. [2019-11-20 00:15:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3227 states to 3227 states and 4009 transitions. [2019-11-20 00:15:51,677 INFO L78 Accepts]: Start accepts. Automaton has 3227 states and 4009 transitions. Word has length 99 [2019-11-20 00:15:51,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:51,677 INFO L462 AbstractCegarLoop]: Abstraction has 3227 states and 4009 transitions. [2019-11-20 00:15:51,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:15:51,678 INFO L276 IsEmpty]: Start isEmpty. Operand 3227 states and 4009 transitions. [2019-11-20 00:15:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 00:15:51,681 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:51,681 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:15:51,681 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:51,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:51,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1872181795, now seen corresponding path program 1 times [2019-11-20 00:15:51,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:51,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321268408] [2019-11-20 00:15:51,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:51,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:51,761 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:15:51,763 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321268408] [2019-11-20 00:15:51,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:51,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:15:51,764 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826343624] [2019-11-20 00:15:51,764 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:15:51,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:51,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:51,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:51,765 INFO L87 Difference]: Start difference. First operand 3227 states and 4009 transitions. Second operand 3 states. [2019-11-20 00:15:52,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:52,224 INFO L93 Difference]: Finished difference Result 9026 states and 11196 transitions. [2019-11-20 00:15:52,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:15:52,225 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-20 00:15:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:52,261 INFO L225 Difference]: With dead ends: 9026 [2019-11-20 00:15:52,262 INFO L226 Difference]: Without dead ends: 5848 [2019-11-20 00:15:52,268 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-20 00:15:52,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5848 states. [2019-11-20 00:15:52,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5848 to 5844. [2019-11-20 00:15:52,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5844 states. [2019-11-20 00:15:52,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5844 states to 5844 states and 7200 transitions. [2019-11-20 00:15:52,743 INFO L78 Accepts]: Start accepts. Automaton has 5844 states and 7200 transitions. Word has length 100 [2019-11-20 00:15:52,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:52,743 INFO L462 AbstractCegarLoop]: Abstraction has 5844 states and 7200 transitions. [2019-11-20 00:15:52,744 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:15:52,744 INFO L276 IsEmpty]: Start isEmpty. Operand 5844 states and 7200 transitions. [2019-11-20 00:15:52,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-20 00:15:52,749 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:52,750 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:15:52,750 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:52,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:52,751 INFO L82 PathProgramCache]: Analyzing trace with hash -520796577, now seen corresponding path program 1 times [2019-11-20 00:15:52,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:52,751 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126213701] [2019-11-20 00:15:52,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:52,790 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 00:15:52,791 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126213701] [2019-11-20 00:15:52,791 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:52,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:15:52,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405960434] [2019-11-20 00:15:52,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:15:52,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:52,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:52,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:52,794 INFO L87 Difference]: Start difference. First operand 5844 states and 7200 transitions. Second operand 3 states. [2019-11-20 00:15:53,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:53,221 INFO L93 Difference]: Finished difference Result 11596 states and 14298 transitions. [2019-11-20 00:15:53,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:15:53,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-20 00:15:53,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:53,256 INFO L225 Difference]: With dead ends: 11596 [2019-11-20 00:15:53,256 INFO L226 Difference]: Without dead ends: 5801 [2019-11-20 00:15:53,265 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-20 00:15:53,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5801 states. [2019-11-20 00:15:53,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5801 to 5801. [2019-11-20 00:15:53,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5801 states. [2019-11-20 00:15:53,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5801 states to 5801 states and 7152 transitions. [2019-11-20 00:15:53,658 INFO L78 Accepts]: Start accepts. Automaton has 5801 states and 7152 transitions. Word has length 100 [2019-11-20 00:15:53,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:53,658 INFO L462 AbstractCegarLoop]: Abstraction has 5801 states and 7152 transitions. [2019-11-20 00:15:53,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:15:53,659 INFO L276 IsEmpty]: Start isEmpty. Operand 5801 states and 7152 transitions. [2019-11-20 00:15:53,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 00:15:53,663 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:53,663 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:15:53,663 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:53,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:53,664 INFO L82 PathProgramCache]: Analyzing trace with hash 1349787928, now seen corresponding path program 1 times [2019-11-20 00:15:53,664 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:53,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469576326] [2019-11-20 00:15:53,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:53,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:53,714 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:15:53,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469576326] [2019-11-20 00:15:53,716 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:53,716 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:15:53,716 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279924712] [2019-11-20 00:15:53,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:15:53,717 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:53,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:53,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:53,718 INFO L87 Difference]: Start difference. First operand 5801 states and 7152 transitions. Second operand 3 states. [2019-11-20 00:15:54,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:54,427 INFO L93 Difference]: Finished difference Result 16291 states and 20097 transitions. [2019-11-20 00:15:54,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:15:54,428 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-20 00:15:54,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:54,462 INFO L225 Difference]: With dead ends: 16291 [2019-11-20 00:15:54,463 INFO L226 Difference]: Without dead ends: 10539 [2019-11-20 00:15:54,474 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-20 00:15:54,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10539 states. [2019-11-20 00:15:55,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10539 to 10535. [2019-11-20 00:15:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10535 states. [2019-11-20 00:15:55,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10535 states to 10535 states and 12941 transitions. [2019-11-20 00:15:55,303 INFO L78 Accepts]: Start accepts. Automaton has 10535 states and 12941 transitions. Word has length 101 [2019-11-20 00:15:55,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:55,304 INFO L462 AbstractCegarLoop]: Abstraction has 10535 states and 12941 transitions. [2019-11-20 00:15:55,304 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:15:55,304 INFO L276 IsEmpty]: Start isEmpty. Operand 10535 states and 12941 transitions. [2019-11-20 00:15:55,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2019-11-20 00:15:55,310 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:55,311 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:15:55,311 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:55,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:55,312 INFO L82 PathProgramCache]: Analyzing trace with hash -1593794150, now seen corresponding path program 1 times [2019-11-20 00:15:55,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:55,314 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278632551] [2019-11-20 00:15:55,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:55,340 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-20 00:15:55,341 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278632551] [2019-11-20 00:15:55,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:55,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:15:55,342 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644297266] [2019-11-20 00:15:55,344 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:15:55,344 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:55,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:55,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:55,345 INFO L87 Difference]: Start difference. First operand 10535 states and 12941 transitions. Second operand 3 states. [2019-11-20 00:15:56,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:56,002 INFO L93 Difference]: Finished difference Result 20979 states and 25783 transitions. [2019-11-20 00:15:56,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:15:56,003 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 101 [2019-11-20 00:15:56,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:56,026 INFO L225 Difference]: With dead ends: 20979 [2019-11-20 00:15:56,027 INFO L226 Difference]: Without dead ends: 10493 [2019-11-20 00:15:56,045 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-20 00:15:56,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10493 states. [2019-11-20 00:15:56,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10493 to 10493. [2019-11-20 00:15:56,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10493 states. [2019-11-20 00:15:56,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10493 states to 10493 states and 12895 transitions. [2019-11-20 00:15:56,964 INFO L78 Accepts]: Start accepts. Automaton has 10493 states and 12895 transitions. Word has length 101 [2019-11-20 00:15:56,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:56,965 INFO L462 AbstractCegarLoop]: Abstraction has 10493 states and 12895 transitions. [2019-11-20 00:15:56,965 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:15:56,965 INFO L276 IsEmpty]: Start isEmpty. Operand 10493 states and 12895 transitions. [2019-11-20 00:15:56,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-11-20 00:15:56,971 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:56,971 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:15:56,972 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:56,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:56,972 INFO L82 PathProgramCache]: Analyzing trace with hash 988555220, now seen corresponding path program 1 times [2019-11-20 00:15:56,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:56,973 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022158636] [2019-11-20 00:15:56,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:56,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:57,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:15:57,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022158636] [2019-11-20 00:15:57,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:57,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:15:57,025 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121239787] [2019-11-20 00:15:57,026 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:15:57,026 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:57,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:57,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:57,027 INFO L87 Difference]: Start difference. First operand 10493 states and 12895 transitions. Second operand 3 states. [2019-11-20 00:15:58,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:15:58,430 INFO L93 Difference]: Finished difference Result 29982 states and 36689 transitions. [2019-11-20 00:15:58,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:15:58,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 102 [2019-11-20 00:15:58,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:15:58,469 INFO L225 Difference]: With dead ends: 29982 [2019-11-20 00:15:58,470 INFO L226 Difference]: Without dead ends: 19538 [2019-11-20 00:15:58,487 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-20 00:15:58,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19538 states. [2019-11-20 00:15:59,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19538 to 19538. [2019-11-20 00:15:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19538 states. [2019-11-20 00:15:59,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19538 states to 19538 states and 23591 transitions. [2019-11-20 00:15:59,732 INFO L78 Accepts]: Start accepts. Automaton has 19538 states and 23591 transitions. Word has length 102 [2019-11-20 00:15:59,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:15:59,732 INFO L462 AbstractCegarLoop]: Abstraction has 19538 states and 23591 transitions. [2019-11-20 00:15:59,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:15:59,733 INFO L276 IsEmpty]: Start isEmpty. Operand 19538 states and 23591 transitions. [2019-11-20 00:15:59,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 00:15:59,750 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:15:59,750 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:15:59,751 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:15:59,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:15:59,751 INFO L82 PathProgramCache]: Analyzing trace with hash 490924073, now seen corresponding path program 1 times [2019-11-20 00:15:59,751 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:15:59,752 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212607274] [2019-11-20 00:15:59,752 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:15:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:15:59,805 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:15:59,806 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212607274] [2019-11-20 00:15:59,806 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:15:59,806 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:15:59,807 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487285633] [2019-11-20 00:15:59,807 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:15:59,808 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:15:59,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:15:59,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:15:59,808 INFO L87 Difference]: Start difference. First operand 19538 states and 23591 transitions. Second operand 3 states. [2019-11-20 00:16:01,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:01,585 INFO L93 Difference]: Finished difference Result 47674 states and 57563 transitions. [2019-11-20 00:16:01,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:01,586 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-20 00:16:01,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:01,641 INFO L225 Difference]: With dead ends: 47674 [2019-11-20 00:16:01,642 INFO L226 Difference]: Without dead ends: 28204 [2019-11-20 00:16:01,665 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-20 00:16:01,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28204 states. [2019-11-20 00:16:03,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28204 to 28072. [2019-11-20 00:16:03,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28072 states. [2019-11-20 00:16:03,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28072 states to 28072 states and 33691 transitions. [2019-11-20 00:16:03,225 INFO L78 Accepts]: Start accepts. Automaton has 28072 states and 33691 transitions. Word has length 131 [2019-11-20 00:16:03,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:03,226 INFO L462 AbstractCegarLoop]: Abstraction has 28072 states and 33691 transitions. [2019-11-20 00:16:03,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 28072 states and 33691 transitions. [2019-11-20 00:16:03,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-11-20 00:16:03,249 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:03,250 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:16:03,250 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:03,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:03,251 INFO L82 PathProgramCache]: Analyzing trace with hash 293838688, now seen corresponding path program 1 times [2019-11-20 00:16:03,251 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:03,251 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461522129] [2019-11-20 00:16:03,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:03,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:03,318 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:16:03,318 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461522129] [2019-11-20 00:16:03,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:03,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-20 00:16:03,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819353047] [2019-11-20 00:16:03,320 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:03,320 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:03,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:03,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:03,321 INFO L87 Difference]: Start difference. First operand 28072 states and 33691 transitions. Second operand 3 states. [2019-11-20 00:16:05,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:05,056 INFO L93 Difference]: Finished difference Result 68432 states and 82087 transitions. [2019-11-20 00:16:05,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:05,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 131 [2019-11-20 00:16:05,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:05,423 INFO L225 Difference]: With dead ends: 68432 [2019-11-20 00:16:05,423 INFO L226 Difference]: Without dead ends: 40414 [2019-11-20 00:16:05,441 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-20 00:16:05,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40414 states. [2019-11-20 00:16:07,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40414 to 40218. [2019-11-20 00:16:07,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40218 states. [2019-11-20 00:16:07,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40218 states to 40218 states and 47939 transitions. [2019-11-20 00:16:07,393 INFO L78 Accepts]: Start accepts. Automaton has 40218 states and 47939 transitions. Word has length 131 [2019-11-20 00:16:07,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:07,394 INFO L462 AbstractCegarLoop]: Abstraction has 40218 states and 47939 transitions. [2019-11-20 00:16:07,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:07,394 INFO L276 IsEmpty]: Start isEmpty. Operand 40218 states and 47939 transitions. [2019-11-20 00:16:07,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-11-20 00:16:07,420 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:07,421 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:16:07,421 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:07,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:07,422 INFO L82 PathProgramCache]: Analyzing trace with hash 477376696, now seen corresponding path program 1 times [2019-11-20 00:16:07,422 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:07,422 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695658268] [2019-11-20 00:16:07,422 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-11-20 00:16:07,473 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695658268] [2019-11-20 00:16:07,473 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:07,473 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:16:07,473 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501037592] [2019-11-20 00:16:07,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:07,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:07,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:07,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:07,475 INFO L87 Difference]: Start difference. First operand 40218 states and 47939 transitions. Second operand 3 states. [2019-11-20 00:16:08,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:08,996 INFO L93 Difference]: Finished difference Result 72088 states and 85999 transitions. [2019-11-20 00:16:08,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:08,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2019-11-20 00:16:08,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:09,051 INFO L225 Difference]: With dead ends: 72088 [2019-11-20 00:16:09,052 INFO L226 Difference]: Without dead ends: 41106 [2019-11-20 00:16:09,079 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-20 00:16:09,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41106 states. [2019-11-20 00:16:11,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41106 to 39498. [2019-11-20 00:16:11,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39498 states. [2019-11-20 00:16:11,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39498 states to 39498 states and 46331 transitions. [2019-11-20 00:16:11,152 INFO L78 Accepts]: Start accepts. Automaton has 39498 states and 46331 transitions. Word has length 147 [2019-11-20 00:16:11,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:11,153 INFO L462 AbstractCegarLoop]: Abstraction has 39498 states and 46331 transitions. [2019-11-20 00:16:11,153 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:11,153 INFO L276 IsEmpty]: Start isEmpty. Operand 39498 states and 46331 transitions. [2019-11-20 00:16:11,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 00:16:11,175 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:11,176 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:16:11,176 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:11,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:11,177 INFO L82 PathProgramCache]: Analyzing trace with hash 1845088335, now seen corresponding path program 1 times [2019-11-20 00:16:11,177 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:11,177 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637265318] [2019-11-20 00:16:11,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:11,254 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:16:11,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637265318] [2019-11-20 00:16:11,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:11,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:16:11,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755355621] [2019-11-20 00:16:11,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:11,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:11,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:11,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:11,258 INFO L87 Difference]: Start difference. First operand 39498 states and 46331 transitions. Second operand 3 states. [2019-11-20 00:16:12,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:12,837 INFO L93 Difference]: Finished difference Result 62310 states and 73339 transitions. [2019-11-20 00:16:12,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:12,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-20 00:16:12,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:12,881 INFO L225 Difference]: With dead ends: 62310 [2019-11-20 00:16:12,881 INFO L226 Difference]: Without dead ends: 34906 [2019-11-20 00:16:12,899 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-20 00:16:12,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34906 states. [2019-11-20 00:16:14,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34906 to 34902. [2019-11-20 00:16:14,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34902 states. [2019-11-20 00:16:14,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34902 states to 34902 states and 40863 transitions. [2019-11-20 00:16:14,126 INFO L78 Accepts]: Start accepts. Automaton has 34902 states and 40863 transitions. Word has length 148 [2019-11-20 00:16:14,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:14,126 INFO L462 AbstractCegarLoop]: Abstraction has 34902 states and 40863 transitions. [2019-11-20 00:16:14,126 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 34902 states and 40863 transitions. [2019-11-20 00:16:14,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 00:16:14,137 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:14,137 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:16:14,137 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:14,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:14,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1363817295, now seen corresponding path program 1 times [2019-11-20 00:16:14,138 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:14,138 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915941653] [2019-11-20 00:16:14,138 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:14,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:14,183 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:16:14,183 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915941653] [2019-11-20 00:16:14,184 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:14,184 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:16:14,184 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165302353] [2019-11-20 00:16:14,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:14,185 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:14,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:14,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:14,185 INFO L87 Difference]: Start difference. First operand 34902 states and 40863 transitions. Second operand 3 states. [2019-11-20 00:16:15,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:15,667 INFO L93 Difference]: Finished difference Result 62382 states and 73243 transitions. [2019-11-20 00:16:15,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:15,668 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-20 00:16:15,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:15,693 INFO L225 Difference]: With dead ends: 62382 [2019-11-20 00:16:15,693 INFO L226 Difference]: Without dead ends: 34906 [2019-11-20 00:16:15,706 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-20 00:16:15,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34906 states. [2019-11-20 00:16:16,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34906 to 34902. [2019-11-20 00:16:16,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34902 states. [2019-11-20 00:16:16,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34902 states to 34902 states and 40695 transitions. [2019-11-20 00:16:16,806 INFO L78 Accepts]: Start accepts. Automaton has 34902 states and 40695 transitions. Word has length 148 [2019-11-20 00:16:16,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:16,806 INFO L462 AbstractCegarLoop]: Abstraction has 34902 states and 40695 transitions. [2019-11-20 00:16:16,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:16,807 INFO L276 IsEmpty]: Start isEmpty. Operand 34902 states and 40695 transitions. [2019-11-20 00:16:16,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 00:16:16,812 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:16,812 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:16:16,813 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:16,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:16,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1576151473, now seen corresponding path program 1 times [2019-11-20 00:16:16,813 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:16,813 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423846061] [2019-11-20 00:16:16,814 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:16,858 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-20 00:16:16,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1423846061] [2019-11-20 00:16:16,859 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:16,859 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:16:16,859 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302640053] [2019-11-20 00:16:16,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:16,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:16,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:16,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:16,860 INFO L87 Difference]: Start difference. First operand 34902 states and 40695 transitions. Second operand 3 states. [2019-11-20 00:16:17,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:17,877 INFO L93 Difference]: Finished difference Result 58470 states and 68303 transitions. [2019-11-20 00:16:17,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:17,877 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-20 00:16:17,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:17,900 INFO L225 Difference]: With dead ends: 58470 [2019-11-20 00:16:17,900 INFO L226 Difference]: Without dead ends: 23658 [2019-11-20 00:16:17,918 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-20 00:16:17,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23658 states. [2019-11-20 00:16:19,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23658 to 23654. [2019-11-20 00:16:19,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23654 states. [2019-11-20 00:16:19,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23654 states to 23654 states and 27459 transitions. [2019-11-20 00:16:19,048 INFO L78 Accepts]: Start accepts. Automaton has 23654 states and 27459 transitions. Word has length 148 [2019-11-20 00:16:19,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:19,049 INFO L462 AbstractCegarLoop]: Abstraction has 23654 states and 27459 transitions. [2019-11-20 00:16:19,049 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:19,049 INFO L276 IsEmpty]: Start isEmpty. Operand 23654 states and 27459 transitions. [2019-11-20 00:16:19,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-20 00:16:19,053 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:19,053 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:16:19,053 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:19,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:19,053 INFO L82 PathProgramCache]: Analyzing trace with hash -954570, now seen corresponding path program 1 times [2019-11-20 00:16:19,054 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:19,054 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747791075] [2019-11-20 00:16:19,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:19,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:19,102 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:16:19,103 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747791075] [2019-11-20 00:16:19,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:19,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:16:19,104 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266017443] [2019-11-20 00:16:19,104 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:19,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:19,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:19,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:19,105 INFO L87 Difference]: Start difference. First operand 23654 states and 27459 transitions. Second operand 3 states. [2019-11-20 00:16:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:20,305 INFO L93 Difference]: Finished difference Result 43106 states and 50305 transitions. [2019-11-20 00:16:20,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:20,306 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-20 00:16:20,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:20,334 INFO L225 Difference]: With dead ends: 43106 [2019-11-20 00:16:20,334 INFO L226 Difference]: Without dead ends: 24254 [2019-11-20 00:16:20,353 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-20 00:16:20,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24254 states. [2019-11-20 00:16:21,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24254 to 23534. [2019-11-20 00:16:21,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23534 states. [2019-11-20 00:16:21,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23534 states to 23534 states and 26843 transitions. [2019-11-20 00:16:21,776 INFO L78 Accepts]: Start accepts. Automaton has 23534 states and 26843 transitions. Word has length 148 [2019-11-20 00:16:21,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:21,777 INFO L462 AbstractCegarLoop]: Abstraction has 23534 states and 26843 transitions. [2019-11-20 00:16:21,777 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:21,777 INFO L276 IsEmpty]: Start isEmpty. Operand 23534 states and 26843 transitions. [2019-11-20 00:16:21,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-20 00:16:21,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:21,783 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-20 00:16:21,783 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:21,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:21,784 INFO L82 PathProgramCache]: Analyzing trace with hash 823641312, now seen corresponding path program 1 times [2019-11-20 00:16:21,784 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:21,784 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731230979] [2019-11-20 00:16:21,784 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:21,846 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-11-20 00:16:21,847 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731230979] [2019-11-20 00:16:21,847 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:21,847 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-20 00:16:21,847 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801675786] [2019-11-20 00:16:21,848 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-20 00:16:21,848 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:21,848 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-20 00:16:21,849 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-20 00:16:21,849 INFO L87 Difference]: Start difference. First operand 23534 states and 26843 transitions. Second operand 5 states. [2019-11-20 00:16:22,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:22,967 INFO L93 Difference]: Finished difference Result 32626 states and 36969 transitions. [2019-11-20 00:16:22,967 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:16:22,967 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 149 [2019-11-20 00:16:22,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:22,973 INFO L225 Difference]: With dead ends: 32626 [2019-11-20 00:16:22,973 INFO L226 Difference]: Without dead ends: 4731 [2019-11-20 00:16:22,989 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-20 00:16:22,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4731 states. [2019-11-20 00:16:23,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4731 to 4595. [2019-11-20 00:16:23,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4595 states. [2019-11-20 00:16:23,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4595 states to 4595 states and 4976 transitions. [2019-11-20 00:16:23,542 INFO L78 Accepts]: Start accepts. Automaton has 4595 states and 4976 transitions. Word has length 149 [2019-11-20 00:16:23,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:23,543 INFO L462 AbstractCegarLoop]: Abstraction has 4595 states and 4976 transitions. [2019-11-20 00:16:23,543 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-20 00:16:23,543 INFO L276 IsEmpty]: Start isEmpty. Operand 4595 states and 4976 transitions. [2019-11-20 00:16:23,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-11-20 00:16:23,547 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:23,547 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:16:23,547 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:23,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:23,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1473194168, now seen corresponding path program 1 times [2019-11-20 00:16:23,548 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:23,548 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125184585] [2019-11-20 00:16:23,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:23,613 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:16:23,614 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125184585] [2019-11-20 00:16:23,614 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:23,614 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:16:23,614 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311186785] [2019-11-20 00:16:23,615 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:23,615 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:23,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:23,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:23,616 INFO L87 Difference]: Start difference. First operand 4595 states and 4976 transitions. Second operand 3 states. [2019-11-20 00:16:23,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:23,940 INFO L93 Difference]: Finished difference Result 7852 states and 8519 transitions. [2019-11-20 00:16:23,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:23,940 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-11-20 00:16:23,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:23,945 INFO L225 Difference]: With dead ends: 7852 [2019-11-20 00:16:23,945 INFO L226 Difference]: Without dead ends: 4595 [2019-11-20 00:16:23,948 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-20 00:16:23,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4595 states. [2019-11-20 00:16:24,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4595 to 4595. [2019-11-20 00:16:24,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4595 states. [2019-11-20 00:16:24,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4595 states to 4595 states and 4922 transitions. [2019-11-20 00:16:24,236 INFO L78 Accepts]: Start accepts. Automaton has 4595 states and 4922 transitions. Word has length 214 [2019-11-20 00:16:24,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:24,236 INFO L462 AbstractCegarLoop]: Abstraction has 4595 states and 4922 transitions. [2019-11-20 00:16:24,237 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:24,237 INFO L276 IsEmpty]: Start isEmpty. Operand 4595 states and 4922 transitions. [2019-11-20 00:16:24,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-11-20 00:16:24,240 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:24,240 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:16:24,240 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:24,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:24,241 INFO L82 PathProgramCache]: Analyzing trace with hash 1279770330, now seen corresponding path program 1 times [2019-11-20 00:16:24,241 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:24,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132510450] [2019-11-20 00:16:24,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:24,299 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:16:24,300 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132510450] [2019-11-20 00:16:24,300 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:24,300 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:16:24,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300508498] [2019-11-20 00:16:24,303 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:24,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:24,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:24,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:24,303 INFO L87 Difference]: Start difference. First operand 4595 states and 4922 transitions. Second operand 3 states. [2019-11-20 00:16:24,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:24,643 INFO L93 Difference]: Finished difference Result 7385 states and 7926 transitions. [2019-11-20 00:16:24,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:24,644 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-11-20 00:16:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:24,648 INFO L225 Difference]: With dead ends: 7385 [2019-11-20 00:16:24,649 INFO L226 Difference]: Without dead ends: 4595 [2019-11-20 00:16:24,653 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-20 00:16:24,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4595 states. [2019-11-20 00:16:24,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4595 to 4595. [2019-11-20 00:16:24,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4595 states. [2019-11-20 00:16:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4595 states to 4595 states and 4876 transitions. [2019-11-20 00:16:24,912 INFO L78 Accepts]: Start accepts. Automaton has 4595 states and 4876 transitions. Word has length 217 [2019-11-20 00:16:24,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:24,912 INFO L462 AbstractCegarLoop]: Abstraction has 4595 states and 4876 transitions. [2019-11-20 00:16:24,912 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:24,913 INFO L276 IsEmpty]: Start isEmpty. Operand 4595 states and 4876 transitions. [2019-11-20 00:16:24,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2019-11-20 00:16:24,916 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:24,917 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:16:24,918 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:24,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:24,919 INFO L82 PathProgramCache]: Analyzing trace with hash -928723252, now seen corresponding path program 1 times [2019-11-20 00:16:24,919 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:24,919 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955212025] [2019-11-20 00:16:24,919 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:24,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:24,985 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-20 00:16:24,985 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955212025] [2019-11-20 00:16:24,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:24,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:16:24,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146873222] [2019-11-20 00:16:24,986 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:24,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:24,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:24,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:24,987 INFO L87 Difference]: Start difference. First operand 4595 states and 4876 transitions. Second operand 3 states. [2019-11-20 00:16:25,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:25,213 INFO L93 Difference]: Finished difference Result 5891 states and 6255 transitions. [2019-11-20 00:16:25,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:25,214 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 220 [2019-11-20 00:16:25,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:25,217 INFO L225 Difference]: With dead ends: 5891 [2019-11-20 00:16:25,217 INFO L226 Difference]: Without dead ends: 3680 [2019-11-20 00:16:25,219 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-20 00:16:25,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2019-11-20 00:16:25,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3680. [2019-11-20 00:16:25,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3680 states. [2019-11-20 00:16:25,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 3894 transitions. [2019-11-20 00:16:25,422 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 3894 transitions. Word has length 220 [2019-11-20 00:16:25,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:25,423 INFO L462 AbstractCegarLoop]: Abstraction has 3680 states and 3894 transitions. [2019-11-20 00:16:25,423 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:25,423 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 3894 transitions. [2019-11-20 00:16:25,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-11-20 00:16:25,425 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:25,426 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:16:25,427 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:25,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:25,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1613896568, now seen corresponding path program 1 times [2019-11-20 00:16:25,428 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:25,428 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727860810] [2019-11-20 00:16:25,428 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:25,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-20 00:16:25,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727860810] [2019-11-20 00:16:25,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:25,654 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-11-20 00:16:25,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686737056] [2019-11-20 00:16:25,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-20 00:16:25,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:25,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-20 00:16:25,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:16:25,655 INFO L87 Difference]: Start difference. First operand 3680 states and 3894 transitions. Second operand 6 states. [2019-11-20 00:16:25,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:25,957 INFO L93 Difference]: Finished difference Result 3680 states and 3894 transitions. [2019-11-20 00:16:25,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-20 00:16:25,958 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 223 [2019-11-20 00:16:25,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:25,962 INFO L225 Difference]: With dead ends: 3680 [2019-11-20 00:16:25,962 INFO L226 Difference]: Without dead ends: 3678 [2019-11-20 00:16:25,963 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-11-20 00:16:25,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3678 states. [2019-11-20 00:16:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3678 to 3678. [2019-11-20 00:16:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3678 states. [2019-11-20 00:16:26,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 3891 transitions. [2019-11-20 00:16:26,224 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 3891 transitions. Word has length 223 [2019-11-20 00:16:26,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:26,224 INFO L462 AbstractCegarLoop]: Abstraction has 3678 states and 3891 transitions. [2019-11-20 00:16:26,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-20 00:16:26,225 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 3891 transitions. [2019-11-20 00:16:26,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-11-20 00:16:26,228 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:26,229 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:16:26,229 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:26,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:26,230 INFO L82 PathProgramCache]: Analyzing trace with hash -1852984938, now seen corresponding path program 1 times [2019-11-20 00:16:26,230 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:26,230 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105171462] [2019-11-20 00:16:26,230 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:26,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-20 00:16:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-11-20 00:16:26,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105171462] [2019-11-20 00:16:26,302 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-20 00:16:26,302 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-20 00:16:26,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321358095] [2019-11-20 00:16:26,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-20 00:16:26,303 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-20 00:16:26,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-20 00:16:26,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-20 00:16:26,303 INFO L87 Difference]: Start difference. First operand 3678 states and 3891 transitions. Second operand 3 states. [2019-11-20 00:16:26,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-20 00:16:26,557 INFO L93 Difference]: Finished difference Result 5766 states and 6078 transitions. [2019-11-20 00:16:26,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-20 00:16:26,557 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-11-20 00:16:26,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-20 00:16:26,560 INFO L225 Difference]: With dead ends: 5766 [2019-11-20 00:16:26,560 INFO L226 Difference]: Without dead ends: 4714 [2019-11-20 00:16:26,561 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-20 00:16:26,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4714 states. [2019-11-20 00:16:26,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4714 to 3680. [2019-11-20 00:16:26,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3680 states. [2019-11-20 00:16:26,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3680 states to 3680 states and 3893 transitions. [2019-11-20 00:16:26,712 INFO L78 Accepts]: Start accepts. Automaton has 3680 states and 3893 transitions. Word has length 227 [2019-11-20 00:16:26,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-20 00:16:26,713 INFO L462 AbstractCegarLoop]: Abstraction has 3680 states and 3893 transitions. [2019-11-20 00:16:26,713 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-20 00:16:26,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3680 states and 3893 transitions. [2019-11-20 00:16:26,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-11-20 00:16:26,715 INFO L402 BasicCegarLoop]: Found error trace [2019-11-20 00:16:26,716 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 00:16:26,716 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-20 00:16:26,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-20 00:16:26,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1845395018, now seen corresponding path program 1 times [2019-11-20 00:16:26,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-20 00:16:26,717 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889727998] [2019-11-20 00:16:26,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-20 00:16:26,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:16:26,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-20 00:16:26,835 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-20 00:16:26,836 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-20 00:16:27,000 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 12:16:26 BoogieIcfgContainer [2019-11-20 00:16:27,000 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-20 00:16:27,000 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-20 00:16:27,000 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-20 00:16:27,001 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-20 00:16:27,001 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 12:15:46" (3/4) ... [2019-11-20 00:16:27,003 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-20 00:16:27,189 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_b7e5ba55-1cf6-43de-b1c5-5681efe35706/bin/uautomizer/witness.graphml [2019-11-20 00:16:27,189 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-20 00:16:27,191 INFO L168 Benchmark]: Toolchain (without parser) took 42574.67 ms. Allocated memory was 1.0 GB in the beginning and 4.3 GB in the end (delta: 3.3 GB). Free memory was 950.1 MB in the beginning and 1.6 GB in the end (delta: -625.5 MB). Peak memory consumption was 2.7 GB. Max. memory is 11.5 GB. [2019-11-20 00:16:27,191 INFO L168 Benchmark]: CDTParser took 0.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-20 00:16:27,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 563.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -220.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-20 00:16:27,192 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-11-20 00:16:27,192 INFO L168 Benchmark]: Boogie Preprocessor took 86.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-20 00:16:27,192 INFO L168 Benchmark]: RCFGBuilder took 1367.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 76.1 MB). Peak memory consumption was 76.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:16:27,193 INFO L168 Benchmark]: TraceAbstraction took 40287.05 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -508.7 MB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. [2019-11-20 00:16:27,193 INFO L168 Benchmark]: Witness Printer took 188.77 ms. Allocated memory is still 4.3 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2019-11-20 00:16:27,195 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.28 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 563.81 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 181.4 MB). Free memory was 950.1 MB in the beginning and 1.2 GB in the end (delta: -220.8 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 72.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 86.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1367.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 76.1 MB). Peak memory consumption was 76.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 40287.05 ms. Allocated memory was 1.2 GB in the beginning and 4.3 GB in the end (delta: 3.1 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -508.7 MB). Peak memory consumption was 2.6 GB. Max. memory is 11.5 GB. * Witness Printer took 188.77 ms. Allocated memory is still 4.3 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 10]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L14] int m_pc = 0; [L15] int t1_pc = 0; [L16] int t2_pc = 0; [L17] int t3_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int t2_st ; [L21] int t3_st ; [L22] int m_i ; [L23] int t1_i ; [L24] int t2_i ; [L25] int t3_i ; [L26] int M_E = 2; [L27] int T1_E = 2; [L28] int T2_E = 2; [L29] int T3_E = 2; [L30] int E_M = 2; [L31] int E_1 = 2; [L32] int E_2 = 2; [L33] int E_3 = 2; [L39] int token ; [L41] int local ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, T3_E=2, t3_i=0, t3_pc=0, t3_st=0, token=0] [L725] int __retres1 ; [L638] m_i = 1 [L639] t1_i = 1 [L640] t2_i = 1 [L641] t3_i = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L666] int kernel_st ; [L667] int tmp ; [L668] int tmp___0 ; [L672] kernel_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L294] COND TRUE m_i == 1 [L295] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L299] COND TRUE t1_i == 1 [L300] t1_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L304] COND TRUE t2_i == 1 [L305] t2_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L309] COND TRUE t3_i == 1 [L310] t3_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L431] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L436] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L441] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L446] COND FALSE !(T3_E == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L451] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L456] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L461] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L466] COND FALSE !(E_3 == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L210] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L220] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L222] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L226] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L229] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L239] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L241] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L245] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L248] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L258] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L260] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L264] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L267] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L277] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L279] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L479] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L484] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L489] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L494] COND FALSE !(T3_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L499] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L504] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L509] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L514] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L680] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L683] kernel_st = 1 [L350] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L354] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L319] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L322] COND TRUE m_st == 0 [L323] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L345] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L357] tmp = exists_runnable_thread() [L359] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L364] COND TRUE m_st == 0 [L365] int tmp_ndt_1; [L366] tmp_ndt_1 = __VERIFIER_nondet_int() [L367] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L378] COND TRUE t1_st == 0 [L379] int tmp_ndt_2; [L380] tmp_ndt_2 = __VERIFIER_nondet_int() [L381] COND TRUE \read(tmp_ndt_2) [L383] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L102] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L113] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L115] t1_pc = 1 [L116] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L392] COND TRUE t2_st == 0 [L393] int tmp_ndt_3; [L394] tmp_ndt_3 = __VERIFIER_nondet_int() [L395] COND TRUE \read(tmp_ndt_3) [L397] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L138] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L149] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L151] t2_pc = 1 [L152] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, token=0] [L406] COND TRUE t3_st == 0 [L407] int tmp_ndt_4; [L408] tmp_ndt_4 = __VERIFIER_nondet_int() [L409] COND TRUE \read(tmp_ndt_4) [L411] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L174] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L185] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, token=0] [L187] t3_pc = 1 [L188] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L354] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L319] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L322] COND TRUE m_st == 0 [L323] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L345] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L357] tmp = exists_runnable_thread() [L359] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L364] COND TRUE m_st == 0 [L365] int tmp_ndt_1; [L366] tmp_ndt_1 = __VERIFIER_nondet_int() [L367] COND TRUE \read(tmp_ndt_1) [L369] m_st = 1 [L44] int tmp_var = __VERIFIER_nondet_int(); [L46] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L57] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L60] token = __VERIFIER_nondet_int() [L61] local = token [L62] E_1 = 1 [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L210] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L220] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L222] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L226] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L229] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L230] COND TRUE E_1 == 1 [L231] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L241] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L539] tmp___0 = is_transmit1_triggered() [L541] COND TRUE \read(tmp___0) [L542] t1_st = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L245] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L248] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L249] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L258] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L260] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L264] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L267] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L268] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L277] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L279] return (__retres1); VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) VAL [E_1=1, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L64] E_1 = 2 [L65] m_pc = 1 [L66] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L378] COND TRUE t1_st == 0 [L379] int tmp_ndt_2; [L380] tmp_ndt_2 = __VERIFIER_nondet_int() [L381] COND TRUE \read(tmp_ndt_2) [L383] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L102] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L105] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-3] [L121] token += 1 [L122] E_2 = 1 [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L210] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L211] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L220] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L222] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L226] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L229] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L230] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L239] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L241] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L245] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L248] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L249] COND TRUE E_2 == 1 [L250] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L260] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L547] tmp___1 = is_transmit2_triggered() [L549] COND TRUE \read(tmp___1) [L550] t2_st = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L264] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L267] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L268] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L277] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L279] return (__retres1); VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=1, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L124] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L113] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L115] t1_pc = 1 [L116] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L392] COND TRUE t2_st == 0 [L393] int tmp_ndt_3; [L394] tmp_ndt_3 = __VERIFIER_nondet_int() [L395] COND TRUE \read(tmp_ndt_3) [L397] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L138] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L141] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-2] [L157] token += 1 [L158] E_3 = 1 [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L210] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L211] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L220] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L222] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L531] tmp = is_master_triggered() [L533] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L226] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L229] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L230] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L239] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L241] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L245] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L248] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L249] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L258] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L260] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L264] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L267] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L268] COND TRUE E_3 == 1 [L269] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L279] return (__retres1); VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=-1] [L555] tmp___2 = is_transmit3_triggered() [L557] COND TRUE \read(tmp___2) [L558] t3_st = 0 VAL [E_1=2, E_2=2, E_3=1, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=-1] [L160] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=-1] [L149] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=-1] [L151] t2_pc = 1 [L152] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, token=-1] [L406] COND TRUE t3_st == 0 [L407] int tmp_ndt_4; [L408] tmp_ndt_4 = __VERIFIER_nondet_int() [L409] COND TRUE \read(tmp_ndt_4) [L411] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=-1] [L174] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=-1] [L177] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, 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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=-1] [L193] token += 1 [L194] E_M = 1 [L524] int tmp ; [L525] int tmp___0 ; [L526] int tmp___1 ; [L527] int tmp___2 ; [L207] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L210] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L211] COND TRUE E_M == 1 [L212] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L222] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, 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=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L531] tmp = is_master_triggered() [L533] COND TRUE \read(tmp) [L534] m_st = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L226] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L229] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L230] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L239] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L241] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L539] tmp___0 = is_transmit1_triggered() [L541] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L245] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L248] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L249] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L258] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L260] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L547] tmp___1 = is_transmit2_triggered() [L549] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L264] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L267] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L268] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L277] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L279] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L555] tmp___2 = is_transmit3_triggered() [L557] COND FALSE !(\read(tmp___2)) VAL [E_1=2, E_2=2, E_3=2, E_M=1, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L196] E_M = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L185] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, token=0] [L187] t3_pc = 1 [L188] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L354] COND TRUE 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L319] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L322] COND TRUE m_st == 0 [L323] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L345] return (__retres1); VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L357] tmp = exists_runnable_thread() [L359] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L364] COND TRUE m_st == 0 [L365] int tmp_ndt_1; [L366] tmp_ndt_1 = __VERIFIER_nondet_int() [L367] COND TRUE \read(tmp_ndt_1) [L369] m_st = 1 [L44] int tmp_var = __VERIFIER_nondet_int(); [L46] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L49] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L71] COND FALSE !(token != local + 3) VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L76] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L77] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L82] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L83] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L84] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] [L10] __VERIFIER_error() VAL [E_1=2, E_2=2, E_3=2, E_M=2, local=-3, M_E=2, m_i=1, m_pc=1, 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, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, token=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 316 locations, 2 error locations. Result: UNSAFE, OverallTime: 40.2s, OverallIterations: 34, TraceHistogramMax: 3, AutomataDifference: 19.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 15598 SDtfs, 13593 SDslu, 11009 SDs, 0 SdLazy, 596 SolverSat, 276 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40218occurred in iteration=22, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 17.2s AutomataMinimizationTime, 33 MinimizatonAttempts, 6602 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 4088 NumberOfCodeBlocks, 4088 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 3827 ConstructedInterpolants, 0 QuantifiedInterpolants, 1000323 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 33 InterpolantComputations, 33 PerfectInterpolantSequences, 504/504 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...