./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.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_23b0b49a-429a-465c-9db6-f37db95d84e3/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_23b0b49a-429a-465c-9db6-f37db95d84e3/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_23b0b49a-429a-465c-9db6-f37db95d84e3/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_23b0b49a-429a-465c-9db6-f37db95d84e3/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_23b0b49a-429a-465c-9db6-f37db95d84e3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_23b0b49a-429a-465c-9db6-f37db95d84e3/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 216b1eba72c80bc0eec8bb9ab0298bf8baf472d8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-19 21:59:11,638 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 21:59:11,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 21:59:11,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 21:59:11,655 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 21:59:11,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 21:59:11,659 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 21:59:11,667 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 21:59:11,672 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 21:59:11,676 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 21:59:11,677 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 21:59:11,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 21:59:11,678 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 21:59:11,681 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 21:59:11,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 21:59:11,683 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 21:59:11,684 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 21:59:11,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 21:59:11,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 21:59:11,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 21:59:11,694 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 21:59:11,696 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 21:59:11,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 21:59:11,699 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 21:59:11,703 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 21:59:11,703 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 21:59:11,703 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 21:59:11,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 21:59:11,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 21:59:11,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 21:59:11,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 21:59:11,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 21:59:11,708 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 21:59:11,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 21:59:11,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 21:59:11,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 21:59:11,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 21:59:11,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 21:59:11,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 21:59:11,711 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 21:59:11,712 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 21:59:11,713 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_23b0b49a-429a-465c-9db6-f37db95d84e3/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 21:59:11,737 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 21:59:11,747 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 21:59:11,748 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 21:59:11,748 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 21:59:11,749 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 21:59:11,749 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 21:59:11,749 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 21:59:11,749 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 21:59:11,750 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 21:59:11,750 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 21:59:11,750 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 21:59:11,750 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 21:59:11,750 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 21:59:11,751 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 21:59:11,751 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 21:59:11,751 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 21:59:11,751 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 21:59:11,751 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 21:59:11,753 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 21:59:11,753 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 21:59:11,753 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 21:59:11,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 21:59:11,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 21:59:11,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 21:59:11,754 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 21:59:11,754 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 21:59:11,754 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 21:59:11,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 21:59:11,755 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_23b0b49a-429a-465c-9db6-f37db95d84e3/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 -> 216b1eba72c80bc0eec8bb9ab0298bf8baf472d8 [2019-11-19 21:59:11,926 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 21:59:11,940 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 21:59:11,943 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 21:59:11,944 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 21:59:11,944 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 21:59:11,945 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_23b0b49a-429a-465c-9db6-f37db95d84e3/bin/uautomizer/../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2019-11-19 21:59:12,001 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_23b0b49a-429a-465c-9db6-f37db95d84e3/bin/uautomizer/data/6e8677372/27d30c38db5c4c8191f834f16a9383e2/FLAG0c7f36abd [2019-11-19 21:59:12,402 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 21:59:12,403 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_23b0b49a-429a-465c-9db6-f37db95d84e3/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2019-11-19 21:59:12,410 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_23b0b49a-429a-465c-9db6-f37db95d84e3/bin/uautomizer/data/6e8677372/27d30c38db5c4c8191f834f16a9383e2/FLAG0c7f36abd [2019-11-19 21:59:12,421 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_23b0b49a-429a-465c-9db6-f37db95d84e3/bin/uautomizer/data/6e8677372/27d30c38db5c4c8191f834f16a9383e2 [2019-11-19 21:59:12,423 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 21:59:12,424 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 21:59:12,425 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 21:59:12,425 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 21:59:12,429 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 21:59:12,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:59:12" (1/1) ... [2019-11-19 21:59:12,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e95bc24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12, skipping insertion in model container [2019-11-19 21:59:12,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:59:12" (1/1) ... [2019-11-19 21:59:12,439 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 21:59:12,490 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 21:59:12,804 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:59:12,813 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 21:59:12,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 21:59:12,899 INFO L192 MainTranslator]: Completed translation [2019-11-19 21:59:12,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12 WrapperNode [2019-11-19 21:59:12,899 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 21:59:12,900 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 21:59:12,900 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 21:59:12,900 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 21:59:12,906 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2019-11-19 21:59:12,917 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2019-11-19 21:59:12,960 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 21:59:12,960 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 21:59:12,960 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 21:59:12,961 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 21:59:12,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2019-11-19 21:59:12,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2019-11-19 21:59:12,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2019-11-19 21:59:12,972 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2019-11-19 21:59:12,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2019-11-19 21:59:12,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2019-11-19 21:59:12,995 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... [2019-11-19 21:59:13,000 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 21:59:13,001 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 21:59:13,001 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 21:59:13,001 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 21:59:13,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_23b0b49a-429a-465c-9db6-f37db95d84e3/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-19 21:59:13,059 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 21:59:13,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 21:59:13,836 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 21:59:13,837 INFO L285 CfgBuilder]: Removed 105 assume(true) statements. [2019-11-19 21:59:13,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:59:13 BoogieIcfgContainer [2019-11-19 21:59:13,838 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 21:59:13,839 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 21:59:13,839 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 21:59:13,842 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 21:59:13,843 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:59:12" (1/3) ... [2019-11-19 21:59:13,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1352529b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:59:13, skipping insertion in model container [2019-11-19 21:59:13,844 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:59:12" (2/3) ... [2019-11-19 21:59:13,844 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1352529b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:59:13, skipping insertion in model container [2019-11-19 21:59:13,845 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:59:13" (3/3) ... [2019-11-19 21:59:13,846 INFO L109 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2019-11-19 21:59:13,856 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 21:59:13,862 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-11-19 21:59:13,873 INFO L249 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2019-11-19 21:59:13,908 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 21:59:13,908 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 21:59:13,908 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 21:59:13,908 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 21:59:13,908 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 21:59:13,909 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 21:59:13,909 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 21:59:13,909 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 21:59:13,936 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states. [2019-11-19 21:59:13,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 21:59:13,947 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:13,947 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:59:13,948 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:13,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:13,953 INFO L82 PathProgramCache]: Analyzing trace with hash 603110903, now seen corresponding path program 1 times [2019-11-19 21:59:13,961 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:13,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525967853] [2019-11-19 21:59:13,962 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:14,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:14,123 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-19 21:59:14,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525967853] [2019-11-19 21:59:14,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:14,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:59:14,126 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746798743] [2019-11-19 21:59:14,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:14,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:14,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:14,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:14,146 INFO L87 Difference]: Start difference. First operand 225 states. Second operand 3 states. [2019-11-19 21:59:14,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:14,201 INFO L93 Difference]: Finished difference Result 445 states and 697 transitions. [2019-11-19 21:59:14,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:14,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-19 21:59:14,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:14,214 INFO L225 Difference]: With dead ends: 445 [2019-11-19 21:59:14,214 INFO L226 Difference]: Without dead ends: 221 [2019-11-19 21:59:14,218 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-19 21:59:14,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2019-11-19 21:59:14,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2019-11-19 21:59:14,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2019-11-19 21:59:14,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 335 transitions. [2019-11-19 21:59:14,274 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 335 transitions. Word has length 50 [2019-11-19 21:59:14,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:14,275 INFO L462 AbstractCegarLoop]: Abstraction has 221 states and 335 transitions. [2019-11-19 21:59:14,275 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:14,275 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 335 transitions. [2019-11-19 21:59:14,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 21:59:14,277 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:14,277 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:59:14,277 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:14,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:14,278 INFO L82 PathProgramCache]: Analyzing trace with hash -1325161799, now seen corresponding path program 1 times [2019-11-19 21:59:14,278 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:14,278 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658803109] [2019-11-19 21:59:14,279 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:14,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:14,321 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-19 21:59:14,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658803109] [2019-11-19 21:59:14,321 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:14,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:59:14,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028159058] [2019-11-19 21:59:14,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:14,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:14,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:14,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:14,324 INFO L87 Difference]: Start difference. First operand 221 states and 335 transitions. Second operand 3 states. [2019-11-19 21:59:14,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:14,395 INFO L93 Difference]: Finished difference Result 595 states and 901 transitions. [2019-11-19 21:59:14,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:14,395 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-19 21:59:14,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:14,399 INFO L225 Difference]: With dead ends: 595 [2019-11-19 21:59:14,399 INFO L226 Difference]: Without dead ends: 381 [2019-11-19 21:59:14,401 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-19 21:59:14,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2019-11-19 21:59:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2019-11-19 21:59:14,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-19 21:59:14,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 570 transitions. [2019-11-19 21:59:14,435 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 570 transitions. Word has length 50 [2019-11-19 21:59:14,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:14,436 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 570 transitions. [2019-11-19 21:59:14,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:14,436 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 570 transitions. [2019-11-19 21:59:14,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 21:59:14,438 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:14,438 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:59:14,438 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:14,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:14,439 INFO L82 PathProgramCache]: Analyzing trace with hash 102769205, now seen corresponding path program 1 times [2019-11-19 21:59:14,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:14,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462183592] [2019-11-19 21:59:14,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:14,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:14,476 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-19 21:59:14,476 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462183592] [2019-11-19 21:59:14,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:14,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:59:14,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150127071] [2019-11-19 21:59:14,478 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:14,478 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:14,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:14,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:14,478 INFO L87 Difference]: Start difference. First operand 377 states and 570 transitions. Second operand 3 states. [2019-11-19 21:59:14,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:14,542 INFO L93 Difference]: Finished difference Result 746 states and 1129 transitions. [2019-11-19 21:59:14,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:14,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-19 21:59:14,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:14,548 INFO L225 Difference]: With dead ends: 746 [2019-11-19 21:59:14,549 INFO L226 Difference]: Without dead ends: 377 [2019-11-19 21:59:14,550 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-19 21:59:14,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-19 21:59:14,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-19 21:59:14,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-19 21:59:14,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 562 transitions. [2019-11-19 21:59:14,584 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 562 transitions. Word has length 50 [2019-11-19 21:59:14,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:14,584 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 562 transitions. [2019-11-19 21:59:14,584 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:14,584 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 562 transitions. [2019-11-19 21:59:14,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 21:59:14,586 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:14,587 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:59:14,587 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:14,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:14,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1811399481, now seen corresponding path program 1 times [2019-11-19 21:59:14,587 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:14,588 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967976723] [2019-11-19 21:59:14,588 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:14,626 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-19 21:59:14,626 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967976723] [2019-11-19 21:59:14,626 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:14,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:59:14,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180131012] [2019-11-19 21:59:14,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:14,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:14,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:14,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:14,628 INFO L87 Difference]: Start difference. First operand 377 states and 562 transitions. Second operand 3 states. [2019-11-19 21:59:14,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:14,661 INFO L93 Difference]: Finished difference Result 745 states and 1112 transitions. [2019-11-19 21:59:14,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:14,661 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-19 21:59:14,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:14,664 INFO L225 Difference]: With dead ends: 745 [2019-11-19 21:59:14,664 INFO L226 Difference]: Without dead ends: 377 [2019-11-19 21:59:14,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-19 21:59:14,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-19 21:59:14,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-19 21:59:14,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-19 21:59:14,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 554 transitions. [2019-11-19 21:59:14,684 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 554 transitions. Word has length 50 [2019-11-19 21:59:14,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:14,685 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 554 transitions. [2019-11-19 21:59:14,685 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:14,685 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 554 transitions. [2019-11-19 21:59:14,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 21:59:14,687 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:14,687 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:59:14,687 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:14,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:14,687 INFO L82 PathProgramCache]: Analyzing trace with hash 65401269, now seen corresponding path program 1 times [2019-11-19 21:59:14,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:14,688 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241296021] [2019-11-19 21:59:14,688 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:14,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:14,739 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-19 21:59:14,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241296021] [2019-11-19 21:59:14,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:14,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:59:14,740 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691463747] [2019-11-19 21:59:14,740 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:14,741 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:14,741 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:14,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:14,741 INFO L87 Difference]: Start difference. First operand 377 states and 554 transitions. Second operand 3 states. [2019-11-19 21:59:14,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:14,802 INFO L93 Difference]: Finished difference Result 744 states and 1095 transitions. [2019-11-19 21:59:14,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:14,803 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-19 21:59:14,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:14,805 INFO L225 Difference]: With dead ends: 744 [2019-11-19 21:59:14,805 INFO L226 Difference]: Without dead ends: 377 [2019-11-19 21:59:14,806 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-19 21:59:14,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-19 21:59:14,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-19 21:59:14,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-19 21:59:14,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 538 transitions. [2019-11-19 21:59:14,828 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 538 transitions. Word has length 50 [2019-11-19 21:59:14,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:14,828 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 538 transitions. [2019-11-19 21:59:14,828 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:14,828 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 538 transitions. [2019-11-19 21:59:14,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 21:59:14,830 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:14,831 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:59:14,831 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:14,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:14,832 INFO L82 PathProgramCache]: Analyzing trace with hash 25960058, now seen corresponding path program 1 times [2019-11-19 21:59:14,832 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:14,832 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551943847] [2019-11-19 21:59:14,833 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:14,894 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-19 21:59:14,896 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551943847] [2019-11-19 21:59:14,896 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:14,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:59:14,897 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840940507] [2019-11-19 21:59:14,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:14,900 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:14,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:14,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:14,901 INFO L87 Difference]: Start difference. First operand 377 states and 538 transitions. Second operand 3 states. [2019-11-19 21:59:14,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:14,960 INFO L93 Difference]: Finished difference Result 743 states and 1062 transitions. [2019-11-19 21:59:14,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:14,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-19 21:59:14,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:14,963 INFO L225 Difference]: With dead ends: 743 [2019-11-19 21:59:14,963 INFO L226 Difference]: Without dead ends: 377 [2019-11-19 21:59:14,965 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-19 21:59:14,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-19 21:59:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-19 21:59:14,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-19 21:59:14,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 522 transitions. [2019-11-19 21:59:14,987 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 522 transitions. Word has length 50 [2019-11-19 21:59:14,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:14,987 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 522 transitions. [2019-11-19 21:59:14,987 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:14,987 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 522 transitions. [2019-11-19 21:59:14,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 21:59:14,989 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:14,989 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:59:14,989 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:14,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:14,990 INFO L82 PathProgramCache]: Analyzing trace with hash 1177649081, now seen corresponding path program 1 times [2019-11-19 21:59:14,990 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:14,990 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91574229] [2019-11-19 21:59:14,990 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:14,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:15,026 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-19 21:59:15,026 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91574229] [2019-11-19 21:59:15,027 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:15,027 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:59:15,027 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1348619942] [2019-11-19 21:59:15,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:15,028 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:15,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:15,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:15,028 INFO L87 Difference]: Start difference. First operand 377 states and 522 transitions. Second operand 3 states. [2019-11-19 21:59:15,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:15,093 INFO L93 Difference]: Finished difference Result 742 states and 1029 transitions. [2019-11-19 21:59:15,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:15,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-19 21:59:15,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:15,097 INFO L225 Difference]: With dead ends: 742 [2019-11-19 21:59:15,098 INFO L226 Difference]: Without dead ends: 377 [2019-11-19 21:59:15,100 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-19 21:59:15,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2019-11-19 21:59:15,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2019-11-19 21:59:15,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2019-11-19 21:59:15,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 506 transitions. [2019-11-19 21:59:15,123 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 506 transitions. Word has length 50 [2019-11-19 21:59:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:15,123 INFO L462 AbstractCegarLoop]: Abstraction has 377 states and 506 transitions. [2019-11-19 21:59:15,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 506 transitions. [2019-11-19 21:59:15,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-19 21:59:15,125 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:15,126 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:59:15,126 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:15,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:15,126 INFO L82 PathProgramCache]: Analyzing trace with hash -1947581763, now seen corresponding path program 1 times [2019-11-19 21:59:15,127 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:15,127 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886849406] [2019-11-19 21:59:15,128 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:15,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:15,240 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-19 21:59:15,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886849406] [2019-11-19 21:59:15,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:15,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:59:15,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127300616] [2019-11-19 21:59:15,242 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:15,242 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:15,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:15,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:15,243 INFO L87 Difference]: Start difference. First operand 377 states and 506 transitions. Second operand 3 states. [2019-11-19 21:59:15,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:15,317 INFO L93 Difference]: Finished difference Result 1050 states and 1412 transitions. [2019-11-19 21:59:15,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:15,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-19 21:59:15,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:15,322 INFO L225 Difference]: With dead ends: 1050 [2019-11-19 21:59:15,323 INFO L226 Difference]: Without dead ends: 687 [2019-11-19 21:59:15,324 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-19 21:59:15,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2019-11-19 21:59:15,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 649. [2019-11-19 21:59:15,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 649 states. [2019-11-19 21:59:15,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 649 states to 649 states and 861 transitions. [2019-11-19 21:59:15,360 INFO L78 Accepts]: Start accepts. Automaton has 649 states and 861 transitions. Word has length 50 [2019-11-19 21:59:15,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:15,360 INFO L462 AbstractCegarLoop]: Abstraction has 649 states and 861 transitions. [2019-11-19 21:59:15,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:15,361 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 861 transitions. [2019-11-19 21:59:15,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-19 21:59:15,362 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:15,362 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] [2019-11-19 21:59:15,362 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:15,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:15,363 INFO L82 PathProgramCache]: Analyzing trace with hash 647371149, now seen corresponding path program 1 times [2019-11-19 21:59:15,363 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:15,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953558848] [2019-11-19 21:59:15,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:15,432 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-19 21:59:15,432 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953558848] [2019-11-19 21:59:15,432 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:15,432 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:59:15,434 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607402627] [2019-11-19 21:59:15,435 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:59:15,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:15,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:59:15,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:59:15,435 INFO L87 Difference]: Start difference. First operand 649 states and 861 transitions. Second operand 5 states. [2019-11-19 21:59:15,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:15,600 INFO L93 Difference]: Finished difference Result 1534 states and 2059 transitions. [2019-11-19 21:59:15,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:59:15,601 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-19 21:59:15,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:15,606 INFO L225 Difference]: With dead ends: 1534 [2019-11-19 21:59:15,606 INFO L226 Difference]: Without dead ends: 903 [2019-11-19 21:59:15,608 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-19 21:59:15,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 903 states. [2019-11-19 21:59:15,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 903 to 655. [2019-11-19 21:59:15,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 655 states. [2019-11-19 21:59:15,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 655 states to 655 states and 852 transitions. [2019-11-19 21:59:15,656 INFO L78 Accepts]: Start accepts. Automaton has 655 states and 852 transitions. Word has length 81 [2019-11-19 21:59:15,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:15,657 INFO L462 AbstractCegarLoop]: Abstraction has 655 states and 852 transitions. [2019-11-19 21:59:15,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:59:15,657 INFO L276 IsEmpty]: Start isEmpty. Operand 655 states and 852 transitions. [2019-11-19 21:59:15,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-19 21:59:15,658 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:15,658 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] [2019-11-19 21:59:15,659 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:15,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:15,659 INFO L82 PathProgramCache]: Analyzing trace with hash 83505161, now seen corresponding path program 1 times [2019-11-19 21:59:15,659 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:15,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092162860] [2019-11-19 21:59:15,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:15,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:15,736 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-19 21:59:15,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092162860] [2019-11-19 21:59:15,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:15,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:59:15,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805470969] [2019-11-19 21:59:15,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:59:15,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:15,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:59:15,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:59:15,766 INFO L87 Difference]: Start difference. First operand 655 states and 852 transitions. Second operand 5 states. [2019-11-19 21:59:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:15,935 INFO L93 Difference]: Finished difference Result 1575 states and 2073 transitions. [2019-11-19 21:59:15,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:59:15,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-19 21:59:15,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:15,941 INFO L225 Difference]: With dead ends: 1575 [2019-11-19 21:59:15,941 INFO L226 Difference]: Without dead ends: 945 [2019-11-19 21:59:15,943 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-19 21:59:15,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2019-11-19 21:59:15,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 661. [2019-11-19 21:59:15,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 661 states. [2019-11-19 21:59:15,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 843 transitions. [2019-11-19 21:59:15,985 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 843 transitions. Word has length 81 [2019-11-19 21:59:15,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:15,986 INFO L462 AbstractCegarLoop]: Abstraction has 661 states and 843 transitions. [2019-11-19 21:59:15,986 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:59:15,986 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 843 transitions. [2019-11-19 21:59:15,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-19 21:59:15,987 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:15,987 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] [2019-11-19 21:59:15,988 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:15,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:15,988 INFO L82 PathProgramCache]: Analyzing trace with hash 736088965, now seen corresponding path program 1 times [2019-11-19 21:59:15,988 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:15,988 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701504438] [2019-11-19 21:59:15,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:15,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:16,030 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-19 21:59:16,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701504438] [2019-11-19 21:59:16,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:16,031 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:59:16,031 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254673436] [2019-11-19 21:59:16,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:59:16,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:16,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:59:16,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:59:16,032 INFO L87 Difference]: Start difference. First operand 661 states and 843 transitions. Second operand 5 states. [2019-11-19 21:59:16,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:16,199 INFO L93 Difference]: Finished difference Result 1838 states and 2375 transitions. [2019-11-19 21:59:16,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 21:59:16,200 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 81 [2019-11-19 21:59:16,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:16,207 INFO L225 Difference]: With dead ends: 1838 [2019-11-19 21:59:16,207 INFO L226 Difference]: Without dead ends: 1209 [2019-11-19 21:59:16,208 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-19 21:59:16,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1209 states. [2019-11-19 21:59:16,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1209 to 673. [2019-11-19 21:59:16,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2019-11-19 21:59:16,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 842 transitions. [2019-11-19 21:59:16,260 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 842 transitions. Word has length 81 [2019-11-19 21:59:16,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:16,260 INFO L462 AbstractCegarLoop]: Abstraction has 673 states and 842 transitions. [2019-11-19 21:59:16,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:59:16,261 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 842 transitions. [2019-11-19 21:59:16,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-19 21:59:16,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:16,262 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] [2019-11-19 21:59:16,263 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:16,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:16,263 INFO L82 PathProgramCache]: Analyzing trace with hash -284979389, now seen corresponding path program 1 times [2019-11-19 21:59:16,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:16,263 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374661710] [2019-11-19 21:59:16,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:16,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:16,301 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-19 21:59:16,301 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374661710] [2019-11-19 21:59:16,301 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:16,301 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:59:16,302 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935644596] [2019-11-19 21:59:16,302 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:16,302 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:16,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:16,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:16,303 INFO L87 Difference]: Start difference. First operand 673 states and 842 transitions. Second operand 3 states. [2019-11-19 21:59:16,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:16,402 INFO L93 Difference]: Finished difference Result 1813 states and 2270 transitions. [2019-11-19 21:59:16,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:16,403 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 81 [2019-11-19 21:59:16,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:16,409 INFO L225 Difference]: With dead ends: 1813 [2019-11-19 21:59:16,409 INFO L226 Difference]: Without dead ends: 1178 [2019-11-19 21:59:16,411 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-19 21:59:16,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1178 states. [2019-11-19 21:59:16,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1178 to 1174. [2019-11-19 21:59:16,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1174 states. [2019-11-19 21:59:16,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1174 states to 1174 states and 1452 transitions. [2019-11-19 21:59:16,497 INFO L78 Accepts]: Start accepts. Automaton has 1174 states and 1452 transitions. Word has length 81 [2019-11-19 21:59:16,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:16,498 INFO L462 AbstractCegarLoop]: Abstraction has 1174 states and 1452 transitions. [2019-11-19 21:59:16,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:16,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1174 states and 1452 transitions. [2019-11-19 21:59:16,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-19 21:59:16,499 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:16,500 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] [2019-11-19 21:59:16,500 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:16,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:16,500 INFO L82 PathProgramCache]: Analyzing trace with hash 206796516, now seen corresponding path program 1 times [2019-11-19 21:59:16,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:16,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493771971] [2019-11-19 21:59:16,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:16,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:16,539 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-19 21:59:16,539 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493771971] [2019-11-19 21:59:16,539 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:16,539 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:59:16,540 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346347654] [2019-11-19 21:59:16,540 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:16,540 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:16,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:16,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:16,541 INFO L87 Difference]: Start difference. First operand 1174 states and 1452 transitions. Second operand 3 states. [2019-11-19 21:59:16,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:16,711 INFO L93 Difference]: Finished difference Result 3254 states and 4030 transitions. [2019-11-19 21:59:16,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:16,711 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-19 21:59:16,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:16,723 INFO L225 Difference]: With dead ends: 3254 [2019-11-19 21:59:16,723 INFO L226 Difference]: Without dead ends: 2118 [2019-11-19 21:59:16,725 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-19 21:59:16,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2118 states. [2019-11-19 21:59:16,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2118 to 2114. [2019-11-19 21:59:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2114 states. [2019-11-19 21:59:16,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2114 states to 2114 states and 2598 transitions. [2019-11-19 21:59:16,890 INFO L78 Accepts]: Start accepts. Automaton has 2114 states and 2598 transitions. Word has length 82 [2019-11-19 21:59:16,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:16,891 INFO L462 AbstractCegarLoop]: Abstraction has 2114 states and 2598 transitions. [2019-11-19 21:59:16,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:16,891 INFO L276 IsEmpty]: Start isEmpty. Operand 2114 states and 2598 transitions. [2019-11-19 21:59:16,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2019-11-19 21:59:16,893 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:16,894 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] [2019-11-19 21:59:16,894 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:16,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:16,894 INFO L82 PathProgramCache]: Analyzing trace with hash 233862118, now seen corresponding path program 1 times [2019-11-19 21:59:16,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:16,895 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208095385] [2019-11-19 21:59:16,895 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:16,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:16,916 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-19 21:59:16,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208095385] [2019-11-19 21:59:16,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:16,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:59:16,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162126199] [2019-11-19 21:59:16,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:16,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:16,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:16,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:16,918 INFO L87 Difference]: Start difference. First operand 2114 states and 2598 transitions. Second operand 3 states. [2019-11-19 21:59:17,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:17,154 INFO L93 Difference]: Finished difference Result 4158 states and 5120 transitions. [2019-11-19 21:59:17,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:17,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2019-11-19 21:59:17,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:17,165 INFO L225 Difference]: With dead ends: 4158 [2019-11-19 21:59:17,165 INFO L226 Difference]: Without dead ends: 2082 [2019-11-19 21:59:17,167 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-19 21:59:17,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2019-11-19 21:59:17,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 2082. [2019-11-19 21:59:17,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2082 states. [2019-11-19 21:59:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2082 states to 2082 states and 2563 transitions. [2019-11-19 21:59:17,331 INFO L78 Accepts]: Start accepts. Automaton has 2082 states and 2563 transitions. Word has length 82 [2019-11-19 21:59:17,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:17,332 INFO L462 AbstractCegarLoop]: Abstraction has 2082 states and 2563 transitions. [2019-11-19 21:59:17,332 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:17,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2082 states and 2563 transitions. [2019-11-19 21:59:17,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-11-19 21:59:17,334 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:17,334 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] [2019-11-19 21:59:17,334 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:17,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:17,334 INFO L82 PathProgramCache]: Analyzing trace with hash 794948131, now seen corresponding path program 1 times [2019-11-19 21:59:17,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:17,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074460571] [2019-11-19 21:59:17,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:17,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:17,364 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-19 21:59:17,364 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074460571] [2019-11-19 21:59:17,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:17,364 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:59:17,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331522553] [2019-11-19 21:59:17,365 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:17,365 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:17,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:17,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:17,366 INFO L87 Difference]: Start difference. First operand 2082 states and 2563 transitions. Second operand 3 states. [2019-11-19 21:59:17,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:17,634 INFO L93 Difference]: Finished difference Result 5880 states and 7201 transitions. [2019-11-19 21:59:17,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:17,635 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 83 [2019-11-19 21:59:17,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:17,650 INFO L225 Difference]: With dead ends: 5880 [2019-11-19 21:59:17,651 INFO L226 Difference]: Without dead ends: 2958 [2019-11-19 21:59:17,655 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-19 21:59:17,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2958 states. [2019-11-19 21:59:17,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2958 to 2958. [2019-11-19 21:59:17,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2958 states. [2019-11-19 21:59:17,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2958 states to 2958 states and 3600 transitions. [2019-11-19 21:59:17,855 INFO L78 Accepts]: Start accepts. Automaton has 2958 states and 3600 transitions. Word has length 83 [2019-11-19 21:59:17,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:17,855 INFO L462 AbstractCegarLoop]: Abstraction has 2958 states and 3600 transitions. [2019-11-19 21:59:17,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:17,856 INFO L276 IsEmpty]: Start isEmpty. Operand 2958 states and 3600 transitions. [2019-11-19 21:59:17,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-19 21:59:17,859 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:17,859 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] [2019-11-19 21:59:17,859 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:17,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:17,860 INFO L82 PathProgramCache]: Analyzing trace with hash -471564153, now seen corresponding path program 1 times [2019-11-19 21:59:17,860 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:17,860 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205417862] [2019-11-19 21:59:17,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:17,911 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-19 21:59:17,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205417862] [2019-11-19 21:59:17,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:17,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:59:17,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516031445] [2019-11-19 21:59:17,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:17,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:17,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:17,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:17,913 INFO L87 Difference]: Start difference. First operand 2958 states and 3600 transitions. Second operand 3 states. [2019-11-19 21:59:18,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:18,174 INFO L93 Difference]: Finished difference Result 6752 states and 8190 transitions. [2019-11-19 21:59:18,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:18,175 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-19 21:59:18,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:18,196 INFO L225 Difference]: With dead ends: 6752 [2019-11-19 21:59:18,196 INFO L226 Difference]: Without dead ends: 3821 [2019-11-19 21:59:18,201 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-19 21:59:18,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3821 states. [2019-11-19 21:59:18,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3821 to 3797. [2019-11-19 21:59:18,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3797 states. [2019-11-19 21:59:18,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3797 states to 3797 states and 4566 transitions. [2019-11-19 21:59:18,501 INFO L78 Accepts]: Start accepts. Automaton has 3797 states and 4566 transitions. Word has length 106 [2019-11-19 21:59:18,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:18,502 INFO L462 AbstractCegarLoop]: Abstraction has 3797 states and 4566 transitions. [2019-11-19 21:59:18,502 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:18,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3797 states and 4566 transitions. [2019-11-19 21:59:18,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-19 21:59:18,506 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:18,506 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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-19 21:59:18,507 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:18,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:18,507 INFO L82 PathProgramCache]: Analyzing trace with hash -264530006, now seen corresponding path program 1 times [2019-11-19 21:59:18,507 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:18,507 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452830977] [2019-11-19 21:59:18,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:18,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:18,543 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-19 21:59:18,543 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452830977] [2019-11-19 21:59:18,543 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:18,544 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:59:18,544 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301002098] [2019-11-19 21:59:18,544 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:18,544 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:18,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:18,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:18,545 INFO L87 Difference]: Start difference. First operand 3797 states and 4566 transitions. Second operand 3 states. [2019-11-19 21:59:18,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:18,801 INFO L93 Difference]: Finished difference Result 7467 states and 8962 transitions. [2019-11-19 21:59:18,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:18,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 120 [2019-11-19 21:59:18,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:18,821 INFO L225 Difference]: With dead ends: 7467 [2019-11-19 21:59:18,822 INFO L226 Difference]: Without dead ends: 3707 [2019-11-19 21:59:18,827 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-19 21:59:18,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3707 states. [2019-11-19 21:59:19,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3707 to 3707. [2019-11-19 21:59:19,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3707 states. [2019-11-19 21:59:19,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4354 transitions. [2019-11-19 21:59:19,075 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4354 transitions. Word has length 120 [2019-11-19 21:59:19,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:19,076 INFO L462 AbstractCegarLoop]: Abstraction has 3707 states and 4354 transitions. [2019-11-19 21:59:19,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:19,076 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4354 transitions. [2019-11-19 21:59:19,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-11-19 21:59:19,080 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:19,080 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:59:19,080 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:19,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:19,081 INFO L82 PathProgramCache]: Analyzing trace with hash 1818985301, now seen corresponding path program 1 times [2019-11-19 21:59:19,081 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:19,081 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851237120] [2019-11-19 21:59:19,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:19,124 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-19 21:59:19,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851237120] [2019-11-19 21:59:19,124 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:19,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:59:19,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51076254] [2019-11-19 21:59:19,125 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:19,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:19,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:19,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:19,129 INFO L87 Difference]: Start difference. First operand 3707 states and 4354 transitions. Second operand 3 states. [2019-11-19 21:59:19,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:19,379 INFO L93 Difference]: Finished difference Result 6571 states and 7758 transitions. [2019-11-19 21:59:19,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:19,380 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 121 [2019-11-19 21:59:19,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:19,407 INFO L225 Difference]: With dead ends: 6571 [2019-11-19 21:59:19,407 INFO L226 Difference]: Without dead ends: 3723 [2019-11-19 21:59:19,411 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-19 21:59:19,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2019-11-19 21:59:19,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3707. [2019-11-19 21:59:19,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3707 states. [2019-11-19 21:59:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4262 transitions. [2019-11-19 21:59:19,687 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4262 transitions. Word has length 121 [2019-11-19 21:59:19,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:19,688 INFO L462 AbstractCegarLoop]: Abstraction has 3707 states and 4262 transitions. [2019-11-19 21:59:19,688 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:19,688 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4262 transitions. [2019-11-19 21:59:19,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-11-19 21:59:19,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:19,692 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-19 21:59:19,692 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:19,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:19,693 INFO L82 PathProgramCache]: Analyzing trace with hash -654472485, now seen corresponding path program 1 times [2019-11-19 21:59:19,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:19,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861666699] [2019-11-19 21:59:19,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:19,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:19,729 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:59:19,729 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861666699] [2019-11-19 21:59:19,730 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:19,730 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:59:19,730 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545048331] [2019-11-19 21:59:19,730 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:19,731 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:19,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:19,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:19,731 INFO L87 Difference]: Start difference. First operand 3707 states and 4262 transitions. Second operand 3 states. [2019-11-19 21:59:19,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:19,950 INFO L93 Difference]: Finished difference Result 6559 states and 7560 transitions. [2019-11-19 21:59:19,951 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:19,951 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-11-19 21:59:19,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:19,971 INFO L225 Difference]: With dead ends: 6559 [2019-11-19 21:59:19,971 INFO L226 Difference]: Without dead ends: 3711 [2019-11-19 21:59:19,975 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-19 21:59:19,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3711 states. [2019-11-19 21:59:20,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3711 to 3707. [2019-11-19 21:59:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3707 states. [2019-11-19 21:59:20,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3707 states to 3707 states and 4244 transitions. [2019-11-19 21:59:20,184 INFO L78 Accepts]: Start accepts. Automaton has 3707 states and 4244 transitions. Word has length 122 [2019-11-19 21:59:20,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:20,184 INFO L462 AbstractCegarLoop]: Abstraction has 3707 states and 4244 transitions. [2019-11-19 21:59:20,184 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:20,185 INFO L276 IsEmpty]: Start isEmpty. Operand 3707 states and 4244 transitions. [2019-11-19 21:59:20,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-19 21:59:20,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:20,190 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2019-11-19 21:59:20,190 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:20,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:20,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1028326263, now seen corresponding path program 1 times [2019-11-19 21:59:20,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:20,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286949383] [2019-11-19 21:59:20,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:20,239 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-11-19 21:59:20,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286949383] [2019-11-19 21:59:20,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:20,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-19 21:59:20,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997961066] [2019-11-19 21:59:20,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:20,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:20,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:20,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:20,241 INFO L87 Difference]: Start difference. First operand 3707 states and 4244 transitions. Second operand 3 states. [2019-11-19 21:59:20,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:20,500 INFO L93 Difference]: Finished difference Result 8135 states and 9290 transitions. [2019-11-19 21:59:20,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:20,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-19 21:59:20,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:20,520 INFO L225 Difference]: With dead ends: 8135 [2019-11-19 21:59:20,520 INFO L226 Difference]: Without dead ends: 4448 [2019-11-19 21:59:20,526 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-19 21:59:20,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4448 states. [2019-11-19 21:59:20,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4448 to 4416. [2019-11-19 21:59:20,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4416 states. [2019-11-19 21:59:20,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4416 states to 4416 states and 5010 transitions. [2019-11-19 21:59:20,860 INFO L78 Accepts]: Start accepts. Automaton has 4416 states and 5010 transitions. Word has length 145 [2019-11-19 21:59:20,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:20,860 INFO L462 AbstractCegarLoop]: Abstraction has 4416 states and 5010 transitions. [2019-11-19 21:59:20,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:20,861 INFO L276 IsEmpty]: Start isEmpty. Operand 4416 states and 5010 transitions. [2019-11-19 21:59:20,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-11-19 21:59:20,866 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:20,866 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-19 21:59:20,866 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:20,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:20,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1098265157, now seen corresponding path program 1 times [2019-11-19 21:59:20,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:20,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338952926] [2019-11-19 21:59:20,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:20,914 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-19 21:59:20,914 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338952926] [2019-11-19 21:59:20,915 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:20,915 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:59:20,915 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918461041] [2019-11-19 21:59:20,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:20,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:20,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:20,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:20,916 INFO L87 Difference]: Start difference. First operand 4416 states and 5010 transitions. Second operand 3 states. [2019-11-19 21:59:21,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:21,065 INFO L93 Difference]: Finished difference Result 6055 states and 6869 transitions. [2019-11-19 21:59:21,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:21,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 148 [2019-11-19 21:59:21,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:21,069 INFO L225 Difference]: With dead ends: 6055 [2019-11-19 21:59:21,069 INFO L226 Difference]: Without dead ends: 1503 [2019-11-19 21:59:21,074 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-19 21:59:21,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-11-19 21:59:21,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-19 21:59:21,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1647 transitions. [2019-11-19 21:59:21,152 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1647 transitions. Word has length 148 [2019-11-19 21:59:21,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:21,152 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1647 transitions. [2019-11-19 21:59:21,152 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:21,153 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1647 transitions. [2019-11-19 21:59:21,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-11-19 21:59:21,155 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:21,156 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-19 21:59:21,156 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:21,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:21,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2040513564, now seen corresponding path program 1 times [2019-11-19 21:59:21,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:21,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057740415] [2019-11-19 21:59:21,157 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:21,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:21,202 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-19 21:59:21,203 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057740415] [2019-11-19 21:59:21,203 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:21,203 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:59:21,203 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312160006] [2019-11-19 21:59:21,204 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:21,204 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:21,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:21,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:21,204 INFO L87 Difference]: Start difference. First operand 1503 states and 1647 transitions. Second operand 3 states. [2019-11-19 21:59:21,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:21,308 INFO L93 Difference]: Finished difference Result 2346 states and 2580 transitions. [2019-11-19 21:59:21,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:21,309 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-11-19 21:59:21,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:21,312 INFO L225 Difference]: With dead ends: 2346 [2019-11-19 21:59:21,312 INFO L226 Difference]: Without dead ends: 1539 [2019-11-19 21:59:21,314 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-19 21:59:21,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1539 states. [2019-11-19 21:59:21,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1539 to 1503. [2019-11-19 21:59:21,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-19 21:59:21,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1627 transitions. [2019-11-19 21:59:21,392 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1627 transitions. Word has length 149 [2019-11-19 21:59:21,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:21,393 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1627 transitions. [2019-11-19 21:59:21,393 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:21,393 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1627 transitions. [2019-11-19 21:59:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-11-19 21:59:21,396 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:21,396 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, 1] [2019-11-19 21:59:21,396 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:21,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:21,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1275276035, now seen corresponding path program 1 times [2019-11-19 21:59:21,397 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:21,398 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357477052] [2019-11-19 21:59:21,398 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:21,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:21,460 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 21:59:21,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357477052] [2019-11-19 21:59:21,460 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:21,461 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:59:21,461 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430911991] [2019-11-19 21:59:21,461 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:21,462 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:21,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:21,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:21,463 INFO L87 Difference]: Start difference. First operand 1503 states and 1627 transitions. Second operand 3 states. [2019-11-19 21:59:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:21,562 INFO L93 Difference]: Finished difference Result 2657 states and 2881 transitions. [2019-11-19 21:59:21,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:21,563 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-11-19 21:59:21,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:21,566 INFO L225 Difference]: With dead ends: 2657 [2019-11-19 21:59:21,566 INFO L226 Difference]: Without dead ends: 1503 [2019-11-19 21:59:21,568 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-19 21:59:21,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2019-11-19 21:59:21,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2019-11-19 21:59:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-19 21:59:21,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1605 transitions. [2019-11-19 21:59:21,648 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1605 transitions. Word has length 150 [2019-11-19 21:59:21,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:21,649 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1605 transitions. [2019-11-19 21:59:21,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:21,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1605 transitions. [2019-11-19 21:59:21,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-11-19 21:59:21,652 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:21,652 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, 1, 1, 1] [2019-11-19 21:59:21,652 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:21,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:21,653 INFO L82 PathProgramCache]: Analyzing trace with hash -660923245, now seen corresponding path program 1 times [2019-11-19 21:59:21,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:21,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346931803] [2019-11-19 21:59:21,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-19 21:59:21,792 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346931803] [2019-11-19 21:59:21,792 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:21,792 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-19 21:59:21,792 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126468241] [2019-11-19 21:59:21,793 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-19 21:59:21,793 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:21,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-19 21:59:21,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:59:21,794 INFO L87 Difference]: Start difference. First operand 1503 states and 1605 transitions. Second operand 5 states. [2019-11-19 21:59:21,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:21,915 INFO L93 Difference]: Finished difference Result 1503 states and 1605 transitions. [2019-11-19 21:59:21,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-19 21:59:21,915 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2019-11-19 21:59:21,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:21,918 INFO L225 Difference]: With dead ends: 1503 [2019-11-19 21:59:21,918 INFO L226 Difference]: Without dead ends: 1501 [2019-11-19 21:59:21,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-19 21:59:21,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1501 states. [2019-11-19 21:59:22,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1501 to 1501. [2019-11-19 21:59:22,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1501 states. [2019-11-19 21:59:22,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1501 states to 1501 states and 1602 transitions. [2019-11-19 21:59:22,046 INFO L78 Accepts]: Start accepts. Automaton has 1501 states and 1602 transitions. Word has length 152 [2019-11-19 21:59:22,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:22,046 INFO L462 AbstractCegarLoop]: Abstraction has 1501 states and 1602 transitions. [2019-11-19 21:59:22,047 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-19 21:59:22,047 INFO L276 IsEmpty]: Start isEmpty. Operand 1501 states and 1602 transitions. [2019-11-19 21:59:22,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-19 21:59:22,050 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:22,052 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:59:22,052 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:22,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:22,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1317806111, now seen corresponding path program 1 times [2019-11-19 21:59:22,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:22,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360637186] [2019-11-19 21:59:22,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 21:59:22,102 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-11-19 21:59:22,102 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360637186] [2019-11-19 21:59:22,103 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 21:59:22,103 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 21:59:22,103 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090689495] [2019-11-19 21:59:22,103 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 21:59:22,104 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 21:59:22,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 21:59:22,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 21:59:22,104 INFO L87 Difference]: Start difference. First operand 1501 states and 1602 transitions. Second operand 3 states. [2019-11-19 21:59:22,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 21:59:22,239 INFO L93 Difference]: Finished difference Result 2757 states and 2935 transitions. [2019-11-19 21:59:22,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 21:59:22,239 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-19 21:59:22,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 21:59:22,243 INFO L225 Difference]: With dead ends: 2757 [2019-11-19 21:59:22,243 INFO L226 Difference]: Without dead ends: 2121 [2019-11-19 21:59:22,245 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-19 21:59:22,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2019-11-19 21:59:22,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 1503. [2019-11-19 21:59:22,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1503 states. [2019-11-19 21:59:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1604 transitions. [2019-11-19 21:59:22,344 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1604 transitions. Word has length 156 [2019-11-19 21:59:22,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 21:59:22,344 INFO L462 AbstractCegarLoop]: Abstraction has 1503 states and 1604 transitions. [2019-11-19 21:59:22,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 21:59:22,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1604 transitions. [2019-11-19 21:59:22,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-11-19 21:59:22,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 21:59:22,348 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 21:59:22,348 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 21:59:22,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 21:59:22,348 INFO L82 PathProgramCache]: Analyzing trace with hash 1860246650, now seen corresponding path program 1 times [2019-11-19 21:59:22,348 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 21:59:22,348 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84869286] [2019-11-19 21:59:22,349 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 21:59:22,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:59:22,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 21:59:22,452 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 21:59:22,452 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 21:59:22,607 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:59:22 BoogieIcfgContainer [2019-11-19 21:59:22,607 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 21:59:22,608 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 21:59:22,608 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 21:59:22,608 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 21:59:22,609 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:59:13" (3/4) ... [2019-11-19 21:59:22,611 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 21:59:22,760 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_23b0b49a-429a-465c-9db6-f37db95d84e3/bin/uautomizer/witness.graphml [2019-11-19 21:59:22,761 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 21:59:22,762 INFO L168 Benchmark]: Toolchain (without parser) took 10337.60 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 735.6 MB). Free memory was 944.8 MB in the beginning and 1.5 GB in the end (delta: -534.7 MB). Peak memory consumption was 200.8 MB. Max. memory is 11.5 GB. [2019-11-19 21:59:22,763 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:59:22,763 INFO L168 Benchmark]: CACSL2BoogieTranslator took 474.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:59:22,763 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. [2019-11-19 21:59:22,764 INFO L168 Benchmark]: Boogie Preprocessor took 40.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 21:59:22,764 INFO L168 Benchmark]: RCFGBuilder took 837.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:59:22,765 INFO L168 Benchmark]: TraceAbstraction took 8768.34 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 604.0 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -454.4 MB). Peak memory consumption was 149.5 MB. Max. memory is 11.5 GB. [2019-11-19 21:59:22,765 INFO L168 Benchmark]: Witness Printer took 152.78 ms. Allocated memory is still 1.8 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-11-19 21:59:22,767 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 474.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -177.7 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 60.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.42 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 837.45 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 65.7 MB). Peak memory consumption was 65.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8768.34 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 604.0 MB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -454.4 MB). Peak memory consumption was 149.5 MB. Max. memory is 11.5 GB. * Witness Printer took 152.78 ms. Allocated memory is still 1.8 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 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 m_st ; [L18] int t1_st ; [L19] int t2_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int t2_i ; [L23] int M_E = 2; [L24] int T1_E = 2; [L25] int T2_E = 2; [L26] int E_M = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; [L33] int token ; [L35] int local ; VAL [E_1=2, E_2=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, token=0] [L600] int __retres1 ; [L514] m_i = 1 [L515] t1_i = 1 [L516] t2_i = 1 VAL [E_1=2, E_2=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, token=0] [L541] int kernel_st ; [L542] int tmp ; [L543] int tmp___0 ; [L547] kernel_st = 0 VAL [E_1=2, E_2=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, token=0] [L233] COND TRUE m_i == 1 [L234] m_st = 0 VAL [E_1=2, E_2=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, token=0] [L238] COND TRUE t1_i == 1 [L239] t1_st = 0 VAL [E_1=2, E_2=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, token=0] [L243] COND TRUE t2_i == 1 [L244] t2_st = 0 VAL [E_1=2, E_2=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, token=0] [L346] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=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, token=0] [L351] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=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, token=0] [L356] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=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, token=0] [L361] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=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, token=0] [L366] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=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, token=0] [L371] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=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, token=0] [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] int __retres1 ; VAL [E_1=2, E_2=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, token=0] [L168] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=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, token=0] [L178] __retres1 = 0 VAL [E_1=2, E_2=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, token=0] [L180] return (__retres1); VAL [E_1=2, E_2=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, token=0] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=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, token=0] [L184] int __retres1 ; VAL [E_1=2, E_2=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, token=0] [L187] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=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, token=0] [L197] __retres1 = 0 VAL [E_1=2, E_2=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, token=0] [L199] return (__retres1); VAL [E_1=2, E_2=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, token=0] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=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, token=0] [L203] int __retres1 ; VAL [E_1=2, E_2=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, token=0] [L206] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=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, token=0] [L216] __retres1 = 0 VAL [E_1=2, E_2=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, token=0] [L218] return (__retres1); VAL [E_1=2, E_2=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, token=0] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=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, token=0] [L384] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=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, token=0] [L389] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=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, token=0] [L394] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=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, token=0] [L399] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=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, token=0] [L404] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=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, token=0] [L409] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=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, token=0] [L555] COND TRUE 1 VAL [E_1=2, E_2=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, token=0] [L558] kernel_st = 1 [L279] int tmp ; VAL [E_1=2, E_2=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, token=0] [L283] COND TRUE 1 VAL [E_1=2, E_2=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, token=0] [L253] int __retres1 ; VAL [E_1=2, E_2=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, token=0] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [E_1=2, E_2=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, token=0] [L274] return (__retres1); VAL [E_1=2, E_2=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, token=0] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [E_1=2, E_2=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, token=0] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=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, token=0] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] t1_st = 1 VAL [E_1=2, E_2=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, token=0] [L96] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=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, token=0] [L107] COND TRUE 1 VAL [E_1=2, E_2=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, token=0] [L109] t1_pc = 1 [L110] t1_st = 2 VAL [E_1=2, E_2=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, token=0] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] t2_st = 1 VAL [E_1=2, E_2=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, token=0] [L132] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=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, token=0] [L143] COND TRUE 1 VAL [E_1=2, E_2=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, token=0] [L145] t2_pc = 1 [L146] t2_st = 2 VAL [E_1=2, E_2=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, token=0] [L283] COND TRUE 1 VAL [E_1=2, E_2=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, token=0] [L253] int __retres1 ; VAL [E_1=2, E_2=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, token=0] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [E_1=2, E_2=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, token=0] [L274] return (__retres1); VAL [E_1=2, E_2=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, token=0] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [E_1=2, E_2=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, token=0] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] COND TRUE m_pc == 0 VAL [E_1=2, E_2=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, token=0] [L51] COND TRUE 1 VAL [E_1=2, E_2=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, token=0] [L54] token = __VERIFIER_nondet_int() [L55] local = token [L56] E_1 = 1 [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] int __retres1 ; VAL [E_1=1, E_2=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, token=0] [L168] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=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, token=0] [L178] __retres1 = 0 VAL [E_1=1, E_2=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, token=0] [L180] return (__retres1); VAL [E_1=1, E_2=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, token=0] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=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, token=0] [L184] int __retres1 ; VAL [E_1=1, E_2=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, token=0] [L187] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=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, token=0] [L188] COND TRUE E_1 == 1 [L189] __retres1 = 1 VAL [E_1=1, E_2=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, token=0] [L199] return (__retres1); VAL [E_1=1, E_2=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, token=0] [L433] tmp___0 = is_transmit1_triggered() [L435] COND TRUE \read(tmp___0) [L436] t1_st = 0 VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L203] int __retres1 ; VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L206] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L207] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L216] __retres1 = 0 VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L218] return (__retres1); VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=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=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L58] E_1 = 2 [L59] m_pc = 1 [L60] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L307] COND TRUE t1_st == 0 [L308] int tmp_ndt_2; [L309] tmp_ndt_2 = __VERIFIER_nondet_int() [L310] COND TRUE \read(tmp_ndt_2) [L312] t1_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L96] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L99] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L115] token += 1 [L116] E_2 = 1 [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L168] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L169] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L178] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L180] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L425] tmp = is_master_triggered() [L427] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L184] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L187] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L188] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L197] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L199] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L203] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L206] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L207] COND TRUE E_2 == 1 [L208] __retres1 = 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L218] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L441] tmp___1 = is_transmit2_triggered() [L443] COND TRUE \read(tmp___1) [L444] t2_st = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L118] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L107] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L109] t1_pc = 1 [L110] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L321] COND TRUE t2_st == 0 [L322] int tmp_ndt_3; [L323] tmp_ndt_3 = __VERIFIER_nondet_int() [L324] COND TRUE \read(tmp_ndt_3) [L326] t2_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L132] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L135] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L151] token += 1 [L152] E_M = 1 [L419] int tmp ; [L420] int tmp___0 ; [L421] int tmp___1 ; [L165] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L168] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L169] COND TRUE E_M == 1 [L170] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L180] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L425] tmp = is_master_triggered() [L427] COND TRUE \read(tmp) [L428] m_st = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L184] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L187] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L188] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L197] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L199] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L433] tmp___0 = is_transmit1_triggered() [L435] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L203] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L206] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L207] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L216] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L218] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L441] tmp___1 = is_transmit2_triggered() [L443] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L154] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L143] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L145] t2_pc = 1 [L146] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L283] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L253] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L256] COND TRUE m_st == 0 [L257] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L274] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L286] tmp = exists_runnable_thread() [L288] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L293] COND TRUE m_st == 0 [L294] int tmp_ndt_1; [L295] tmp_ndt_1 = __VERIFIER_nondet_int() [L296] COND TRUE \read(tmp_ndt_1) [L298] m_st = 1 [L38] int tmp_var = __VERIFIER_nondet_int(); [L40] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L43] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L65] COND FALSE !(token != local + 2) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L70] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L71] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L76] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L77] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L78] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L10] __VERIFIER_error() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 225 locations, 2 error locations. Result: UNSAFE, OverallTime: 8.6s, OverallIterations: 26, TraceHistogramMax: 3, AutomataDifference: 3.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8212 SDtfs, 7053 SDslu, 5879 SDs, 0 SdLazy, 402 SolverSat, 175 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 87 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4416occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 25 MinimizatonAttempts, 1848 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 2497 NumberOfCodeBlocks, 2497 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 2315 ConstructedInterpolants, 0 QuantifiedInterpolants, 459807 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 367/367 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...