./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621b6b2c-d2bc-46e9-abd1-877ab088f507/bin/uautomizer-Z5i5R5N3CC/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621b6b2c-d2bc-46e9-abd1-877ab088f507/bin/uautomizer-Z5i5R5N3CC/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621b6b2c-d2bc-46e9-abd1-877ab088f507/bin/uautomizer-Z5i5R5N3CC/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621b6b2c-d2bc-46e9-abd1-877ab088f507/bin/uautomizer-Z5i5R5N3CC/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621b6b2c-d2bc-46e9-abd1-877ab088f507/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621b6b2c-d2bc-46e9-abd1-877ab088f507/bin/uautomizer-Z5i5R5N3CC --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 9a64ce668dc38bda3e5df5b168a4e471bb7128c4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-7b2dab5 [2021-10-11 00:33:47,386 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 00:33:47,389 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 00:33:47,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 00:33:47,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 00:33:47,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 00:33:47,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 00:33:47,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 00:33:47,446 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 00:33:47,447 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 00:33:47,448 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 00:33:47,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 00:33:47,451 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 00:33:47,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 00:33:47,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 00:33:47,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 00:33:47,457 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 00:33:47,458 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 00:33:47,460 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 00:33:47,463 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 00:33:47,465 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 00:33:47,467 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 00:33:47,468 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 00:33:47,469 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 00:33:47,473 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 00:33:47,473 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 00:33:47,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 00:33:47,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 00:33:47,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 00:33:47,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 00:33:47,477 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 00:33:47,478 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 00:33:47,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 00:33:47,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 00:33:47,482 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 00:33:47,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 00:33:47,484 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 00:33:47,484 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 00:33:47,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 00:33:47,485 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 00:33:47,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 00:33:47,487 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621b6b2c-d2bc-46e9-abd1-877ab088f507/bin/uautomizer-Z5i5R5N3CC/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-11 00:33:47,512 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 00:33:47,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 00:33:47,514 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-11 00:33:47,514 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-11 00:33:47,514 INFO L138 SettingsManager]: * Use SBE=true [2021-10-11 00:33:47,514 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 00:33:47,515 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 00:33:47,515 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 00:33:47,515 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 00:33:47,515 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 00:33:47,515 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 00:33:47,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 00:33:47,516 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 00:33:47,516 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 00:33:47,516 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 00:33:47,516 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 00:33:47,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 00:33:47,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 00:33:47,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-11 00:33:47,517 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 00:33:47,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 00:33:47,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 00:33:47,518 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 00:33:47,518 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 00:33:47,518 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-11 00:33:47,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 00:33:47,519 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 00:33:47,519 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 00:33:47,519 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_worker_vcloud-master_on_vcloud-master/run_dir_621b6b2c-d2bc-46e9-abd1-877ab088f507/bin/uautomizer-Z5i5R5N3CC/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_worker_vcloud-master_on_vcloud-master/run_dir_621b6b2c-d2bc-46e9-abd1-877ab088f507/bin/uautomizer-Z5i5R5N3CC 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 -> 9a64ce668dc38bda3e5df5b168a4e471bb7128c4 [2021-10-11 00:33:47,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 00:33:47,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 00:33:47,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 00:33:47,806 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 00:33:47,807 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 00:33:47,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621b6b2c-d2bc-46e9-abd1-877ab088f507/bin/uautomizer-Z5i5R5N3CC/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2021-10-11 00:33:47,907 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621b6b2c-d2bc-46e9-abd1-877ab088f507/bin/uautomizer-Z5i5R5N3CC/data/0f3cde0af/4f76514b4bdb407bbf8cee29601bea7c/FLAG85dcb4e89 [2021-10-11 00:33:48,452 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 00:33:48,453 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621b6b2c-d2bc-46e9-abd1-877ab088f507/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2021-10-11 00:33:48,472 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621b6b2c-d2bc-46e9-abd1-877ab088f507/bin/uautomizer-Z5i5R5N3CC/data/0f3cde0af/4f76514b4bdb407bbf8cee29601bea7c/FLAG85dcb4e89 [2021-10-11 00:33:48,775 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621b6b2c-d2bc-46e9-abd1-877ab088f507/bin/uautomizer-Z5i5R5N3CC/data/0f3cde0af/4f76514b4bdb407bbf8cee29601bea7c [2021-10-11 00:33:48,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 00:33:48,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 00:33:48,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 00:33:48,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 00:33:48,791 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 00:33:48,796 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:33:48" (1/1) ... [2021-10-11 00:33:48,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bedc2b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:48, skipping insertion in model container [2021-10-11 00:33:48,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 12:33:48" (1/1) ... [2021-10-11 00:33:48,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 00:33:48,869 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 00:33:49,099 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621b6b2c-d2bc-46e9-abd1-877ab088f507/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[366,379] [2021-10-11 00:33:49,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:33:49,215 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 00:33:49,234 WARN L226 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621b6b2c-d2bc-46e9-abd1-877ab088f507/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[366,379] [2021-10-11 00:33:49,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 00:33:49,303 INFO L208 MainTranslator]: Completed translation [2021-10-11 00:33:49,303 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:49 WrapperNode [2021-10-11 00:33:49,304 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 00:33:49,305 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 00:33:49,305 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 00:33:49,305 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 00:33:49,313 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:49" (1/1) ... [2021-10-11 00:33:49,322 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:49" (1/1) ... [2021-10-11 00:33:49,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 00:33:49,379 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 00:33:49,379 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 00:33:49,380 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 00:33:49,391 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:49" (1/1) ... [2021-10-11 00:33:49,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:49" (1/1) ... [2021-10-11 00:33:49,403 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:49" (1/1) ... [2021-10-11 00:33:49,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:49" (1/1) ... [2021-10-11 00:33:49,422 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:49" (1/1) ... [2021-10-11 00:33:49,440 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:49" (1/1) ... [2021-10-11 00:33:49,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:49" (1/1) ... [2021-10-11 00:33:49,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 00:33:49,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 00:33:49,464 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 00:33:49,464 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 00:33:49,465 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:49" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621b6b2c-d2bc-46e9-abd1-877ab088f507/bin/uautomizer-Z5i5R5N3CC/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 [2021-10-11 00:33:49,545 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 00:33:49,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 00:33:49,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 00:33:49,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 00:33:50,297 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 00:33:50,297 INFO L299 CfgBuilder]: Removed 82 assume(true) statements. [2021-10-11 00:33:50,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:33:50 BoogieIcfgContainer [2021-10-11 00:33:50,300 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 00:33:50,321 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 00:33:50,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 00:33:50,325 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 00:33:50,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 12:33:48" (1/3) ... [2021-10-11 00:33:50,326 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108e77e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:33:50, skipping insertion in model container [2021-10-11 00:33:50,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 12:33:49" (2/3) ... [2021-10-11 00:33:50,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@108e77e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 12:33:50, skipping insertion in model container [2021-10-11 00:33:50,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:33:50" (3/3) ... [2021-10-11 00:33:50,329 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2021-10-11 00:33:50,344 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 00:33:50,348 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2021-10-11 00:33:50,381 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-11 00:33:50,409 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 00:33:50,409 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 00:33:50,409 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 00:33:50,410 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 00:33:50,410 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 00:33:50,410 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 00:33:50,410 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 00:33:50,411 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 00:33:50,429 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states. [2021-10-11 00:33:50,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-11 00:33:50,436 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:50,437 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] [2021-10-11 00:33:50,437 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:50,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:50,443 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2021-10-11 00:33:50,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:50,454 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9910308] [2021-10-11 00:33:50,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:50,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:50,657 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9910308] [2021-10-11 00:33:50,658 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:50,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:50,660 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89438954] [2021-10-11 00:33:50,666 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:33:50,666 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:50,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:33:50,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:33:50,686 INFO L87 Difference]: Start difference. First operand 148 states. Second operand 3 states. [2021-10-11 00:33:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:50,769 INFO L93 Difference]: Finished difference Result 291 states and 455 transitions. [2021-10-11 00:33:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:33:50,771 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2021-10-11 00:33:50,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:50,784 INFO L225 Difference]: With dead ends: 291 [2021-10-11 00:33:50,785 INFO L226 Difference]: Without dead ends: 144 [2021-10-11 00:33:50,789 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 [2021-10-11 00:33:50,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2021-10-11 00:33:50,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2021-10-11 00:33:50,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2021-10-11 00:33:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2021-10-11 00:33:50,847 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 39 [2021-10-11 00:33:50,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:50,848 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2021-10-11 00:33:50,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:33:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2021-10-11 00:33:50,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-11 00:33:50,850 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:50,851 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] [2021-10-11 00:33:50,851 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 00:33:50,852 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:50,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:50,853 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2021-10-11 00:33:50,853 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:50,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827179438] [2021-10-11 00:33:50,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:50,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827179438] [2021-10-11 00:33:50,923 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:50,923 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:33:50,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216929423] [2021-10-11 00:33:50,925 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:33:50,926 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:50,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:33:50,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:33:50,927 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand 3 states. [2021-10-11 00:33:51,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:51,011 INFO L93 Difference]: Finished difference Result 384 states and 576 transitions. [2021-10-11 00:33:51,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:33:51,011 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2021-10-11 00:33:51,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:51,015 INFO L225 Difference]: With dead ends: 384 [2021-10-11 00:33:51,016 INFO L226 Difference]: Without dead ends: 246 [2021-10-11 00:33:51,018 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 [2021-10-11 00:33:51,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2021-10-11 00:33:51,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2021-10-11 00:33:51,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2021-10-11 00:33:51,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 362 transitions. [2021-10-11 00:33:51,056 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 362 transitions. Word has length 39 [2021-10-11 00:33:51,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:51,057 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 362 transitions. [2021-10-11 00:33:51,057 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:33:51,057 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 362 transitions. [2021-10-11 00:33:51,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-11 00:33:51,059 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:51,059 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] [2021-10-11 00:33:51,060 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 00:33:51,060 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:51,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:51,061 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2021-10-11 00:33:51,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:51,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208042142] [2021-10-11 00:33:51,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:51,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:51,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:51,139 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208042142] [2021-10-11 00:33:51,140 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:51,140 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:51,140 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019972333] [2021-10-11 00:33:51,141 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:33:51,141 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:51,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:33:51,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:51,143 INFO L87 Difference]: Start difference. First operand 242 states and 362 transitions. Second operand 4 states. [2021-10-11 00:33:51,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:51,278 INFO L93 Difference]: Finished difference Result 578 states and 863 transitions. [2021-10-11 00:33:51,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:33:51,279 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2021-10-11 00:33:51,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:51,283 INFO L225 Difference]: With dead ends: 578 [2021-10-11 00:33:51,283 INFO L226 Difference]: Without dead ends: 343 [2021-10-11 00:33:51,285 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 [2021-10-11 00:33:51,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2021-10-11 00:33:51,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 242. [2021-10-11 00:33:51,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2021-10-11 00:33:51,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 359 transitions. [2021-10-11 00:33:51,377 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 359 transitions. Word has length 39 [2021-10-11 00:33:51,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:51,378 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 359 transitions. [2021-10-11 00:33:51,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:33:51,378 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 359 transitions. [2021-10-11 00:33:51,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-11 00:33:51,388 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:51,389 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] [2021-10-11 00:33:51,389 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 00:33:51,389 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:51,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:51,390 INFO L82 PathProgramCache]: Analyzing trace with hash 1582653462, now seen corresponding path program 1 times [2021-10-11 00:33:51,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:51,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373247242] [2021-10-11 00:33:51,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:51,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:51,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:51,489 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373247242] [2021-10-11 00:33:51,490 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:51,490 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:33:51,490 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110947633] [2021-10-11 00:33:51,491 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:33:51,491 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:51,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:33:51,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:33:51,492 INFO L87 Difference]: Start difference. First operand 242 states and 359 transitions. Second operand 3 states. [2021-10-11 00:33:51,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:51,546 INFO L93 Difference]: Finished difference Result 476 states and 708 transitions. [2021-10-11 00:33:51,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:33:51,547 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2021-10-11 00:33:51,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:51,550 INFO L225 Difference]: With dead ends: 476 [2021-10-11 00:33:51,550 INFO L226 Difference]: Without dead ends: 242 [2021-10-11 00:33:51,552 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 [2021-10-11 00:33:51,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-10-11 00:33:51,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2021-10-11 00:33:51,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2021-10-11 00:33:51,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 345 transitions. [2021-10-11 00:33:51,580 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 345 transitions. Word has length 39 [2021-10-11 00:33:51,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:51,580 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 345 transitions. [2021-10-11 00:33:51,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:33:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 345 transitions. [2021-10-11 00:33:51,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-11 00:33:51,583 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:51,583 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] [2021-10-11 00:33:51,583 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 00:33:51,583 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:51,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:51,584 INFO L82 PathProgramCache]: Analyzing trace with hash 836344722, now seen corresponding path program 1 times [2021-10-11 00:33:51,585 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:51,585 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152413524] [2021-10-11 00:33:51,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:51,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:51,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:51,632 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152413524] [2021-10-11 00:33:51,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:51,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:51,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618411868] [2021-10-11 00:33:51,644 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:33:51,644 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:51,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:33:51,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:51,646 INFO L87 Difference]: Start difference. First operand 242 states and 345 transitions. Second operand 4 states. [2021-10-11 00:33:51,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:51,819 INFO L93 Difference]: Finished difference Result 560 states and 799 transitions. [2021-10-11 00:33:51,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:33:51,820 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2021-10-11 00:33:51,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:51,823 INFO L225 Difference]: With dead ends: 560 [2021-10-11 00:33:51,823 INFO L226 Difference]: Without dead ends: 327 [2021-10-11 00:33:51,827 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 [2021-10-11 00:33:51,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-10-11 00:33:51,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 242. [2021-10-11 00:33:51,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2021-10-11 00:33:51,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 342 transitions. [2021-10-11 00:33:51,856 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 342 transitions. Word has length 39 [2021-10-11 00:33:51,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:51,857 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 342 transitions. [2021-10-11 00:33:51,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:33:51,857 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 342 transitions. [2021-10-11 00:33:51,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-11 00:33:51,859 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:51,859 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] [2021-10-11 00:33:51,859 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 00:33:51,859 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:51,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:51,860 INFO L82 PathProgramCache]: Analyzing trace with hash 1537944596, now seen corresponding path program 1 times [2021-10-11 00:33:51,860 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:51,861 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048662117] [2021-10-11 00:33:51,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:51,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:51,921 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:51,922 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048662117] [2021-10-11 00:33:51,922 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:51,922 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:51,923 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244232905] [2021-10-11 00:33:51,924 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:33:51,925 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:51,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:33:51,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:51,927 INFO L87 Difference]: Start difference. First operand 242 states and 342 transitions. Second operand 4 states. [2021-10-11 00:33:52,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:52,111 INFO L93 Difference]: Finished difference Result 820 states and 1159 transitions. [2021-10-11 00:33:52,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:33:52,112 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2021-10-11 00:33:52,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:52,116 INFO L225 Difference]: With dead ends: 820 [2021-10-11 00:33:52,117 INFO L226 Difference]: Without dead ends: 589 [2021-10-11 00:33:52,118 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 [2021-10-11 00:33:52,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2021-10-11 00:33:52,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 541. [2021-10-11 00:33:52,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2021-10-11 00:33:52,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 753 transitions. [2021-10-11 00:33:52,164 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 753 transitions. Word has length 39 [2021-10-11 00:33:52,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:52,168 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 753 transitions. [2021-10-11 00:33:52,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:33:52,168 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 753 transitions. [2021-10-11 00:33:52,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-11 00:33:52,174 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:52,175 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] [2021-10-11 00:33:52,175 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 00:33:52,176 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:52,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:52,179 INFO L82 PathProgramCache]: Analyzing trace with hash -251336852, now seen corresponding path program 1 times [2021-10-11 00:33:52,180 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:52,183 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178743376] [2021-10-11 00:33:52,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-11 00:33:52,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178743376] [2021-10-11 00:33:52,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:52,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:33:52,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236515494] [2021-10-11 00:33:52,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:33:52,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:52,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:33:52,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:33:52,295 INFO L87 Difference]: Start difference. First operand 541 states and 753 transitions. Second operand 5 states. [2021-10-11 00:33:52,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:52,503 INFO L93 Difference]: Finished difference Result 1379 states and 1933 transitions. [2021-10-11 00:33:52,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:33:52,504 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2021-10-11 00:33:52,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:52,510 INFO L225 Difference]: With dead ends: 1379 [2021-10-11 00:33:52,511 INFO L226 Difference]: Without dead ends: 859 [2021-10-11 00:33:52,513 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 [2021-10-11 00:33:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2021-10-11 00:33:52,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 562. [2021-10-11 00:33:52,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2021-10-11 00:33:52,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 765 transitions. [2021-10-11 00:33:52,576 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 765 transitions. Word has length 51 [2021-10-11 00:33:52,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:52,577 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 765 transitions. [2021-10-11 00:33:52,577 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:33:52,577 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 765 transitions. [2021-10-11 00:33:52,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-11 00:33:52,584 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:52,584 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] [2021-10-11 00:33:52,584 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 00:33:52,584 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:52,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:52,586 INFO L82 PathProgramCache]: Analyzing trace with hash 450263022, now seen corresponding path program 1 times [2021-10-11 00:33:52,586 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:52,587 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122055072] [2021-10-11 00:33:52,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:52,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:52,681 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-11 00:33:52,681 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122055072] [2021-10-11 00:33:52,681 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:52,681 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:52,682 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111762773] [2021-10-11 00:33:52,682 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:33:52,682 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:52,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:33:52,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:52,683 INFO L87 Difference]: Start difference. First operand 562 states and 765 transitions. Second operand 4 states. [2021-10-11 00:33:52,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:52,805 INFO L93 Difference]: Finished difference Result 1340 states and 1827 transitions. [2021-10-11 00:33:52,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:33:52,805 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2021-10-11 00:33:52,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:52,811 INFO L225 Difference]: With dead ends: 1340 [2021-10-11 00:33:52,811 INFO L226 Difference]: Without dead ends: 801 [2021-10-11 00:33:52,813 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 [2021-10-11 00:33:52,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2021-10-11 00:33:52,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 562. [2021-10-11 00:33:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2021-10-11 00:33:52,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 752 transitions. [2021-10-11 00:33:52,869 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 752 transitions. Word has length 51 [2021-10-11 00:33:52,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:52,870 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 752 transitions. [2021-10-11 00:33:52,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:33:52,870 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 752 transitions. [2021-10-11 00:33:52,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-10-11 00:33:52,871 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:52,871 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] [2021-10-11 00:33:52,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 00:33:52,871 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:52,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:52,872 INFO L82 PathProgramCache]: Analyzing trace with hash 1836466416, now seen corresponding path program 1 times [2021-10-11 00:33:52,872 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:52,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702187521] [2021-10-11 00:33:52,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:52,921 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702187521] [2021-10-11 00:33:52,921 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:52,921 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:52,922 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839133908] [2021-10-11 00:33:52,922 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:33:52,922 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:52,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:33:52,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:33:52,924 INFO L87 Difference]: Start difference. First operand 562 states and 752 transitions. Second operand 3 states. [2021-10-11 00:33:53,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:53,070 INFO L93 Difference]: Finished difference Result 1555 states and 2057 transitions. [2021-10-11 00:33:53,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:33:53,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2021-10-11 00:33:53,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:53,078 INFO L225 Difference]: With dead ends: 1555 [2021-10-11 00:33:53,078 INFO L226 Difference]: Without dead ends: 1018 [2021-10-11 00:33:53,080 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 [2021-10-11 00:33:53,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2021-10-11 00:33:53,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 982. [2021-10-11 00:33:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2021-10-11 00:33:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1267 transitions. [2021-10-11 00:33:53,179 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1267 transitions. Word has length 51 [2021-10-11 00:33:53,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:53,179 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 1267 transitions. [2021-10-11 00:33:53,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:33:53,180 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1267 transitions. [2021-10-11 00:33:53,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2021-10-11 00:33:53,180 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:53,181 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] [2021-10-11 00:33:53,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 00:33:53,181 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:53,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:53,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1282971825, now seen corresponding path program 1 times [2021-10-11 00:33:53,182 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:53,182 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362413518] [2021-10-11 00:33:53,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-11 00:33:53,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362413518] [2021-10-11 00:33:53,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:53,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 00:33:53,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514377225] [2021-10-11 00:33:53,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:33:53,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:53,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:33:53,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:33:53,234 INFO L87 Difference]: Start difference. First operand 982 states and 1267 transitions. Second operand 3 states. [2021-10-11 00:33:53,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:53,431 INFO L93 Difference]: Finished difference Result 2328 states and 3027 transitions. [2021-10-11 00:33:53,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:33:53,432 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2021-10-11 00:33:53,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:53,442 INFO L225 Difference]: With dead ends: 2328 [2021-10-11 00:33:53,442 INFO L226 Difference]: Without dead ends: 1624 [2021-10-11 00:33:53,444 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 [2021-10-11 00:33:53,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2021-10-11 00:33:53,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1334. [2021-10-11 00:33:53,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1334 states. [2021-10-11 00:33:53,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1719 transitions. [2021-10-11 00:33:53,570 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1719 transitions. Word has length 52 [2021-10-11 00:33:53,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:53,570 INFO L481 AbstractCegarLoop]: Abstraction has 1334 states and 1719 transitions. [2021-10-11 00:33:53,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:33:53,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1719 transitions. [2021-10-11 00:33:53,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-11 00:33:53,572 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:53,572 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] [2021-10-11 00:33:53,572 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-11 00:33:53,573 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:53,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:53,573 INFO L82 PathProgramCache]: Analyzing trace with hash -778511866, now seen corresponding path program 1 times [2021-10-11 00:33:53,573 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:53,574 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833659698] [2021-10-11 00:33:53,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:53,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:53,618 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:53,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833659698] [2021-10-11 00:33:53,619 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:53,619 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 00:33:53,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293518503] [2021-10-11 00:33:53,619 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 00:33:53,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:53,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 00:33:53,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 00:33:53,621 INFO L87 Difference]: Start difference. First operand 1334 states and 1719 transitions. Second operand 5 states. [2021-10-11 00:33:53,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:53,844 INFO L93 Difference]: Finished difference Result 2606 states and 3374 transitions. [2021-10-11 00:33:53,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-11 00:33:53,845 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2021-10-11 00:33:53,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:53,856 INFO L225 Difference]: With dead ends: 2606 [2021-10-11 00:33:53,856 INFO L226 Difference]: Without dead ends: 1600 [2021-10-11 00:33:53,858 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 [2021-10-11 00:33:53,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2021-10-11 00:33:53,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1346. [2021-10-11 00:33:53,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2021-10-11 00:33:53,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1697 transitions. [2021-10-11 00:33:53,995 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1697 transitions. Word has length 63 [2021-10-11 00:33:53,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:53,996 INFO L481 AbstractCegarLoop]: Abstraction has 1346 states and 1697 transitions. [2021-10-11 00:33:53,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 00:33:53,996 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1697 transitions. [2021-10-11 00:33:53,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-11 00:33:53,997 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:53,998 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] [2021-10-11 00:33:53,998 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 00:33:53,998 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:53,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:53,999 INFO L82 PathProgramCache]: Analyzing trace with hash -355810040, now seen corresponding path program 1 times [2021-10-11 00:33:53,999 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:54,000 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630840024] [2021-10-11 00:33:54,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:54,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:54,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630840024] [2021-10-11 00:33:54,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:54,091 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:54,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758137765] [2021-10-11 00:33:54,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:33:54,092 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:54,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:33:54,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:33:54,093 INFO L87 Difference]: Start difference. First operand 1346 states and 1697 transitions. Second operand 3 states. [2021-10-11 00:33:54,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:54,387 INFO L93 Difference]: Finished difference Result 3754 states and 4725 transitions. [2021-10-11 00:33:54,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:33:54,388 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2021-10-11 00:33:54,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:54,406 INFO L225 Difference]: With dead ends: 3754 [2021-10-11 00:33:54,406 INFO L226 Difference]: Without dead ends: 2454 [2021-10-11 00:33:54,409 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 [2021-10-11 00:33:54,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2021-10-11 00:33:54,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2426. [2021-10-11 00:33:54,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2021-10-11 00:33:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 3011 transitions. [2021-10-11 00:33:54,676 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 3011 transitions. Word has length 63 [2021-10-11 00:33:54,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:54,677 INFO L481 AbstractCegarLoop]: Abstraction has 2426 states and 3011 transitions. [2021-10-11 00:33:54,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:33:54,677 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 3011 transitions. [2021-10-11 00:33:54,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-11 00:33:54,678 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:54,678 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] [2021-10-11 00:33:54,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-11 00:33:54,679 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:54,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:54,679 INFO L82 PathProgramCache]: Analyzing trace with hash 801765960, now seen corresponding path program 1 times [2021-10-11 00:33:54,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:54,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352288633] [2021-10-11 00:33:54,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:54,719 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:54,719 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352288633] [2021-10-11 00:33:54,720 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:54,720 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:33:54,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856164343] [2021-10-11 00:33:54,720 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:33:54,721 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:54,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:33:54,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:54,722 INFO L87 Difference]: Start difference. First operand 2426 states and 3011 transitions. Second operand 4 states. [2021-10-11 00:33:55,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:55,098 INFO L93 Difference]: Finished difference Result 4276 states and 5307 transitions. [2021-10-11 00:33:55,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:33:55,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2021-10-11 00:33:55,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:55,112 INFO L225 Difference]: With dead ends: 4276 [2021-10-11 00:33:55,112 INFO L226 Difference]: Without dead ends: 1875 [2021-10-11 00:33:55,118 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 [2021-10-11 00:33:55,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2021-10-11 00:33:55,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1871. [2021-10-11 00:33:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1871 states. [2021-10-11 00:33:55,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2288 transitions. [2021-10-11 00:33:55,289 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2288 transitions. Word has length 64 [2021-10-11 00:33:55,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:55,289 INFO L481 AbstractCegarLoop]: Abstraction has 1871 states and 2288 transitions. [2021-10-11 00:33:55,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:33:55,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2288 transitions. [2021-10-11 00:33:55,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-11 00:33:55,296 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:55,296 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:55,297 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-11 00:33:55,297 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:55,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:55,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1707646253, now seen corresponding path program 1 times [2021-10-11 00:33:55,298 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:55,298 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373299173] [2021-10-11 00:33:55,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:55,362 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-11 00:33:55,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373299173] [2021-10-11 00:33:55,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:55,363 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:33:55,363 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183228800] [2021-10-11 00:33:55,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:33:55,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:55,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:33:55,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:55,365 INFO L87 Difference]: Start difference. First operand 1871 states and 2288 transitions. Second operand 4 states. [2021-10-11 00:33:55,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:55,609 INFO L93 Difference]: Finished difference Result 3747 states and 4574 transitions. [2021-10-11 00:33:55,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:33:55,610 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2021-10-11 00:33:55,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:55,620 INFO L225 Difference]: With dead ends: 3747 [2021-10-11 00:33:55,621 INFO L226 Difference]: Without dead ends: 1634 [2021-10-11 00:33:55,624 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 [2021-10-11 00:33:55,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2021-10-11 00:33:55,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1596. [2021-10-11 00:33:55,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2021-10-11 00:33:55,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 1935 transitions. [2021-10-11 00:33:55,797 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 1935 transitions. Word has length 94 [2021-10-11 00:33:55,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:55,797 INFO L481 AbstractCegarLoop]: Abstraction has 1596 states and 1935 transitions. [2021-10-11 00:33:55,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:33:55,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1935 transitions. [2021-10-11 00:33:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-11 00:33:55,799 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:55,799 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:55,800 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-11 00:33:55,800 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:55,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:55,800 INFO L82 PathProgramCache]: Analyzing trace with hash -539668684, now seen corresponding path program 1 times [2021-10-11 00:33:55,801 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:55,801 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503938630] [2021-10-11 00:33:55,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:55,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:55,860 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-11 00:33:55,860 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503938630] [2021-10-11 00:33:55,860 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:55,861 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:33:55,861 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791263447] [2021-10-11 00:33:55,861 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:33:55,861 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:55,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:33:55,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:55,862 INFO L87 Difference]: Start difference. First operand 1596 states and 1935 transitions. Second operand 4 states. [2021-10-11 00:33:56,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:56,034 INFO L93 Difference]: Finished difference Result 2614 states and 3137 transitions. [2021-10-11 00:33:56,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 00:33:56,035 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2021-10-11 00:33:56,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:56,040 INFO L225 Difference]: With dead ends: 2614 [2021-10-11 00:33:56,040 INFO L226 Difference]: Without dead ends: 728 [2021-10-11 00:33:56,045 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 [2021-10-11 00:33:56,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 728 states. [2021-10-11 00:33:56,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 728 to 716. [2021-10-11 00:33:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 716 states. [2021-10-11 00:33:56,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 806 transitions. [2021-10-11 00:33:56,109 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 806 transitions. Word has length 94 [2021-10-11 00:33:56,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:56,109 INFO L481 AbstractCegarLoop]: Abstraction has 716 states and 806 transitions. [2021-10-11 00:33:56,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:33:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 806 transitions. [2021-10-11 00:33:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2021-10-11 00:33:56,111 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:56,111 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:56,112 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-11 00:33:56,112 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:56,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:56,112 INFO L82 PathProgramCache]: Analyzing trace with hash -899403247, now seen corresponding path program 1 times [2021-10-11 00:33:56,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:56,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605889783] [2021-10-11 00:33:56,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:56,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:56,194 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 00:33:56,194 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605889783] [2021-10-11 00:33:56,194 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:56,195 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:56,195 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782479598] [2021-10-11 00:33:56,195 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:33:56,195 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:56,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:33:56,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:33:56,196 INFO L87 Difference]: Start difference. First operand 716 states and 806 transitions. Second operand 3 states. [2021-10-11 00:33:56,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:56,273 INFO L93 Difference]: Finished difference Result 1048 states and 1187 transitions. [2021-10-11 00:33:56,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:33:56,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2021-10-11 00:33:56,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:56,278 INFO L225 Difference]: With dead ends: 1048 [2021-10-11 00:33:56,278 INFO L226 Difference]: Without dead ends: 594 [2021-10-11 00:33:56,279 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 [2021-10-11 00:33:56,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2021-10-11 00:33:56,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2021-10-11 00:33:56,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2021-10-11 00:33:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 662 transitions. [2021-10-11 00:33:56,334 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 662 transitions. Word has length 94 [2021-10-11 00:33:56,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:56,334 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 662 transitions. [2021-10-11 00:33:56,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:33:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 662 transitions. [2021-10-11 00:33:56,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-10-11 00:33:56,336 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:56,336 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:56,336 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-11 00:33:56,337 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:56,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:56,337 INFO L82 PathProgramCache]: Analyzing trace with hash -1716798106, now seen corresponding path program 1 times [2021-10-11 00:33:56,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:56,338 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758369095] [2021-10-11 00:33:56,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:56,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:56,447 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-11 00:33:56,447 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758369095] [2021-10-11 00:33:56,447 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:56,447 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 00:33:56,448 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319599507] [2021-10-11 00:33:56,448 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 00:33:56,448 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:56,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 00:33:56,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:56,449 INFO L87 Difference]: Start difference. First operand 594 states and 662 transitions. Second operand 4 states. [2021-10-11 00:33:56,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:56,537 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2021-10-11 00:33:56,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 00:33:56,538 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2021-10-11 00:33:56,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:56,542 INFO L225 Difference]: With dead ends: 598 [2021-10-11 00:33:56,542 INFO L226 Difference]: Without dead ends: 596 [2021-10-11 00:33:56,543 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 00:33:56,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2021-10-11 00:33:56,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 592. [2021-10-11 00:33:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2021-10-11 00:33:56,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 659 transitions. [2021-10-11 00:33:56,622 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 659 transitions. Word has length 95 [2021-10-11 00:33:56,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:56,623 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 659 transitions. [2021-10-11 00:33:56,623 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 00:33:56,623 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 659 transitions. [2021-10-11 00:33:56,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2021-10-11 00:33:56,625 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:56,625 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:56,625 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-11 00:33:56,625 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:56,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:56,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1152111348, now seen corresponding path program 1 times [2021-10-11 00:33:56,626 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:56,626 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10388015] [2021-10-11 00:33:56,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 00:33:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2021-10-11 00:33:56,703 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10388015] [2021-10-11 00:33:56,703 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 00:33:56,703 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 00:33:56,703 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738367494] [2021-10-11 00:33:56,704 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 00:33:56,704 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-11 00:33:56,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 00:33:56,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 00:33:56,705 INFO L87 Difference]: Start difference. First operand 592 states and 659 transitions. Second operand 3 states. [2021-10-11 00:33:56,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 00:33:56,850 INFO L93 Difference]: Finished difference Result 1230 states and 1372 transitions. [2021-10-11 00:33:56,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 00:33:56,851 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2021-10-11 00:33:56,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 00:33:56,858 INFO L225 Difference]: With dead ends: 1230 [2021-10-11 00:33:56,858 INFO L226 Difference]: Without dead ends: 900 [2021-10-11 00:33:56,860 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 [2021-10-11 00:33:56,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2021-10-11 00:33:56,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 594. [2021-10-11 00:33:56,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2021-10-11 00:33:56,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 661 transitions. [2021-10-11 00:33:56,955 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 661 transitions. Word has length 99 [2021-10-11 00:33:56,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 00:33:56,955 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 661 transitions. [2021-10-11 00:33:56,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 00:33:56,956 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 661 transitions. [2021-10-11 00:33:56,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-10-11 00:33:56,958 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 00:33:56,958 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 00:33:56,959 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-11 00:33:56,959 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 00:33:56,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 00:33:56,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1118276470, now seen corresponding path program 1 times [2021-10-11 00:33:56,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-11 00:33:56,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303504517] [2021-10-11 00:33:56,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 00:33:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:56,982 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 00:33:57,003 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 00:33:57,053 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-11 00:33:57,054 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 00:33:57,054 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-11 00:33:57,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 12:33:57 BoogieIcfgContainer [2021-10-11 00:33:57,213 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 00:33:57,214 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 00:33:57,214 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 00:33:57,214 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 00:33:57,215 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 12:33:50" (3/4) ... [2021-10-11 00:33:57,217 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 00:33:57,370 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_621b6b2c-d2bc-46e9-abd1-877ab088f507/bin/uautomizer-Z5i5R5N3CC/witness.graphml [2021-10-11 00:33:57,371 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 00:33:57,372 INFO L168 Benchmark]: Toolchain (without parser) took 8589.02 ms. Allocated memory was 107.0 MB in the beginning and 312.5 MB in the end (delta: 205.5 MB). Free memory was 73.8 MB in the beginning and 174.1 MB in the end (delta: -100.3 MB). Peak memory consumption was 105.0 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:57,373 INFO L168 Benchmark]: CDTParser took 0.55 ms. Allocated memory is still 71.3 MB. Free memory was 32.2 MB in the beginning and 32.2 MB in the end (delta: 38.6 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 00:33:57,373 INFO L168 Benchmark]: CACSL2BoogieTranslator took 517.31 ms. Allocated memory is still 107.0 MB. Free memory was 73.6 MB in the beginning and 79.7 MB in the end (delta: -6.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:57,374 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.80 ms. Allocated memory is still 107.0 MB. Free memory was 79.7 MB in the beginning and 77.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:57,374 INFO L168 Benchmark]: Boogie Preprocessor took 75.24 ms. Allocated memory is still 107.0 MB. Free memory was 77.1 MB in the beginning and 75.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:57,375 INFO L168 Benchmark]: RCFGBuilder took 844.70 ms. Allocated memory is still 107.0 MB. Free memory was 75.0 MB in the beginning and 35.7 MB in the end (delta: 39.3 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:57,375 INFO L168 Benchmark]: TraceAbstraction took 6891.55 ms. Allocated memory was 107.0 MB in the beginning and 312.5 MB in the end (delta: 205.5 MB). Free memory was 83.0 MB in the beginning and 187.7 MB in the end (delta: -104.7 MB). Peak memory consumption was 99.0 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:57,376 INFO L168 Benchmark]: Witness Printer took 157.07 ms. Allocated memory is still 312.5 MB. Free memory was 187.7 MB in the beginning and 174.1 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-10-11 00:33:57,378 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.55 ms. Allocated memory is still 71.3 MB. Free memory was 32.2 MB in the beginning and 32.2 MB in the end (delta: 38.6 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 517.31 ms. Allocated memory is still 107.0 MB. Free memory was 73.6 MB in the beginning and 79.7 MB in the end (delta: -6.2 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 72.80 ms. Allocated memory is still 107.0 MB. Free memory was 79.7 MB in the beginning and 77.1 MB in the end (delta: 2.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 75.24 ms. Allocated memory is still 107.0 MB. Free memory was 77.1 MB in the beginning and 75.0 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 844.70 ms. Allocated memory is still 107.0 MB. Free memory was 75.0 MB in the beginning and 35.7 MB in the end (delta: 39.3 MB). Peak memory consumption was 37.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6891.55 ms. Allocated memory was 107.0 MB in the beginning and 312.5 MB in the end (delta: 205.5 MB). Free memory was 83.0 MB in the beginning and 187.7 MB in the end (delta: -104.7 MB). Peak memory consumption was 99.0 MB. Max. memory is 16.1 GB. * Witness Printer took 157.07 ms. Allocated memory is still 312.5 MB. Free memory was 187.7 MB in the beginning and 174.1 MB in the end (delta: 13.6 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int m_i ; [L21] int t1_i ; [L22] int M_E = 2; [L23] int T1_E = 2; [L24] int E_M = 2; [L25] int E_1 = 2; [L29] int token ; [L31] int local ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L477] int __retres1 ; [L392] m_i = 1 [L393] t1_i = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L418] int kernel_st ; [L419] int tmp ; [L420] int tmp___0 ; [L424] kernel_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L174] COND TRUE m_i == 1 [L175] m_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L179] COND TRUE t1_i == 1 [L180] t1_st = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L263] COND FALSE !(M_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L268] COND FALSE !(T1_E == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L273] COND FALSE !(E_M == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L278] COND FALSE !(E_1 == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L128] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L138] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L140] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L144] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L147] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L157] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L159] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L291] COND FALSE !(M_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L296] COND FALSE !(T1_E == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L301] COND FALSE !(E_M == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L306] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L432] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L435] kernel_st = 1 [L210] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L214] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L189] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L205] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L92] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L103] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L214] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L189] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L205] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L47] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L50] token = __VERIFIER_nondet_int() [L51] local = token [L52] E_1 = 1 [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L128] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L138] __retres1 = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L140] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L321] tmp = is_master_triggered() [L323] COND FALSE !(\read(tmp)) VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L144] int __retres1 ; VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L147] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L148] COND TRUE E_1 == 1 [L149] __retres1 = 1 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L159] return (__retres1); VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L329] tmp___0 = is_transmit1_triggered() [L331] COND TRUE \read(tmp___0) [L332] t1_st = 0 VAL [E_1=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L54] E_1 = 2 [L55] m_pc = 1 [L56] m_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L238] COND TRUE t1_st == 0 [L239] int tmp_ndt_2; [L240] tmp_ndt_2 = __VERIFIER_nondet_int() [L241] COND TRUE \read(tmp_ndt_2) [L243] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L92] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L95] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L111] token += 1 [L112] E_M = 1 [L316] int tmp ; [L317] int tmp___0 ; [L125] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L128] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L129] COND TRUE E_M == 1 [L130] __retres1 = 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L140] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L321] tmp = is_master_triggered() [L323] COND TRUE \read(tmp) [L324] m_st = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L144] int __retres1 ; VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L147] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L148] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L157] __retres1 = 0 VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L159] return (__retres1); VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L329] tmp___0 = is_transmit1_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L114] E_M = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L103] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L214] COND TRUE 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L189] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L192] COND TRUE m_st == 0 [L193] __retres1 = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L205] return (__retres1); VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L217] tmp = exists_runnable_thread() [L219] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L224] COND TRUE m_st == 0 [L225] int tmp_ndt_1; [L226] tmp_ndt_1 = __VERIFIER_nondet_int() [L227] COND TRUE \read(tmp_ndt_1) [L229] m_st = 1 [L34] int tmp_var = __VERIFIER_nondet_int(); [L36] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L39] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L61] COND FALSE !(token != local + 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L66] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L67] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L72] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L73] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L74] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L12] reach_error() VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 148 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.6s, OverallIterations: 19, TraceHistogramMax: 3, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3984 SDtfs, 5328 SDslu, 3898 SDs, 0 SdLazy, 453 SolverSat, 163 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2426occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 1746 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 1205 NumberOfCodeBlocks, 1205 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1087 ConstructedInterpolants, 0 QuantifiedInterpolants, 147019 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 204/204 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...