./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_2067405b-614e-49ca-8eda-9e9bd6ee68b8/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_2067405b-614e-49ca-8eda-9e9bd6ee68b8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_2067405b-614e-49ca-8eda-9e9bd6ee68b8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_2067405b-614e-49ca-8eda-9e9bd6ee68b8/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_2067405b-614e-49ca-8eda-9e9bd6ee68b8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_2067405b-614e-49ca-8eda-9e9bd6ee68b8/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a08b839794d511e255b2cbb9b4715d014c32f56d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.2.0-a4ecdab [2020-11-28 03:17:04,145 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:17:04,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:17:04,248 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:17:04,249 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:17:04,253 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:17:04,256 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:17:04,263 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:17:04,268 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:17:04,270 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:17:04,272 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:17:04,274 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:17:04,277 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:17:04,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:17:04,284 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:17:04,287 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:17:04,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:17:04,299 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:17:04,303 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:17:04,310 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:17:04,315 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:17:04,320 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:17:04,321 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:17:04,324 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:17:04,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:17:04,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:17:04,333 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:17:04,334 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:17:04,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:17:04,338 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:17:04,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:17:04,340 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:17:04,343 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:17:04,344 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:17:04,346 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:17:04,346 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:17:04,347 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:17:04,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:17:04,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:17:04,349 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:17:04,350 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:17:04,354 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_2067405b-614e-49ca-8eda-9e9bd6ee68b8/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:17:04,405 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:17:04,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:17:04,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:17:04,408 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:17:04,408 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:17:04,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:17:04,409 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:17:04,409 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:17:04,409 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:17:04,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:17:04,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:17:04,412 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:17:04,412 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:17:04,412 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:17:04,413 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:17:04,413 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:17:04,413 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:17:04,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:17:04,414 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:17:04,414 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:17:04,414 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:17:04,415 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:17:04,415 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:17:04,415 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:17:04,415 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:17:04,416 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:17:04,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:17:04,416 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:17:04,417 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:17:04,417 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_2067405b-614e-49ca-8eda-9e9bd6ee68b8/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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_2067405b-614e-49ca-8eda-9e9bd6ee68b8/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(reach_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 -> a08b839794d511e255b2cbb9b4715d014c32f56d [2020-11-28 03:17:04,756 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:17:04,799 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:17:04,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:17:04,808 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:17:04,810 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:17:04,811 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_2067405b-614e-49ca-8eda-9e9bd6ee68b8/bin/uautomizer/../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2020-11-28 03:17:04,905 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2067405b-614e-49ca-8eda-9e9bd6ee68b8/bin/uautomizer/data/53a5c57be/f738682790584c6781bc4011b834d6eb/FLAGd9257f407 [2020-11-28 03:17:05,483 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:17:05,491 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_2067405b-614e-49ca-8eda-9e9bd6ee68b8/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2020-11-28 03:17:05,504 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_2067405b-614e-49ca-8eda-9e9bd6ee68b8/bin/uautomizer/data/53a5c57be/f738682790584c6781bc4011b834d6eb/FLAGd9257f407 [2020-11-28 03:17:05,850 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_2067405b-614e-49ca-8eda-9e9bd6ee68b8/bin/uautomizer/data/53a5c57be/f738682790584c6781bc4011b834d6eb [2020-11-28 03:17:05,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:17:05,856 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:17:05,858 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:17:05,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:17:05,867 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:17:05,869 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:17:05" (1/1) ... [2020-11-28 03:17:05,871 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d504bf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:05, skipping insertion in model container [2020-11-28 03:17:05,872 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:17:05" (1/1) ... [2020-11-28 03:17:05,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:17:05,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:17:06,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:17:06,242 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:17:06,299 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:17:06,326 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:17:06,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:06 WrapperNode [2020-11-28 03:17:06,327 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:17:06,328 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:17:06,329 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:17:06,329 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:17:06,339 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:06" (1/1) ... [2020-11-28 03:17:06,350 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:06" (1/1) ... [2020-11-28 03:17:06,401 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:17:06,402 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:17:06,402 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:17:06,402 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:17:06,416 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:06" (1/1) ... [2020-11-28 03:17:06,417 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:06" (1/1) ... [2020-11-28 03:17:06,430 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:06" (1/1) ... [2020-11-28 03:17:06,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:06" (1/1) ... [2020-11-28 03:17:06,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:06" (1/1) ... [2020-11-28 03:17:06,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:06" (1/1) ... [2020-11-28 03:17:06,462 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:06" (1/1) ... [2020-11-28 03:17:06,475 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:17:06,491 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:17:06,491 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:17:06,491 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:17:06,493 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_2067405b-614e-49ca-8eda-9e9bd6ee68b8/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 [2020-11-28 03:17:06,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:17:06,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:17:06,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:17:06,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:17:07,761 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:17:07,762 INFO L298 CfgBuilder]: Removed 109 assume(true) statements. [2020-11-28 03:17:07,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:07 BoogieIcfgContainer [2020-11-28 03:17:07,767 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:17:07,772 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:17:07,775 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:17:07,779 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:17:07,779 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:17:05" (1/3) ... [2020-11-28 03:17:07,780 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f152abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:17:07, skipping insertion in model container [2020-11-28 03:17:07,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:17:06" (2/3) ... [2020-11-28 03:17:07,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f152abd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:17:07, skipping insertion in model container [2020-11-28 03:17:07,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:07" (3/3) ... [2020-11-28 03:17:07,783 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2020-11-28 03:17:07,800 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:17:07,805 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-28 03:17:07,819 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-11-28 03:17:07,866 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:17:07,867 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:17:07,867 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:17:07,867 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:17:07,867 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:17:07,867 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:17:07,867 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:17:07,867 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:17:07,891 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states. [2020-11-28 03:17:07,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-28 03:17:07,901 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:07,902 INFO L422 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] [2020-11-28 03:17:07,902 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:07,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:07,909 INFO L82 PathProgramCache]: Analyzing trace with hash 603110903, now seen corresponding path program 1 times [2020-11-28 03:17:07,920 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:07,921 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714300179] [2020-11-28 03:17:07,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:08,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:17:08,129 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714300179] [2020-11-28 03:17:08,130 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:08,130 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:17:08,131 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127793563] [2020-11-28 03:17:08,136 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:08,136 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:08,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:08,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:08,155 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2020-11-28 03:17:08,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:08,258 INFO L93 Difference]: Finished difference Result 447 states and 699 transitions. [2020-11-28 03:17:08,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:08,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-11-28 03:17:08,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:08,280 INFO L225 Difference]: With dead ends: 447 [2020-11-28 03:17:08,293 INFO L226 Difference]: Without dead ends: 221 [2020-11-28 03:17:08,299 INFO L677 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 [2020-11-28 03:17:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2020-11-28 03:17:08,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2020-11-28 03:17:08,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2020-11-28 03:17:08,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 335 transitions. [2020-11-28 03:17:08,384 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 335 transitions. Word has length 50 [2020-11-28 03:17:08,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:08,385 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 335 transitions. [2020-11-28 03:17:08,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:08,385 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 335 transitions. [2020-11-28 03:17:08,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-28 03:17:08,388 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:08,388 INFO L422 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] [2020-11-28 03:17:08,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:17:08,389 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:08,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:08,390 INFO L82 PathProgramCache]: Analyzing trace with hash -1325161799, now seen corresponding path program 1 times [2020-11-28 03:17:08,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:08,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805063917] [2020-11-28 03:17:08,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:08,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:17:08,484 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805063917] [2020-11-28 03:17:08,485 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:08,485 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:17:08,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372677355] [2020-11-28 03:17:08,490 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:08,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:08,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:08,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:08,494 INFO L87 Difference]: Start difference. First operand 221 states and 335 transitions. Second operand 3 states. [2020-11-28 03:17:08,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:08,659 INFO L93 Difference]: Finished difference Result 595 states and 901 transitions. [2020-11-28 03:17:08,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:08,664 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-11-28 03:17:08,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:08,669 INFO L225 Difference]: With dead ends: 595 [2020-11-28 03:17:08,669 INFO L226 Difference]: Without dead ends: 381 [2020-11-28 03:17:08,671 INFO L677 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 [2020-11-28 03:17:08,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2020-11-28 03:17:08,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2020-11-28 03:17:08,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-11-28 03:17:08,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 570 transitions. [2020-11-28 03:17:08,727 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 570 transitions. Word has length 50 [2020-11-28 03:17:08,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:08,728 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 570 transitions. [2020-11-28 03:17:08,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 570 transitions. [2020-11-28 03:17:08,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-28 03:17:08,730 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:08,730 INFO L422 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] [2020-11-28 03:17:08,731 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:17:08,731 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:08,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:08,732 INFO L82 PathProgramCache]: Analyzing trace with hash 102769205, now seen corresponding path program 1 times [2020-11-28 03:17:08,732 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:08,732 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294891164] [2020-11-28 03:17:08,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:08,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:08,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:17:08,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294891164] [2020-11-28 03:17:08,835 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:08,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:17:08,836 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160712903] [2020-11-28 03:17:08,836 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:17:08,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:08,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:17:08,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:17:08,846 INFO L87 Difference]: Start difference. First operand 377 states and 570 transitions. Second operand 4 states. [2020-11-28 03:17:08,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:08,992 INFO L93 Difference]: Finished difference Result 905 states and 1366 transitions. [2020-11-28 03:17:08,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:17:08,993 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-11-28 03:17:08,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:08,998 INFO L225 Difference]: With dead ends: 905 [2020-11-28 03:17:08,998 INFO L226 Difference]: Without dead ends: 536 [2020-11-28 03:17:09,001 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:17:09,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2020-11-28 03:17:09,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 377. [2020-11-28 03:17:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-11-28 03:17:09,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 567 transitions. [2020-11-28 03:17:09,052 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 567 transitions. Word has length 50 [2020-11-28 03:17:09,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:09,052 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 567 transitions. [2020-11-28 03:17:09,053 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:17:09,053 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 567 transitions. [2020-11-28 03:17:09,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-28 03:17:09,055 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:09,055 INFO L422 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] [2020-11-28 03:17:09,056 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 03:17:09,056 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:09,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:09,057 INFO L82 PathProgramCache]: Analyzing trace with hash -794624073, now seen corresponding path program 1 times [2020-11-28 03:17:09,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:09,057 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094598623] [2020-11-28 03:17:09,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:09,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:09,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:17:09,132 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094598623] [2020-11-28 03:17:09,132 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:09,132 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:17:09,132 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210428233] [2020-11-28 03:17:09,133 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:17:09,133 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:09,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:17:09,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:17:09,134 INFO L87 Difference]: Start difference. First operand 377 states and 567 transitions. Second operand 4 states. [2020-11-28 03:17:09,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:09,252 INFO L93 Difference]: Finished difference Result 903 states and 1356 transitions. [2020-11-28 03:17:09,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:17:09,253 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-11-28 03:17:09,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:09,257 INFO L225 Difference]: With dead ends: 903 [2020-11-28 03:17:09,258 INFO L226 Difference]: Without dead ends: 535 [2020-11-28 03:17:09,259 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:17:09,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 535 states. [2020-11-28 03:17:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 535 to 377. [2020-11-28 03:17:09,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-11-28 03:17:09,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 564 transitions. [2020-11-28 03:17:09,306 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 564 transitions. Word has length 50 [2020-11-28 03:17:09,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:09,307 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 564 transitions. [2020-11-28 03:17:09,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:17:09,307 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 564 transitions. [2020-11-28 03:17:09,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-28 03:17:09,309 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:09,310 INFO L422 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] [2020-11-28 03:17:09,310 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 03:17:09,311 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:09,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:09,311 INFO L82 PathProgramCache]: Analyzing trace with hash -546477579, now seen corresponding path program 1 times [2020-11-28 03:17:09,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:09,312 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73637431] [2020-11-28 03:17:09,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:09,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:09,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:17:09,414 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73637431] [2020-11-28 03:17:09,414 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:09,414 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:17:09,415 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569662947] [2020-11-28 03:17:09,415 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:09,415 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:09,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:09,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:09,417 INFO L87 Difference]: Start difference. First operand 377 states and 564 transitions. Second operand 3 states. [2020-11-28 03:17:09,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:09,493 INFO L93 Difference]: Finished difference Result 744 states and 1115 transitions. [2020-11-28 03:17:09,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:09,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-11-28 03:17:09,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:09,497 INFO L225 Difference]: With dead ends: 744 [2020-11-28 03:17:09,497 INFO L226 Difference]: Without dead ends: 377 [2020-11-28 03:17:09,499 INFO L677 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 [2020-11-28 03:17:09,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-11-28 03:17:09,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2020-11-28 03:17:09,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-11-28 03:17:09,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 548 transitions. [2020-11-28 03:17:09,527 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 548 transitions. Word has length 50 [2020-11-28 03:17:09,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:09,527 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 548 transitions. [2020-11-28 03:17:09,528 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:09,528 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 548 transitions. [2020-11-28 03:17:09,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-28 03:17:09,529 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:09,530 INFO L422 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] [2020-11-28 03:17:09,530 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 03:17:09,530 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:09,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:09,531 INFO L82 PathProgramCache]: Analyzing trace with hash -585918790, now seen corresponding path program 1 times [2020-11-28 03:17:09,531 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:09,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090058512] [2020-11-28 03:17:09,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:09,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:09,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:17:09,620 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090058512] [2020-11-28 03:17:09,621 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:09,621 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:17:09,621 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68033082] [2020-11-28 03:17:09,621 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:17:09,622 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:09,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:17:09,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:17:09,623 INFO L87 Difference]: Start difference. First operand 377 states and 548 transitions. Second operand 4 states. [2020-11-28 03:17:09,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:09,808 INFO L93 Difference]: Finished difference Result 878 states and 1277 transitions. [2020-11-28 03:17:09,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:17:09,808 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-11-28 03:17:09,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:09,812 INFO L225 Difference]: With dead ends: 878 [2020-11-28 03:17:09,813 INFO L226 Difference]: Without dead ends: 512 [2020-11-28 03:17:09,814 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:17:09,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2020-11-28 03:17:09,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 377. [2020-11-28 03:17:09,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-11-28 03:17:09,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 545 transitions. [2020-11-28 03:17:09,850 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 545 transitions. Word has length 50 [2020-11-28 03:17:09,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:09,854 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 545 transitions. [2020-11-28 03:17:09,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:17:09,855 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 545 transitions. [2020-11-28 03:17:09,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-28 03:17:09,856 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:09,856 INFO L422 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] [2020-11-28 03:17:09,856 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 03:17:09,857 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:09,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:09,858 INFO L82 PathProgramCache]: Analyzing trace with hash -1957726088, now seen corresponding path program 1 times [2020-11-28 03:17:09,858 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:09,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541683307] [2020-11-28 03:17:09,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:09,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:09,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:17:09,913 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541683307] [2020-11-28 03:17:09,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:09,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:17:09,914 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414245100] [2020-11-28 03:17:09,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:09,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:09,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:09,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:09,915 INFO L87 Difference]: Start difference. First operand 377 states and 545 transitions. Second operand 3 states. [2020-11-28 03:17:09,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:09,995 INFO L93 Difference]: Finished difference Result 742 states and 1075 transitions. [2020-11-28 03:17:09,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:09,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2020-11-28 03:17:09,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:09,998 INFO L225 Difference]: With dead ends: 742 [2020-11-28 03:17:09,999 INFO L226 Difference]: Without dead ends: 377 [2020-11-28 03:17:10,000 INFO L677 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 [2020-11-28 03:17:10,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2020-11-28 03:17:10,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2020-11-28 03:17:10,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2020-11-28 03:17:10,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 529 transitions. [2020-11-28 03:17:10,031 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 529 transitions. Word has length 50 [2020-11-28 03:17:10,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:10,032 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 529 transitions. [2020-11-28 03:17:10,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:10,032 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 529 transitions. [2020-11-28 03:17:10,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-28 03:17:10,035 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:10,036 INFO L422 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] [2020-11-28 03:17:10,036 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 03:17:10,036 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:10,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:10,037 INFO L82 PathProgramCache]: Analyzing trace with hash -787989636, now seen corresponding path program 1 times [2020-11-28 03:17:10,037 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:10,038 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140623378] [2020-11-28 03:17:10,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:10,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:17:10,147 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140623378] [2020-11-28 03:17:10,147 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:10,147 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:17:10,148 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717913172] [2020-11-28 03:17:10,148 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:17:10,148 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:10,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:17:10,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:17:10,149 INFO L87 Difference]: Start difference. First operand 377 states and 529 transitions. Second operand 5 states. [2020-11-28 03:17:10,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:10,335 INFO L93 Difference]: Finished difference Result 981 states and 1389 transitions. [2020-11-28 03:17:10,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:17:10,335 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 50 [2020-11-28 03:17:10,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:10,340 INFO L225 Difference]: With dead ends: 981 [2020-11-28 03:17:10,341 INFO L226 Difference]: Without dead ends: 623 [2020-11-28 03:17:10,343 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:17:10,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2020-11-28 03:17:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 383. [2020-11-28 03:17:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2020-11-28 03:17:10,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 527 transitions. [2020-11-28 03:17:10,388 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 527 transitions. Word has length 50 [2020-11-28 03:17:10,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:10,389 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 527 transitions. [2020-11-28 03:17:10,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:17:10,389 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 527 transitions. [2020-11-28 03:17:10,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2020-11-28 03:17:10,390 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:10,390 INFO L422 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] [2020-11-28 03:17:10,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 03:17:10,390 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:10,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:10,391 INFO L82 PathProgramCache]: Analyzing trace with hash -860376194, now seen corresponding path program 1 times [2020-11-28 03:17:10,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:10,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748187586] [2020-11-28 03:17:10,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:10,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:10,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:17:10,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748187586] [2020-11-28 03:17:10,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:10,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:17:10,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981708659] [2020-11-28 03:17:10,470 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:17:10,472 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:10,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:17:10,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:17:10,476 INFO L87 Difference]: Start difference. First operand 383 states and 527 transitions. Second operand 4 states. [2020-11-28 03:17:10,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:10,745 INFO L93 Difference]: Finished difference Result 1331 states and 1833 transitions. [2020-11-28 03:17:10,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:17:10,746 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 50 [2020-11-28 03:17:10,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:10,754 INFO L225 Difference]: With dead ends: 1331 [2020-11-28 03:17:10,754 INFO L226 Difference]: Without dead ends: 962 [2020-11-28 03:17:10,755 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:17:10,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2020-11-28 03:17:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 886. [2020-11-28 03:17:10,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 886 states. [2020-11-28 03:17:10,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1204 transitions. [2020-11-28 03:17:10,843 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1204 transitions. Word has length 50 [2020-11-28 03:17:10,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:10,843 INFO L481 AbstractCegarLoop]: Abstraction has 886 states and 1204 transitions. [2020-11-28 03:17:10,843 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:17:10,844 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1204 transitions. [2020-11-28 03:17:10,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-28 03:17:10,845 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:10,845 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-28 03:17:10,845 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 03:17:10,846 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:10,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:10,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1987821321, now seen corresponding path program 1 times [2020-11-28 03:17:10,847 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:10,847 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432766147] [2020-11-28 03:17:10,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:10,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:10,929 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-28 03:17:10,929 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432766147] [2020-11-28 03:17:10,930 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:10,930 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:17:10,930 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916747816] [2020-11-28 03:17:10,930 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:17:10,931 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:10,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:17:10,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:17:10,933 INFO L87 Difference]: Start difference. First operand 886 states and 1204 transitions. Second operand 5 states. [2020-11-28 03:17:11,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:11,239 INFO L93 Difference]: Finished difference Result 2286 states and 3127 transitions. [2020-11-28 03:17:11,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:17:11,239 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2020-11-28 03:17:11,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:11,251 INFO L225 Difference]: With dead ends: 2286 [2020-11-28 03:17:11,251 INFO L226 Difference]: Without dead ends: 1424 [2020-11-28 03:17:11,253 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:17:11,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2020-11-28 03:17:11,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 913. [2020-11-28 03:17:11,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2020-11-28 03:17:11,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1218 transitions. [2020-11-28 03:17:11,345 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1218 transitions. Word has length 63 [2020-11-28 03:17:11,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:11,347 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 1218 transitions. [2020-11-28 03:17:11,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:17:11,347 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1218 transitions. [2020-11-28 03:17:11,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-28 03:17:11,348 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:11,348 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-28 03:17:11,349 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 03:17:11,350 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:11,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:11,350 INFO L82 PathProgramCache]: Analyzing trace with hash 616014023, now seen corresponding path program 1 times [2020-11-28 03:17:11,351 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:11,351 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563330091] [2020-11-28 03:17:11,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:11,439 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-28 03:17:11,440 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563330091] [2020-11-28 03:17:11,440 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:11,440 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:17:11,440 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059362728] [2020-11-28 03:17:11,441 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:17:11,441 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:11,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:17:11,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:17:11,442 INFO L87 Difference]: Start difference. First operand 913 states and 1218 transitions. Second operand 4 states. [2020-11-28 03:17:11,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:11,624 INFO L93 Difference]: Finished difference Result 2185 states and 2919 transitions. [2020-11-28 03:17:11,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:17:11,625 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-11-28 03:17:11,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:11,634 INFO L225 Difference]: With dead ends: 2185 [2020-11-28 03:17:11,634 INFO L226 Difference]: Without dead ends: 1305 [2020-11-28 03:17:11,638 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:17:11,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2020-11-28 03:17:11,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 913. [2020-11-28 03:17:11,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2020-11-28 03:17:11,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1205 transitions. [2020-11-28 03:17:11,728 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1205 transitions. Word has length 63 [2020-11-28 03:17:11,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:11,728 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 1205 transitions. [2020-11-28 03:17:11,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:17:11,729 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1205 transitions. [2020-11-28 03:17:11,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-28 03:17:11,729 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:11,730 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-28 03:17:11,730 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 03:17:11,730 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:11,730 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:11,731 INFO L82 PathProgramCache]: Analyzing trace with hash 890773637, now seen corresponding path program 1 times [2020-11-28 03:17:11,731 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:11,731 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728435269] [2020-11-28 03:17:11,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:11,781 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-28 03:17:11,781 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728435269] [2020-11-28 03:17:11,781 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:11,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:17:11,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680430894] [2020-11-28 03:17:11,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:17:11,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:11,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:17:11,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:17:11,783 INFO L87 Difference]: Start difference. First operand 913 states and 1205 transitions. Second operand 4 states. [2020-11-28 03:17:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:11,978 INFO L93 Difference]: Finished difference Result 2184 states and 2889 transitions. [2020-11-28 03:17:11,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:17:11,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 63 [2020-11-28 03:17:11,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:11,989 INFO L225 Difference]: With dead ends: 2184 [2020-11-28 03:17:11,989 INFO L226 Difference]: Without dead ends: 1305 [2020-11-28 03:17:11,991 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:17:11,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1305 states. [2020-11-28 03:17:12,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1305 to 913. [2020-11-28 03:17:12,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 913 states. [2020-11-28 03:17:12,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1192 transitions. [2020-11-28 03:17:12,086 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1192 transitions. Word has length 63 [2020-11-28 03:17:12,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:12,086 INFO L481 AbstractCegarLoop]: Abstraction has 913 states and 1192 transitions. [2020-11-28 03:17:12,087 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:17:12,087 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1192 transitions. [2020-11-28 03:17:12,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-28 03:17:12,094 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:12,095 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-28 03:17:12,095 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 03:17:12,095 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:12,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:12,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1592373511, now seen corresponding path program 1 times [2020-11-28 03:17:12,096 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:12,096 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15124515] [2020-11-28 03:17:12,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:12,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:12,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:17:12,140 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15124515] [2020-11-28 03:17:12,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:12,141 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:17:12,141 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719187857] [2020-11-28 03:17:12,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:12,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:12,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:12,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:12,143 INFO L87 Difference]: Start difference. First operand 913 states and 1192 transitions. Second operand 3 states. [2020-11-28 03:17:12,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:12,351 INFO L93 Difference]: Finished difference Result 2514 states and 3253 transitions. [2020-11-28 03:17:12,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:12,352 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-11-28 03:17:12,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:12,363 INFO L225 Difference]: With dead ends: 2514 [2020-11-28 03:17:12,363 INFO L226 Difference]: Without dead ends: 1638 [2020-11-28 03:17:12,366 INFO L677 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 [2020-11-28 03:17:12,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2020-11-28 03:17:12,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1638. [2020-11-28 03:17:12,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1638 states. [2020-11-28 03:17:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2079 transitions. [2020-11-28 03:17:12,541 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2079 transitions. Word has length 63 [2020-11-28 03:17:12,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:12,541 INFO L481 AbstractCegarLoop]: Abstraction has 1638 states and 2079 transitions. [2020-11-28 03:17:12,541 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2079 transitions. [2020-11-28 03:17:12,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-28 03:17:12,543 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:12,543 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-28 03:17:12,544 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 03:17:12,544 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:12,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:12,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1604417796, now seen corresponding path program 1 times [2020-11-28 03:17:12,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:12,552 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366383993] [2020-11-28 03:17:12,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:12,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:17:12,629 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366383993] [2020-11-28 03:17:12,629 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:12,630 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:17:12,631 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577596925] [2020-11-28 03:17:12,631 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:12,631 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:12,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:12,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:12,632 INFO L87 Difference]: Start difference. First operand 1638 states and 2079 transitions. Second operand 3 states. [2020-11-28 03:17:12,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:12,960 INFO L93 Difference]: Finished difference Result 4524 states and 5739 transitions. [2020-11-28 03:17:12,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:12,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-11-28 03:17:12,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:12,981 INFO L225 Difference]: With dead ends: 4524 [2020-11-28 03:17:12,981 INFO L226 Difference]: Without dead ends: 2956 [2020-11-28 03:17:12,985 INFO L677 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 [2020-11-28 03:17:12,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2020-11-28 03:17:13,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2916. [2020-11-28 03:17:13,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2916 states. [2020-11-28 03:17:13,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 3671 transitions. [2020-11-28 03:17:13,274 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 3671 transitions. Word has length 64 [2020-11-28 03:17:13,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:13,276 INFO L481 AbstractCegarLoop]: Abstraction has 2916 states and 3671 transitions. [2020-11-28 03:17:13,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:13,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 3671 transitions. [2020-11-28 03:17:13,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-28 03:17:13,278 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:13,279 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-28 03:17:13,279 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 03:17:13,279 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:13,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:13,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1043718018, now seen corresponding path program 1 times [2020-11-28 03:17:13,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:13,281 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997220009] [2020-11-28 03:17:13,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:13,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:13,310 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-28 03:17:13,312 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997220009] [2020-11-28 03:17:13,312 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:13,312 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:17:13,312 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010311484] [2020-11-28 03:17:13,313 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:13,313 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:13,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:13,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:13,314 INFO L87 Difference]: Start difference. First operand 2916 states and 3671 transitions. Second operand 3 states. [2020-11-28 03:17:13,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:13,580 INFO L93 Difference]: Finished difference Result 5712 states and 7209 transitions. [2020-11-28 03:17:13,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:13,580 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2020-11-28 03:17:13,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:13,598 INFO L225 Difference]: With dead ends: 5712 [2020-11-28 03:17:13,598 INFO L226 Difference]: Without dead ends: 2854 [2020-11-28 03:17:13,605 INFO L677 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 [2020-11-28 03:17:13,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2020-11-28 03:17:13,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2854. [2020-11-28 03:17:13,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2854 states. [2020-11-28 03:17:13,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 3601 transitions. [2020-11-28 03:17:13,902 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 3601 transitions. Word has length 64 [2020-11-28 03:17:13,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:13,903 INFO L481 AbstractCegarLoop]: Abstraction has 2854 states and 3601 transitions. [2020-11-28 03:17:13,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3601 transitions. [2020-11-28 03:17:13,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-28 03:17:13,905 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:13,905 INFO L422 BasicCegarLoop]: trace histogram [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] [2020-11-28 03:17:13,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-28 03:17:13,905 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:13,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:13,906 INFO L82 PathProgramCache]: Analyzing trace with hash -691732721, now seen corresponding path program 1 times [2020-11-28 03:17:13,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:13,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510533202] [2020-11-28 03:17:13,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:13,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:13,968 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-28 03:17:13,969 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510533202] [2020-11-28 03:17:13,971 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:13,972 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:17:13,972 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464310459] [2020-11-28 03:17:13,972 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:13,972 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:13,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:13,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:13,976 INFO L87 Difference]: Start difference. First operand 2854 states and 3601 transitions. Second operand 3 states. [2020-11-28 03:17:14,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:14,483 INFO L93 Difference]: Finished difference Result 6838 states and 8679 transitions. [2020-11-28 03:17:14,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:14,484 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2020-11-28 03:17:14,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:14,511 INFO L225 Difference]: With dead ends: 6838 [2020-11-28 03:17:14,511 INFO L226 Difference]: Without dead ends: 4770 [2020-11-28 03:17:14,516 INFO L677 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 [2020-11-28 03:17:14,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4770 states. [2020-11-28 03:17:14,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4770 to 3882. [2020-11-28 03:17:14,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3882 states. [2020-11-28 03:17:14,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3882 states to 3882 states and 4899 transitions. [2020-11-28 03:17:14,874 INFO L78 Accepts]: Start accepts. Automaton has 3882 states and 4899 transitions. Word has length 65 [2020-11-28 03:17:14,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:14,875 INFO L481 AbstractCegarLoop]: Abstraction has 3882 states and 4899 transitions. [2020-11-28 03:17:14,875 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:14,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3882 states and 4899 transitions. [2020-11-28 03:17:14,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-28 03:17:14,878 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:14,878 INFO L422 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] [2020-11-28 03:17:14,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-28 03:17:14,878 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:14,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:14,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1437461722, now seen corresponding path program 1 times [2020-11-28 03:17:14,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:14,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942247787] [2020-11-28 03:17:14,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:14,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:14,930 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:17:14,931 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942247787] [2020-11-28 03:17:14,931 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:14,931 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:17:14,931 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705252525] [2020-11-28 03:17:14,932 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:17:14,932 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:14,932 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:17:14,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:17:14,933 INFO L87 Difference]: Start difference. First operand 3882 states and 4899 transitions. Second operand 5 states. [2020-11-28 03:17:15,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:15,622 INFO L93 Difference]: Finished difference Result 9686 states and 12267 transitions. [2020-11-28 03:17:15,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:17:15,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 82 [2020-11-28 03:17:15,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:15,684 INFO L225 Difference]: With dead ends: 9686 [2020-11-28 03:17:15,684 INFO L226 Difference]: Without dead ends: 5862 [2020-11-28 03:17:15,690 INFO L677 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 [2020-11-28 03:17:15,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5862 states. [2020-11-28 03:17:16,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5862 to 3930. [2020-11-28 03:17:16,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3930 states. [2020-11-28 03:17:16,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3930 states to 3930 states and 4873 transitions. [2020-11-28 03:17:16,169 INFO L78 Accepts]: Start accepts. Automaton has 3930 states and 4873 transitions. Word has length 82 [2020-11-28 03:17:16,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:16,169 INFO L481 AbstractCegarLoop]: Abstraction has 3930 states and 4873 transitions. [2020-11-28 03:17:16,169 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:17:16,170 INFO L276 IsEmpty]: Start isEmpty. Operand 3930 states and 4873 transitions. [2020-11-28 03:17:16,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2020-11-28 03:17:16,173 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:16,173 INFO L422 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] [2020-11-28 03:17:16,173 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-28 03:17:16,173 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:16,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:16,174 INFO L82 PathProgramCache]: Analyzing trace with hash 1269157672, now seen corresponding path program 1 times [2020-11-28 03:17:16,174 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:16,175 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473958208] [2020-11-28 03:17:16,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:16,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:16,252 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:17:16,252 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473958208] [2020-11-28 03:17:16,252 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:16,252 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:17:16,253 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210765185] [2020-11-28 03:17:16,255 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:16,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:16,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:16,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:16,256 INFO L87 Difference]: Start difference. First operand 3930 states and 4873 transitions. Second operand 3 states. [2020-11-28 03:17:17,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:17,035 INFO L93 Difference]: Finished difference Result 11242 states and 13901 transitions. [2020-11-28 03:17:17,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:17,036 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 82 [2020-11-28 03:17:17,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:17,053 INFO L225 Difference]: With dead ends: 11242 [2020-11-28 03:17:17,053 INFO L226 Difference]: Without dead ends: 7382 [2020-11-28 03:17:17,059 INFO L677 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 [2020-11-28 03:17:17,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2020-11-28 03:17:17,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7170. [2020-11-28 03:17:17,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7170 states. [2020-11-28 03:17:17,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 8765 transitions. [2020-11-28 03:17:17,766 INFO L78 Accepts]: Start accepts. Automaton has 7170 states and 8765 transitions. Word has length 82 [2020-11-28 03:17:17,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:17,766 INFO L481 AbstractCegarLoop]: Abstraction has 7170 states and 8765 transitions. [2020-11-28 03:17:17,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:17,766 INFO L276 IsEmpty]: Start isEmpty. Operand 7170 states and 8765 transitions. [2020-11-28 03:17:17,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-28 03:17:17,770 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:17,770 INFO L422 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] [2020-11-28 03:17:17,770 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-28 03:17:17,771 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:17,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:17,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1587172131, now seen corresponding path program 1 times [2020-11-28 03:17:17,771 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:17,772 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803786575] [2020-11-28 03:17:17,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:17,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:17,820 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:17:17,821 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803786575] [2020-11-28 03:17:17,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:17,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:17:17,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240035432] [2020-11-28 03:17:17,822 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:17:17,822 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:17,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:17:17,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:17:17,823 INFO L87 Difference]: Start difference. First operand 7170 states and 8765 transitions. Second operand 4 states. [2020-11-28 03:17:18,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:18,513 INFO L93 Difference]: Finished difference Result 12646 states and 15461 transitions. [2020-11-28 03:17:18,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:17:18,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 83 [2020-11-28 03:17:18,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:18,527 INFO L225 Difference]: With dead ends: 12646 [2020-11-28 03:17:18,527 INFO L226 Difference]: Without dead ends: 5513 [2020-11-28 03:17:18,536 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:17:18,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5513 states. [2020-11-28 03:17:18,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5513 to 5509. [2020-11-28 03:17:18,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5509 states. [2020-11-28 03:17:18,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 6669 transitions. [2020-11-28 03:17:18,937 INFO L78 Accepts]: Start accepts. Automaton has 5509 states and 6669 transitions. Word has length 83 [2020-11-28 03:17:18,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:18,937 INFO L481 AbstractCegarLoop]: Abstraction has 5509 states and 6669 transitions. [2020-11-28 03:17:18,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:17:18,938 INFO L276 IsEmpty]: Start isEmpty. Operand 5509 states and 6669 transitions. [2020-11-28 03:17:18,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2020-11-28 03:17:18,943 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:18,943 INFO L422 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] [2020-11-28 03:17:18,943 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-28 03:17:18,943 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:18,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:18,944 INFO L82 PathProgramCache]: Analyzing trace with hash -810228725, now seen corresponding path program 1 times [2020-11-28 03:17:18,944 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:18,944 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957229137] [2020-11-28 03:17:18,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:19,015 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:17:19,016 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957229137] [2020-11-28 03:17:19,016 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:19,016 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-28 03:17:19,016 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247443294] [2020-11-28 03:17:19,017 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:19,017 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:19,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:19,018 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:19,018 INFO L87 Difference]: Start difference. First operand 5509 states and 6669 transitions. Second operand 3 states. [2020-11-28 03:17:19,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:19,880 INFO L93 Difference]: Finished difference Result 12613 states and 15226 transitions. [2020-11-28 03:17:19,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:19,881 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2020-11-28 03:17:19,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:19,905 INFO L225 Difference]: With dead ends: 12613 [2020-11-28 03:17:19,906 INFO L226 Difference]: Without dead ends: 7130 [2020-11-28 03:17:19,914 INFO L677 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 [2020-11-28 03:17:19,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7130 states. [2020-11-28 03:17:20,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7130 to 7082. [2020-11-28 03:17:20,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7082 states. [2020-11-28 03:17:20,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 8483 transitions. [2020-11-28 03:17:20,625 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 8483 transitions. Word has length 106 [2020-11-28 03:17:20,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:20,625 INFO L481 AbstractCegarLoop]: Abstraction has 7082 states and 8483 transitions. [2020-11-28 03:17:20,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:20,626 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 8483 transitions. [2020-11-28 03:17:20,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-11-28 03:17:20,633 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:20,634 INFO L422 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] [2020-11-28 03:17:20,634 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-28 03:17:20,634 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:20,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:20,634 INFO L82 PathProgramCache]: Analyzing trace with hash 614427576, now seen corresponding path program 1 times [2020-11-28 03:17:20,635 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:20,635 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783062192] [2020-11-28 03:17:20,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:20,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:20,704 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:17:20,705 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783062192] [2020-11-28 03:17:20,705 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:20,705 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:17:20,705 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586000741] [2020-11-28 03:17:20,706 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:17:20,706 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:20,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:17:20,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:17:20,707 INFO L87 Difference]: Start difference. First operand 7082 states and 8483 transitions. Second operand 4 states. [2020-11-28 03:17:21,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:21,434 INFO L93 Difference]: Finished difference Result 12566 states and 15119 transitions. [2020-11-28 03:17:21,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:17:21,435 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 121 [2020-11-28 03:17:21,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:21,451 INFO L225 Difference]: With dead ends: 12566 [2020-11-28 03:17:21,451 INFO L226 Difference]: Without dead ends: 7094 [2020-11-28 03:17:21,460 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:17:21,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7094 states. [2020-11-28 03:17:22,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7094 to 7082. [2020-11-28 03:17:22,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7082 states. [2020-11-28 03:17:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 8447 transitions. [2020-11-28 03:17:22,062 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 8447 transitions. Word has length 121 [2020-11-28 03:17:22,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:22,062 INFO L481 AbstractCegarLoop]: Abstraction has 7082 states and 8447 transitions. [2020-11-28 03:17:22,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:17:22,062 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 8447 transitions. [2020-11-28 03:17:22,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-11-28 03:17:22,073 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:22,073 INFO L422 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] [2020-11-28 03:17:22,073 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-28 03:17:22,073 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:22,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:22,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1456346617, now seen corresponding path program 1 times [2020-11-28 03:17:22,074 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:22,075 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605484681] [2020-11-28 03:17:22,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:22,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:22,138 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-28 03:17:22,138 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605484681] [2020-11-28 03:17:22,139 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:22,139 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:17:22,139 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64838513] [2020-11-28 03:17:22,139 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:17:22,140 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:22,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:17:22,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:17:22,141 INFO L87 Difference]: Start difference. First operand 7082 states and 8447 transitions. Second operand 4 states. [2020-11-28 03:17:22,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:22,842 INFO L93 Difference]: Finished difference Result 14332 states and 17091 transitions. [2020-11-28 03:17:22,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:17:22,843 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 147 [2020-11-28 03:17:22,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:22,860 INFO L225 Difference]: With dead ends: 14332 [2020-11-28 03:17:22,860 INFO L226 Difference]: Without dead ends: 6492 [2020-11-28 03:17:22,871 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:17:22,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6492 states. [2020-11-28 03:17:23,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6492 to 6280. [2020-11-28 03:17:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6280 states. [2020-11-28 03:17:23,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 7448 transitions. [2020-11-28 03:17:23,427 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 7448 transitions. Word has length 147 [2020-11-28 03:17:23,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:23,427 INFO L481 AbstractCegarLoop]: Abstraction has 6280 states and 7448 transitions. [2020-11-28 03:17:23,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:17:23,427 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 7448 transitions. [2020-11-28 03:17:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2020-11-28 03:17:23,436 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:23,436 INFO L422 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] [2020-11-28 03:17:23,437 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-28 03:17:23,437 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:23,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:23,438 INFO L82 PathProgramCache]: Analyzing trace with hash -495516941, now seen corresponding path program 1 times [2020-11-28 03:17:23,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:23,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838596421] [2020-11-28 03:17:23,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:23,506 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:17:23,507 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838596421] [2020-11-28 03:17:23,507 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:23,507 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:17:23,509 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297393089] [2020-11-28 03:17:23,509 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:23,510 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:23,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:23,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:23,513 INFO L87 Difference]: Start difference. First operand 6280 states and 7448 transitions. Second operand 3 states. [2020-11-28 03:17:24,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:24,046 INFO L93 Difference]: Finished difference Result 11323 states and 13479 transitions. [2020-11-28 03:17:24,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:24,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 147 [2020-11-28 03:17:24,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:24,057 INFO L225 Difference]: With dead ends: 11323 [2020-11-28 03:17:24,058 INFO L226 Difference]: Without dead ends: 6304 [2020-11-28 03:17:24,065 INFO L677 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 [2020-11-28 03:17:24,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6304 states. [2020-11-28 03:17:24,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6304 to 6280. [2020-11-28 03:17:24,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6280 states. [2020-11-28 03:17:24,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 7296 transitions. [2020-11-28 03:17:24,596 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 7296 transitions. Word has length 147 [2020-11-28 03:17:24,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:24,597 INFO L481 AbstractCegarLoop]: Abstraction has 6280 states and 7296 transitions. [2020-11-28 03:17:24,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:24,597 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 7296 transitions. [2020-11-28 03:17:24,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2020-11-28 03:17:24,602 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:24,603 INFO L422 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] [2020-11-28 03:17:24,603 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2020-11-28 03:17:24,603 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:24,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:24,604 INFO L82 PathProgramCache]: Analyzing trace with hash 1875095521, now seen corresponding path program 1 times [2020-11-28 03:17:24,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:24,604 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148529847] [2020-11-28 03:17:24,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:24,723 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-28 03:17:24,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148529847] [2020-11-28 03:17:24,724 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:24,724 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:17:24,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503085759] [2020-11-28 03:17:24,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:24,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:24,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:24,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:24,726 INFO L87 Difference]: Start difference. First operand 6280 states and 7296 transitions. Second operand 3 states. [2020-11-28 03:17:25,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:25,309 INFO L93 Difference]: Finished difference Result 10747 states and 12514 transitions. [2020-11-28 03:17:25,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:25,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2020-11-28 03:17:25,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:25,322 INFO L225 Difference]: With dead ends: 10747 [2020-11-28 03:17:25,323 INFO L226 Difference]: Without dead ends: 6564 [2020-11-28 03:17:25,330 INFO L677 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 [2020-11-28 03:17:25,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6564 states. [2020-11-28 03:17:26,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6564 to 6280. [2020-11-28 03:17:26,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6280 states. [2020-11-28 03:17:26,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 7176 transitions. [2020-11-28 03:17:26,028 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 7176 transitions. Word has length 149 [2020-11-28 03:17:26,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:26,028 INFO L481 AbstractCegarLoop]: Abstraction has 6280 states and 7176 transitions. [2020-11-28 03:17:26,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:26,028 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 7176 transitions. [2020-11-28 03:17:26,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-11-28 03:17:26,034 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:26,035 INFO L422 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] [2020-11-28 03:17:26,035 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-28 03:17:26,035 INFO L429 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:26,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:26,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1711412734, now seen corresponding path program 1 times [2020-11-28 03:17:26,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:26,037 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161128695] [2020-11-28 03:17:26,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:26,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:26,125 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:17:26,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161128695] [2020-11-28 03:17:26,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:26,126 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:17:26,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787168680] [2020-11-28 03:17:26,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:26,127 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:26,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:26,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:26,128 INFO L87 Difference]: Start difference. First operand 6280 states and 7176 transitions. Second operand 3 states. [2020-11-28 03:17:26,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:26,626 INFO L93 Difference]: Finished difference Result 10912 states and 12510 transitions. [2020-11-28 03:17:26,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:26,626 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2020-11-28 03:17:26,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:26,633 INFO L225 Difference]: With dead ends: 10912 [2020-11-28 03:17:26,633 INFO L226 Difference]: Without dead ends: 4668 [2020-11-28 03:17:26,641 INFO L677 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 [2020-11-28 03:17:26,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2020-11-28 03:17:27,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4652. [2020-11-28 03:17:27,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4652 states. [2020-11-28 03:17:27,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4652 states to 4652 states and 5255 transitions. [2020-11-28 03:17:27,112 INFO L78 Accepts]: Start accepts. Automaton has 4652 states and 5255 transitions. Word has length 150 [2020-11-28 03:17:27,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:27,113 INFO L481 AbstractCegarLoop]: Abstraction has 4652 states and 5255 transitions. [2020-11-28 03:17:27,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:27,113 INFO L276 IsEmpty]: Start isEmpty. Operand 4652 states and 5255 transitions. [2020-11-28 03:17:27,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2020-11-28 03:17:27,118 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:27,118 INFO L422 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] [2020-11-28 03:17:27,118 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2020-11-28 03:17:27,118 INFO L429 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:27,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:27,119 INFO L82 PathProgramCache]: Analyzing trace with hash 473818913, now seen corresponding path program 1 times [2020-11-28 03:17:27,119 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:27,120 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064017071] [2020-11-28 03:17:27,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:27,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:27,210 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-28 03:17:27,211 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064017071] [2020-11-28 03:17:27,211 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:27,211 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:17:27,212 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103800290] [2020-11-28 03:17:27,212 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:17:27,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:27,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:17:27,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:17:27,213 INFO L87 Difference]: Start difference. First operand 4652 states and 5255 transitions. Second operand 4 states. [2020-11-28 03:17:27,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:27,524 INFO L93 Difference]: Finished difference Result 7044 states and 7901 transitions. [2020-11-28 03:17:27,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:17:27,525 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 150 [2020-11-28 03:17:27,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:27,527 INFO L225 Difference]: With dead ends: 7044 [2020-11-28 03:17:27,527 INFO L226 Difference]: Without dead ends: 1511 [2020-11-28 03:17:27,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:17:27,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1511 states. [2020-11-28 03:17:27,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1511 to 1507. [2020-11-28 03:17:27,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2020-11-28 03:17:27,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1613 transitions. [2020-11-28 03:17:27,628 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1613 transitions. Word has length 150 [2020-11-28 03:17:27,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:27,628 INFO L481 AbstractCegarLoop]: Abstraction has 1507 states and 1613 transitions. [2020-11-28 03:17:27,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:17:27,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1613 transitions. [2020-11-28 03:17:27,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2020-11-28 03:17:27,631 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:27,632 INFO L422 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] [2020-11-28 03:17:27,632 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2020-11-28 03:17:27,632 INFO L429 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:27,633 INFO L82 PathProgramCache]: Analyzing trace with hash 776824727, now seen corresponding path program 1 times [2020-11-28 03:17:27,633 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:27,633 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796898766] [2020-11-28 03:17:27,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:27,866 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-28 03:17:27,866 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796898766] [2020-11-28 03:17:27,867 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:27,867 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:17:27,867 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419086042] [2020-11-28 03:17:27,867 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:17:27,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:27,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:17:27,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:17:27,868 INFO L87 Difference]: Start difference. First operand 1507 states and 1613 transitions. Second operand 5 states. [2020-11-28 03:17:28,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:28,122 INFO L93 Difference]: Finished difference Result 1507 states and 1613 transitions. [2020-11-28 03:17:28,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:17:28,122 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 152 [2020-11-28 03:17:28,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:28,125 INFO L225 Difference]: With dead ends: 1507 [2020-11-28 03:17:28,125 INFO L226 Difference]: Without dead ends: 1505 [2020-11-28 03:17:28,126 INFO L677 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 [2020-11-28 03:17:28,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2020-11-28 03:17:28,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2020-11-28 03:17:28,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1505 states. [2020-11-28 03:17:28,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1610 transitions. [2020-11-28 03:17:28,305 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1610 transitions. Word has length 152 [2020-11-28 03:17:28,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:28,306 INFO L481 AbstractCegarLoop]: Abstraction has 1505 states and 1610 transitions. [2020-11-28 03:17:28,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:17:28,306 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1610 transitions. [2020-11-28 03:17:28,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2020-11-28 03:17:28,309 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:28,309 INFO L422 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] [2020-11-28 03:17:28,309 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2020-11-28 03:17:28,310 INFO L429 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:28,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:28,310 INFO L82 PathProgramCache]: Analyzing trace with hash 46651813, now seen corresponding path program 1 times [2020-11-28 03:17:28,310 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:28,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280909773] [2020-11-28 03:17:28,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:17:28,390 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2020-11-28 03:17:28,390 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280909773] [2020-11-28 03:17:28,390 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:17:28,390 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:17:28,391 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503071409] [2020-11-28 03:17:28,391 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:17:28,391 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:17:28,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:17:28,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:17:28,392 INFO L87 Difference]: Start difference. First operand 1505 states and 1610 transitions. Second operand 3 states. [2020-11-28 03:17:28,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:17:28,644 INFO L93 Difference]: Finished difference Result 2761 states and 2943 transitions. [2020-11-28 03:17:28,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:17:28,645 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2020-11-28 03:17:28,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:17:28,648 INFO L225 Difference]: With dead ends: 2761 [2020-11-28 03:17:28,649 INFO L226 Difference]: Without dead ends: 2125 [2020-11-28 03:17:28,650 INFO L677 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 [2020-11-28 03:17:28,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2020-11-28 03:17:28,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1507. [2020-11-28 03:17:28,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2020-11-28 03:17:28,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1612 transitions. [2020-11-28 03:17:28,815 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1612 transitions. Word has length 156 [2020-11-28 03:17:28,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:17:28,815 INFO L481 AbstractCegarLoop]: Abstraction has 1507 states and 1612 transitions. [2020-11-28 03:17:28,815 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:17:28,816 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1612 transitions. [2020-11-28 03:17:28,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2020-11-28 03:17:28,817 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:17:28,817 INFO L422 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] [2020-11-28 03:17:28,818 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2020-11-28 03:17:28,818 INFO L429 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:17:28,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:17:28,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1208769336, now seen corresponding path program 1 times [2020-11-28 03:17:28,819 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:17:28,819 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365623280] [2020-11-28 03:17:28,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:17:28,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:17:28,852 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:17:28,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:17:28,886 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:17:28,997 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:17:28,997 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 03:17:28,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2020-11-28 03:17:29,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:17:29 BoogieIcfgContainer [2020-11-28 03:17:29,259 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:17:29,260 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:17:29,260 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:17:29,260 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:17:29,261 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:17:07" (3/4) ... [2020-11-28 03:17:29,263 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 03:17:29,420 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_2067405b-614e-49ca-8eda-9e9bd6ee68b8/bin/uautomizer/witness.graphml [2020-11-28 03:17:29,421 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:17:29,423 INFO L168 Benchmark]: Toolchain (without parser) took 23565.78 ms. Allocated memory was 92.3 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 58.1 MB in the beginning and 1.7 GB in the end (delta: -1.7 GB). Peak memory consumption was 500.3 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:29,424 INFO L168 Benchmark]: CDTParser took 0.70 ms. Allocated memory is still 92.3 MB. Free memory was 63.1 MB in the beginning and 63.1 MB in the end (delta: 31.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:17:29,424 INFO L168 Benchmark]: CACSL2BoogieTranslator took 469.00 ms. Allocated memory is still 92.3 MB. Free memory was 58.0 MB in the beginning and 66.2 MB in the end (delta: -8.3 MB). Peak memory consumption was 10.0 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:29,425 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.90 ms. Allocated memory is still 92.3 MB. Free memory was 66.2 MB in the beginning and 63.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:29,425 INFO L168 Benchmark]: Boogie Preprocessor took 87.94 ms. Allocated memory is still 92.3 MB. Free memory was 63.1 MB in the beginning and 60.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:29,426 INFO L168 Benchmark]: RCFGBuilder took 1276.11 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 60.2 MB in the beginning and 74.6 MB in the end (delta: -14.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:29,426 INFO L168 Benchmark]: TraceAbstraction took 21488.00 ms. Allocated memory was 111.1 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 74.1 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 473.7 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:29,427 INFO L168 Benchmark]: Witness Printer took 160.91 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:17:29,430 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.70 ms. Allocated memory is still 92.3 MB. Free memory was 63.1 MB in the beginning and 63.1 MB in the end (delta: 31.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 469.00 ms. Allocated memory is still 92.3 MB. Free memory was 58.0 MB in the beginning and 66.2 MB in the end (delta: -8.3 MB). Peak memory consumption was 10.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 72.90 ms. Allocated memory is still 92.3 MB. Free memory was 66.2 MB in the beginning and 63.1 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 87.94 ms. Allocated memory is still 92.3 MB. Free memory was 63.1 MB in the beginning and 60.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1276.11 ms. Allocated memory was 92.3 MB in the beginning and 111.1 MB in the end (delta: 18.9 MB). Free memory was 60.2 MB in the beginning and 74.6 MB in the end (delta: -14.4 MB). Peak memory consumption was 27.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 21488.00 ms. Allocated memory was 111.1 MB in the beginning and 2.3 GB in the end (delta: 2.2 GB). Free memory was 74.1 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 473.7 MB. Max. memory is 16.1 GB. * Witness Printer took 160.91 ms. Allocated memory is still 2.3 GB. Free memory was 1.8 GB in the beginning and 1.7 GB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int t2_pc = 0; [L19] int m_st ; [L20] int t1_st ; [L21] int t2_st ; [L22] int m_i ; [L23] int t1_i ; [L24] int t2_i ; [L25] int M_E = 2; [L26] int T1_E = 2; [L27] int T2_E = 2; [L28] int E_M = 2; [L29] int E_1 = 2; [L30] int E_2 = 2; [L35] int token ; [L37] 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] [L602] int __retres1 ; [L516] m_i = 1 [L517] t1_i = 1 [L518] 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] [L543] int kernel_st ; [L544] int tmp ; [L545] int tmp___0 ; [L549] 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] [L235] COND TRUE m_i == 1 [L236] 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] [L240] COND TRUE t1_i == 1 [L241] 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] [L245] COND TRUE t2_i == 1 [L246] 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] [L348] 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] [L353] 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] [L358] 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] [L363] 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] [L368] 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] [L373] 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] [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] 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] [L170] 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] [L180] __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] [L182] 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] [L427] tmp = is_master_triggered() [L429] 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] [L186] 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] [L189] 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] [L199] __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] [L201] 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] [L435] tmp___0 = is_transmit1_triggered() [L437] 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] [L205] 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] [L208] 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] [L218] __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] [L220] 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] [L443] tmp___1 = is_transmit2_triggered() [L445] 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] [L386] 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] [L391] 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] [L396] 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] [L401] 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] [L406] 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] [L411] 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] [L557] 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] [L560] kernel_st = 1 [L281] 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] [L285] 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] [L255] 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] [L258] COND TRUE m_st == 0 [L259] __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] [L276] 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] [L288] tmp = exists_runnable_thread() [L290] 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] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] 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] [L309] COND TRUE t1_st == 0 [L310] int tmp_ndt_2; [L311] tmp_ndt_2 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_2) [L314] 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] [L98] 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] [L109] 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] [L111] t1_pc = 1 [L112] 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] [L323] COND TRUE t2_st == 0 [L324] int tmp_ndt_3; [L325] tmp_ndt_3 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp_ndt_3) [L328] 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] [L134] 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] [L145] 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] [L147] t2_pc = 1 [L148] 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] [L285] 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] [L255] 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] [L258] COND TRUE m_st == 0 [L259] __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] [L276] 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] [L288] tmp = exists_runnable_thread() [L290] 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] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_1) [L300] m_st = 1 [L40] int tmp_var = __VERIFIER_nondet_int(); [L42] 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] [L53] 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] [L56] token = __VERIFIER_nondet_int() [L57] local = token [L58] E_1 = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] 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] [L170] 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] [L180] __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] [L182] 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] [L427] tmp = is_master_triggered() [L429] 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] [L186] 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] [L189] 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] [L190] COND TRUE E_1 == 1 [L191] __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] [L201] 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] [L435] tmp___0 = is_transmit1_triggered() [L437] COND TRUE \read(tmp___0) [L438] 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] [L205] 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] [L208] 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] [L209] 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] [L218] __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] [L220] 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] [L443] tmp___1 = is_transmit2_triggered() [L445] 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] [L60] E_1 = 2 [L61] m_pc = 1 [L62] 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] [L309] COND TRUE t1_st == 0 [L310] int tmp_ndt_2; [L311] tmp_ndt_2 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_2) [L314] 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] [L98] 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] [L101] 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] [L117] token += 1 [L118] E_2 = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] 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] [L170] 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] [L171] 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] [L180] __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] [L182] 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] [L427] tmp = is_master_triggered() [L429] 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] [L186] 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] [L189] 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] [L190] 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] [L199] __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] [L201] 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] [L435] tmp___0 = is_transmit1_triggered() [L437] 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] [L205] 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] [L208] 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] [L209] COND TRUE E_2 == 1 [L210] __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] [L220] 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] [L443] tmp___1 = is_transmit2_triggered() [L445] COND TRUE \read(tmp___1) [L446] 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] [L120] 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] [L109] 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] [L111] t1_pc = 1 [L112] 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] [L323] COND TRUE t2_st == 0 [L324] int tmp_ndt_3; [L325] tmp_ndt_3 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp_ndt_3) [L328] 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] [L134] 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] [L137] 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] [L153] token += 1 [L154] E_M = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] 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] [L170] 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] [L171] COND TRUE E_M == 1 [L172] __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] [L182] 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] [L427] tmp = is_master_triggered() [L429] COND TRUE \read(tmp) [L430] 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] [L186] 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] [L189] 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] [L190] 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] [L199] __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] [L201] 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] [L435] tmp___0 = is_transmit1_triggered() [L437] 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] [L205] 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] [L208] 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] [L209] 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] [L218] __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] [L220] 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] [L443] tmp___1 = is_transmit2_triggered() [L445] 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] [L156] 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] [L145] 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] [L147] t2_pc = 1 [L148] 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] [L285] 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] [L255] 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] [L258] COND TRUE m_st == 0 [L259] __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] [L276] 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] [L288] tmp = exists_runnable_thread() [L290] 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] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_1) [L300] m_st = 1 [L40] int tmp_var = __VERIFIER_nondet_int(); [L42] 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] [L45] 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] [L67] 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] [L72] 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] [L73] 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] [L79] 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] [L80] 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] [L3] __assert_fail("0", "token_ring.02.cil-2.c", 3, "reach_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, 227 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 21.1s, OverallIterations: 29, TraceHistogramMax: 3, AutomataDifference: 10.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9959 SDtfs, 12538 SDslu, 9564 SDs, 0 SdLazy, 712 SolverSat, 264 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=7170occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 7.4s AutomataMinimizationTime, 28 MinimizatonAttempts, 6361 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2577 NumberOfCodeBlocks, 2577 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 2392 ConstructedInterpolants, 0 QuantifiedInterpolants, 476043 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 PerfectInterpolantSequences, 361/361 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...