./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 a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_a11e10da-cc25-4a7b-95d1-d268a367c0d9/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_a11e10da-cc25-4a7b-95d1-d268a367c0d9/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_a11e10da-cc25-4a7b-95d1-d268a367c0d9/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_a11e10da-cc25-4a7b-95d1-d268a367c0d9/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud-vcloud-master/worker/run_dir_a11e10da-cc25-4a7b-95d1-d268a367c0d9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_a11e10da-cc25-4a7b-95d1-d268a367c0d9/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 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-a4ecdab [2020-11-29 19:28:54,723 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-29 19:28:54,725 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-29 19:28:54,762 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-29 19:28:54,762 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-29 19:28:54,764 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-29 19:28:54,766 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-29 19:28:54,769 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-29 19:28:54,771 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-29 19:28:54,773 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-29 19:28:54,774 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-29 19:28:54,776 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-29 19:28:54,776 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-29 19:28:54,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-29 19:28:54,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-29 19:28:54,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-29 19:28:54,782 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-29 19:28:54,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-29 19:28:54,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-29 19:28:54,792 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-29 19:28:54,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-29 19:28:54,801 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-29 19:28:54,804 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-29 19:28:54,805 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-29 19:28:54,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-29 19:28:54,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-29 19:28:54,816 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-29 19:28:54,818 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-29 19:28:54,819 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-29 19:28:54,823 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-29 19:28:54,827 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-29 19:28:54,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-29 19:28:54,830 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-29 19:28:54,831 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-29 19:28:54,833 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-29 19:28:54,834 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-29 19:28:54,835 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-29 19:28:54,835 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-29 19:28:54,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-29 19:28:54,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-29 19:28:54,838 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-29 19:28:54,841 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_a11e10da-cc25-4a7b-95d1-d268a367c0d9/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-29 19:28:54,891 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-29 19:28:54,892 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-29 19:28:54,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-29 19:28:54,894 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-29 19:28:54,894 INFO L138 SettingsManager]: * Use SBE=true [2020-11-29 19:28:54,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-29 19:28:54,895 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-29 19:28:54,895 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-29 19:28:54,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-29 19:28:54,896 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-29 19:28:54,897 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-29 19:28:54,898 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-29 19:28:54,898 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-29 19:28:54,898 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-29 19:28:54,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-29 19:28:54,899 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-29 19:28:54,899 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-29 19:28:54,899 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-29 19:28:54,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-29 19:28:54,900 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-29 19:28:54,900 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-29 19:28:54,901 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 19:28:54,901 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-29 19:28:54,901 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-29 19:28:54,901 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-29 19:28:54,902 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-29 19:28:54,902 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-29 19:28:54,902 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-29 19:28:54,903 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-29 19:28:54,903 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud-vcloud-master/worker/run_dir_a11e10da-cc25-4a7b-95d1-d268a367c0d9/bin/uautomizer/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_a11e10da-cc25-4a7b-95d1-d268a367c0d9/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 9a64ce668dc38bda3e5df5b168a4e471bb7128c4 [2020-11-29 19:28:55,190 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-29 19:28:55,237 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-29 19:28:55,240 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-29 19:28:55,241 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-29 19:28:55,242 INFO L275 PluginConnector]: CDTParser initialized [2020-11-29 19:28:55,243 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_a11e10da-cc25-4a7b-95d1-d268a367c0d9/bin/uautomizer/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2020-11-29 19:28:55,312 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a11e10da-cc25-4a7b-95d1-d268a367c0d9/bin/uautomizer/data/69341b5a3/daf10a08138344a39fe73b24316c3c61/FLAG4314022f5 [2020-11-29 19:28:55,924 INFO L306 CDTParser]: Found 1 translation units. [2020-11-29 19:28:55,925 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_a11e10da-cc25-4a7b-95d1-d268a367c0d9/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2020-11-29 19:28:55,934 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_a11e10da-cc25-4a7b-95d1-d268a367c0d9/bin/uautomizer/data/69341b5a3/daf10a08138344a39fe73b24316c3c61/FLAG4314022f5 [2020-11-29 19:28:56,240 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_a11e10da-cc25-4a7b-95d1-d268a367c0d9/bin/uautomizer/data/69341b5a3/daf10a08138344a39fe73b24316c3c61 [2020-11-29 19:28:56,244 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-29 19:28:56,247 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-29 19:28:56,251 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-29 19:28:56,252 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-29 19:28:56,255 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-29 19:28:56,257 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:28:56" (1/1) ... [2020-11-29 19:28:56,260 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d9ea9bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:28:56, skipping insertion in model container [2020-11-29 19:28:56,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 07:28:56" (1/1) ... [2020-11-29 19:28:56,268 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-29 19:28:56,297 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-29 19:28:56,549 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:28:56,562 INFO L203 MainTranslator]: Completed pre-run [2020-11-29 19:28:56,652 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-29 19:28:56,688 INFO L208 MainTranslator]: Completed translation [2020-11-29 19:28:56,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:28:56 WrapperNode [2020-11-29 19:28:56,688 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-29 19:28:56,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-29 19:28:56,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-29 19:28:56,690 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-29 19:28:56,699 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:28:56" (1/1) ... [2020-11-29 19:28:56,708 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:28:56" (1/1) ... [2020-11-29 19:28:56,751 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-29 19:28:56,756 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-29 19:28:56,757 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-29 19:28:56,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-29 19:28:56,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:28:56" (1/1) ... [2020-11-29 19:28:56,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:28:56" (1/1) ... [2020-11-29 19:28:56,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:28:56" (1/1) ... [2020-11-29 19:28:56,789 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:28:56" (1/1) ... [2020-11-29 19:28:56,797 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:28:56" (1/1) ... [2020-11-29 19:28:56,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:28:56" (1/1) ... [2020-11-29 19:28:56,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:28:56" (1/1) ... [2020-11-29 19:28:56,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-29 19:28:56,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-29 19:28:56,838 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-29 19:28:56,839 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-29 19:28:56,840 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:28:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_a11e10da-cc25-4a7b-95d1-d268a367c0d9/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-29 19:28:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-29 19:28:56,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-29 19:28:56,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-29 19:28:56,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-29 19:28:57,943 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-29 19:28:57,943 INFO L298 CfgBuilder]: Removed 86 assume(true) statements. [2020-11-29 19:28:57,946 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:28:57 BoogieIcfgContainer [2020-11-29 19:28:57,947 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-29 19:28:57,949 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-29 19:28:57,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-29 19:28:57,955 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-29 19:28:57,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 07:28:56" (1/3) ... [2020-11-29 19:28:57,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2ab37a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:28:57, skipping insertion in model container [2020-11-29 19:28:57,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 07:28:56" (2/3) ... [2020-11-29 19:28:57,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7e2ab37a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 07:28:57, skipping insertion in model container [2020-11-29 19:28:57,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:28:57" (3/3) ... [2020-11-29 19:28:57,960 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2020-11-29 19:28:57,973 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-29 19:28:57,978 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-29 19:28:57,992 INFO L253 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2020-11-29 19:28:58,034 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-29 19:28:58,037 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-29 19:28:58,037 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-29 19:28:58,037 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-29 19:28:58,038 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-29 19:28:58,038 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-29 19:28:58,038 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-29 19:28:58,038 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-29 19:28:58,065 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2020-11-29 19:28:58,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 19:28:58,076 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:28:58,077 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] [2020-11-29 19:28:58,077 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:28:58,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:28:58,083 INFO L82 PathProgramCache]: Analyzing trace with hash 754195226, now seen corresponding path program 1 times [2020-11-29 19:28:58,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:28:58,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724864540] [2020-11-29 19:28:58,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:28:58,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:28:58,275 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:28:58,276 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724864540] [2020-11-29 19:28:58,277 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:28:58,277 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:28:58,278 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221152374] [2020-11-29 19:28:58,283 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:28:58,284 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:28:58,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:28:58,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:28:58,307 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 3 states. [2020-11-29 19:28:58,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:28:58,403 INFO L93 Difference]: Finished difference Result 293 states and 457 transitions. [2020-11-29 19:28:58,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:28:58,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-11-29 19:28:58,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:28:58,437 INFO L225 Difference]: With dead ends: 293 [2020-11-29 19:28:58,438 INFO L226 Difference]: Without dead ends: 144 [2020-11-29 19:28:58,448 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:28:58,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2020-11-29 19:28:58,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2020-11-29 19:28:58,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2020-11-29 19:28:58,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 216 transitions. [2020-11-29 19:28:58,529 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 216 transitions. Word has length 39 [2020-11-29 19:28:58,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:28:58,530 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 216 transitions. [2020-11-29 19:28:58,530 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:28:58,531 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 216 transitions. [2020-11-29 19:28:58,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 19:28:58,533 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:28:58,533 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] [2020-11-29 19:28:58,533 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-29 19:28:58,534 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:28:58,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:28:58,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1598200728, now seen corresponding path program 1 times [2020-11-29 19:28:58,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:28:58,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625900759] [2020-11-29 19:28:58,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:28:58,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:28:58,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:28:58,612 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625900759] [2020-11-29 19:28:58,612 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:28:58,612 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:28:58,613 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606094345] [2020-11-29 19:28:58,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:28:58,614 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:28:58,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:28:58,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:28:58,616 INFO L87 Difference]: Start difference. First operand 144 states and 216 transitions. Second operand 3 states. [2020-11-29 19:28:58,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:28:58,720 INFO L93 Difference]: Finished difference Result 384 states and 576 transitions. [2020-11-29 19:28:58,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:28:58,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-11-29 19:28:58,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:28:58,724 INFO L225 Difference]: With dead ends: 384 [2020-11-29 19:28:58,724 INFO L226 Difference]: Without dead ends: 246 [2020-11-29 19:28:58,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:28:58,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2020-11-29 19:28:58,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 242. [2020-11-29 19:28:58,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-11-29 19:28:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 362 transitions. [2020-11-29 19:28:58,780 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 362 transitions. Word has length 39 [2020-11-29 19:28:58,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:28:58,781 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 362 transitions. [2020-11-29 19:28:58,781 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:28:58,781 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 362 transitions. [2020-11-29 19:28:58,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 19:28:58,785 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:28:58,786 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] [2020-11-29 19:28:58,786 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-29 19:28:58,787 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:28:58,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:28:58,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1655040020, now seen corresponding path program 1 times [2020-11-29 19:28:58,788 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:28:58,788 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866961420] [2020-11-29 19:28:58,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:28:58,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:28:58,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:28:58,865 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866961420] [2020-11-29 19:28:58,865 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:28:58,866 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:28:58,866 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900993327] [2020-11-29 19:28:58,866 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:28:58,867 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:28:58,867 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:28:58,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:28:58,868 INFO L87 Difference]: Start difference. First operand 242 states and 362 transitions. Second operand 4 states. [2020-11-29 19:28:59,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:28:59,027 INFO L93 Difference]: Finished difference Result 578 states and 863 transitions. [2020-11-29 19:28:59,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:28:59,028 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-11-29 19:28:59,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:28:59,032 INFO L225 Difference]: With dead ends: 578 [2020-11-29 19:28:59,032 INFO L226 Difference]: Without dead ends: 343 [2020-11-29 19:28:59,035 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:28:59,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2020-11-29 19:28:59,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 242. [2020-11-29 19:28:59,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-11-29 19:28:59,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 359 transitions. [2020-11-29 19:28:59,067 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 359 transitions. Word has length 39 [2020-11-29 19:28:59,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:28:59,067 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 359 transitions. [2020-11-29 19:28:59,067 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:28:59,067 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 359 transitions. [2020-11-29 19:28:59,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 19:28:59,069 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:28:59,069 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] [2020-11-29 19:28:59,069 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-29 19:28:59,070 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:28:59,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:28:59,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1582653462, now seen corresponding path program 1 times [2020-11-29 19:28:59,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:28:59,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890095160] [2020-11-29 19:28:59,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:28:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:28:59,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:28:59,167 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890095160] [2020-11-29 19:28:59,167 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:28:59,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:28:59,168 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996364038] [2020-11-29 19:28:59,168 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:28:59,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:28:59,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:28:59,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:28:59,170 INFO L87 Difference]: Start difference. First operand 242 states and 359 transitions. Second operand 3 states. [2020-11-29 19:28:59,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:28:59,244 INFO L93 Difference]: Finished difference Result 476 states and 708 transitions. [2020-11-29 19:28:59,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:28:59,246 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2020-11-29 19:28:59,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:28:59,250 INFO L225 Difference]: With dead ends: 476 [2020-11-29 19:28:59,250 INFO L226 Difference]: Without dead ends: 242 [2020-11-29 19:28:59,255 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:28:59,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2020-11-29 19:28:59,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 242. [2020-11-29 19:28:59,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-11-29 19:28:59,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 345 transitions. [2020-11-29 19:28:59,298 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 345 transitions. Word has length 39 [2020-11-29 19:28:59,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:28:59,298 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 345 transitions. [2020-11-29 19:28:59,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:28:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 345 transitions. [2020-11-29 19:28:59,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 19:28:59,307 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:28:59,308 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] [2020-11-29 19:28:59,308 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-29 19:28:59,308 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:28:59,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:28:59,309 INFO L82 PathProgramCache]: Analyzing trace with hash 836344722, now seen corresponding path program 1 times [2020-11-29 19:28:59,311 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:28:59,311 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272437423] [2020-11-29 19:28:59,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:28:59,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:28:59,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:28:59,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272437423] [2020-11-29 19:28:59,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:28:59,418 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:28:59,418 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605400168] [2020-11-29 19:28:59,418 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:28:59,418 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:28:59,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:28:59,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:28:59,419 INFO L87 Difference]: Start difference. First operand 242 states and 345 transitions. Second operand 4 states. [2020-11-29 19:28:59,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:28:59,554 INFO L93 Difference]: Finished difference Result 560 states and 799 transitions. [2020-11-29 19:28:59,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:28:59,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-11-29 19:28:59,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:28:59,557 INFO L225 Difference]: With dead ends: 560 [2020-11-29 19:28:59,558 INFO L226 Difference]: Without dead ends: 327 [2020-11-29 19:28:59,559 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:28:59,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2020-11-29 19:28:59,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 242. [2020-11-29 19:28:59,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2020-11-29 19:28:59,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 342 transitions. [2020-11-29 19:28:59,586 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 342 transitions. Word has length 39 [2020-11-29 19:28:59,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:28:59,587 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 342 transitions. [2020-11-29 19:28:59,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:28:59,587 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 342 transitions. [2020-11-29 19:28:59,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2020-11-29 19:28:59,594 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:28:59,594 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] [2020-11-29 19:28:59,594 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-29 19:28:59,594 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:28:59,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:28:59,595 INFO L82 PathProgramCache]: Analyzing trace with hash 1537944596, now seen corresponding path program 1 times [2020-11-29 19:28:59,595 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:28:59,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082235350] [2020-11-29 19:28:59,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:28:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:28:59,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:28:59,659 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082235350] [2020-11-29 19:28:59,659 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:28:59,659 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:28:59,659 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052376179] [2020-11-29 19:28:59,660 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:28:59,660 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:28:59,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:28:59,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:28:59,661 INFO L87 Difference]: Start difference. First operand 242 states and 342 transitions. Second operand 4 states. [2020-11-29 19:28:59,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:28:59,830 INFO L93 Difference]: Finished difference Result 820 states and 1159 transitions. [2020-11-29 19:28:59,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:28:59,831 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2020-11-29 19:28:59,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:28:59,835 INFO L225 Difference]: With dead ends: 820 [2020-11-29 19:28:59,836 INFO L226 Difference]: Without dead ends: 589 [2020-11-29 19:28:59,837 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:28:59,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2020-11-29 19:28:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 541. [2020-11-29 19:28:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 541 states. [2020-11-29 19:28:59,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 753 transitions. [2020-11-29 19:28:59,884 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 753 transitions. Word has length 39 [2020-11-29 19:28:59,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:28:59,889 INFO L481 AbstractCegarLoop]: Abstraction has 541 states and 753 transitions. [2020-11-29 19:28:59,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:28:59,890 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 753 transitions. [2020-11-29 19:28:59,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-29 19:28:59,893 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:28:59,895 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] [2020-11-29 19:28:59,895 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-29 19:28:59,895 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:28:59,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:28:59,897 INFO L82 PathProgramCache]: Analyzing trace with hash 1965836524, now seen corresponding path program 1 times [2020-11-29 19:28:59,897 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:28:59,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245508238] [2020-11-29 19:28:59,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:28:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:28:59,978 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-29 19:28:59,979 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245508238] [2020-11-29 19:28:59,979 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:28:59,979 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 19:28:59,979 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726276252] [2020-11-29 19:28:59,980 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:28:59,980 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:28:59,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:28:59,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:28:59,981 INFO L87 Difference]: Start difference. First operand 541 states and 753 transitions. Second operand 5 states. [2020-11-29 19:29:00,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:29:00,190 INFO L93 Difference]: Finished difference Result 1379 states and 1933 transitions. [2020-11-29 19:29:00,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:29:00,190 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 51 [2020-11-29 19:29:00,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:29:00,197 INFO L225 Difference]: With dead ends: 1379 [2020-11-29 19:29:00,197 INFO L226 Difference]: Without dead ends: 859 [2020-11-29 19:29:00,199 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:29:00,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states. [2020-11-29 19:29:00,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 562. [2020-11-29 19:29:00,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-11-29 19:29:00,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 765 transitions. [2020-11-29 19:29:00,263 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 765 transitions. Word has length 51 [2020-11-29 19:29:00,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:29:00,263 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 765 transitions. [2020-11-29 19:29:00,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:29:00,264 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 765 transitions. [2020-11-29 19:29:00,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-29 19:29:00,265 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:29:00,265 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] [2020-11-29 19:29:00,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-29 19:29:00,266 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:29:00,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:29:00,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1627530898, now seen corresponding path program 1 times [2020-11-29 19:29:00,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:29:00,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713037113] [2020-11-29 19:29:00,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:29:00,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:29:00,352 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-11-29 19:29:00,352 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713037113] [2020-11-29 19:29:00,352 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:29:00,352 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:29:00,353 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292578996] [2020-11-29 19:29:00,353 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:29:00,353 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:29:00,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:29:00,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:29:00,354 INFO L87 Difference]: Start difference. First operand 562 states and 765 transitions. Second operand 4 states. [2020-11-29 19:29:00,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:29:00,459 INFO L93 Difference]: Finished difference Result 1340 states and 1827 transitions. [2020-11-29 19:29:00,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:29:00,460 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 51 [2020-11-29 19:29:00,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:29:00,465 INFO L225 Difference]: With dead ends: 1340 [2020-11-29 19:29:00,465 INFO L226 Difference]: Without dead ends: 801 [2020-11-29 19:29:00,467 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:29:00,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2020-11-29 19:29:00,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 562. [2020-11-29 19:29:00,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-11-29 19:29:00,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 752 transitions. [2020-11-29 19:29:00,524 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 752 transitions. Word has length 51 [2020-11-29 19:29:00,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:29:00,525 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 752 transitions. [2020-11-29 19:29:00,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:29:00,525 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 752 transitions. [2020-11-29 19:29:00,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2020-11-29 19:29:00,526 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:29:00,526 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] [2020-11-29 19:29:00,527 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-29 19:29:00,527 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:29:00,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:29:00,527 INFO L82 PathProgramCache]: Analyzing trace with hash -241327504, now seen corresponding path program 1 times [2020-11-29 19:29:00,528 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:29:00,528 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113598971] [2020-11-29 19:29:00,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:29:00,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:29:00,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:29:00,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113598971] [2020-11-29 19:29:00,604 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:29:00,604 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:29:00,604 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [596550218] [2020-11-29 19:29:00,605 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:29:00,605 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:29:00,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:29:00,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:29:00,606 INFO L87 Difference]: Start difference. First operand 562 states and 752 transitions. Second operand 3 states. [2020-11-29 19:29:00,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:29:00,742 INFO L93 Difference]: Finished difference Result 1555 states and 2057 transitions. [2020-11-29 19:29:00,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:29:00,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2020-11-29 19:29:00,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:29:00,750 INFO L225 Difference]: With dead ends: 1555 [2020-11-29 19:29:00,751 INFO L226 Difference]: Without dead ends: 1018 [2020-11-29 19:29:00,753 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:29:00,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2020-11-29 19:29:00,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 982. [2020-11-29 19:29:00,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2020-11-29 19:29:00,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1267 transitions. [2020-11-29 19:29:00,829 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1267 transitions. Word has length 51 [2020-11-29 19:29:00,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:29:00,830 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 1267 transitions. [2020-11-29 19:29:00,830 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:29:00,830 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1267 transitions. [2020-11-29 19:29:00,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-11-29 19:29:00,831 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:29:00,831 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] [2020-11-29 19:29:00,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-29 19:29:00,832 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:29:00,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:29:00,832 INFO L82 PathProgramCache]: Analyzing trace with hash -794822095, now seen corresponding path program 1 times [2020-11-29 19:29:00,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:29:00,833 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064021020] [2020-11-29 19:29:00,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:29:00,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:29:00,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-29 19:29:00,889 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1064021020] [2020-11-29 19:29:00,889 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:29:00,890 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-29 19:29:00,890 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257080319] [2020-11-29 19:29:00,890 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:29:00,891 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:29:00,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:29:00,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:29:00,892 INFO L87 Difference]: Start difference. First operand 982 states and 1267 transitions. Second operand 3 states. [2020-11-29 19:29:01,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:29:01,070 INFO L93 Difference]: Finished difference Result 2328 states and 3027 transitions. [2020-11-29 19:29:01,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:29:01,073 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 52 [2020-11-29 19:29:01,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:29:01,084 INFO L225 Difference]: With dead ends: 2328 [2020-11-29 19:29:01,084 INFO L226 Difference]: Without dead ends: 1624 [2020-11-29 19:29:01,085 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:29:01,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1624 states. [2020-11-29 19:29:01,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1624 to 1334. [2020-11-29 19:29:01,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1334 states. [2020-11-29 19:29:01,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1334 states to 1334 states and 1719 transitions. [2020-11-29 19:29:01,203 INFO L78 Accepts]: Start accepts. Automaton has 1334 states and 1719 transitions. Word has length 52 [2020-11-29 19:29:01,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:29:01,203 INFO L481 AbstractCegarLoop]: Abstraction has 1334 states and 1719 transitions. [2020-11-29 19:29:01,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:29:01,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1334 states and 1719 transitions. [2020-11-29 19:29:01,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-29 19:29:01,205 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:29:01,205 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] [2020-11-29 19:29:01,205 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-29 19:29:01,205 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:29:01,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:29:01,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1952123894, now seen corresponding path program 1 times [2020-11-29 19:29:01,206 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:29:01,206 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282787725] [2020-11-29 19:29:01,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:29:01,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:29:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:29:01,293 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282787725] [2020-11-29 19:29:01,293 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:29:01,293 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-29 19:29:01,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712753571] [2020-11-29 19:29:01,294 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-29 19:29:01,294 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:29:01,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-29 19:29:01,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:29:01,295 INFO L87 Difference]: Start difference. First operand 1334 states and 1719 transitions. Second operand 5 states. [2020-11-29 19:29:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:29:01,536 INFO L93 Difference]: Finished difference Result 2606 states and 3374 transitions. [2020-11-29 19:29:01,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-29 19:29:01,536 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2020-11-29 19:29:01,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:29:01,547 INFO L225 Difference]: With dead ends: 2606 [2020-11-29 19:29:01,548 INFO L226 Difference]: Without dead ends: 1600 [2020-11-29 19:29:01,552 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-29 19:29:01,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2020-11-29 19:29:01,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1346. [2020-11-29 19:29:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1346 states. [2020-11-29 19:29:01,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1346 states to 1346 states and 1697 transitions. [2020-11-29 19:29:01,691 INFO L78 Accepts]: Start accepts. Automaton has 1346 states and 1697 transitions. Word has length 63 [2020-11-29 19:29:01,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:29:01,692 INFO L481 AbstractCegarLoop]: Abstraction has 1346 states and 1697 transitions. [2020-11-29 19:29:01,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-29 19:29:01,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1346 states and 1697 transitions. [2020-11-29 19:29:01,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-29 19:29:01,694 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:29:01,694 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] [2020-11-29 19:29:01,694 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-29 19:29:01,694 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:29:01,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:29:01,695 INFO L82 PathProgramCache]: Analyzing trace with hash -1529422068, now seen corresponding path program 1 times [2020-11-29 19:29:01,695 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:29:01,696 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106608160] [2020-11-29 19:29:01,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:29:01,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:29:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:29:01,755 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106608160] [2020-11-29 19:29:01,755 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:29:01,755 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:29:01,756 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691521192] [2020-11-29 19:29:01,756 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:29:01,756 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:29:01,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:29:01,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:29:01,757 INFO L87 Difference]: Start difference. First operand 1346 states and 1697 transitions. Second operand 3 states. [2020-11-29 19:29:02,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:29:02,048 INFO L93 Difference]: Finished difference Result 3754 states and 4725 transitions. [2020-11-29 19:29:02,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:29:02,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2020-11-29 19:29:02,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:29:02,064 INFO L225 Difference]: With dead ends: 3754 [2020-11-29 19:29:02,064 INFO L226 Difference]: Without dead ends: 2454 [2020-11-29 19:29:02,067 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:29:02,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2454 states. [2020-11-29 19:29:02,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2454 to 2426. [2020-11-29 19:29:02,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2426 states. [2020-11-29 19:29:02,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2426 states to 2426 states and 3011 transitions. [2020-11-29 19:29:02,308 INFO L78 Accepts]: Start accepts. Automaton has 2426 states and 3011 transitions. Word has length 63 [2020-11-29 19:29:02,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:29:02,309 INFO L481 AbstractCegarLoop]: Abstraction has 2426 states and 3011 transitions. [2020-11-29 19:29:02,309 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:29:02,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2426 states and 3011 transitions. [2020-11-29 19:29:02,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-29 19:29:02,311 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:29:02,311 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] [2020-11-29 19:29:02,311 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-29 19:29:02,311 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:29:02,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:29:02,312 INFO L82 PathProgramCache]: Analyzing trace with hash 1900886728, now seen corresponding path program 1 times [2020-11-29 19:29:02,312 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:29:02,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972941011] [2020-11-29 19:29:02,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:29:02,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:29:02,371 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:29:02,371 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972941011] [2020-11-29 19:29:02,372 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:29:02,372 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:29:02,372 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187949986] [2020-11-29 19:29:02,372 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:29:02,373 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:29:02,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:29:02,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:29:02,374 INFO L87 Difference]: Start difference. First operand 2426 states and 3011 transitions. Second operand 4 states. [2020-11-29 19:29:02,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:29:02,657 INFO L93 Difference]: Finished difference Result 4276 states and 5307 transitions. [2020-11-29 19:29:02,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:29:02,658 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 64 [2020-11-29 19:29:02,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:29:02,668 INFO L225 Difference]: With dead ends: 4276 [2020-11-29 19:29:02,668 INFO L226 Difference]: Without dead ends: 1875 [2020-11-29 19:29:02,672 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:29:02,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1875 states. [2020-11-29 19:29:02,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1875 to 1871. [2020-11-29 19:29:02,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1871 states. [2020-11-29 19:29:02,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2288 transitions. [2020-11-29 19:29:02,811 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2288 transitions. Word has length 64 [2020-11-29 19:29:02,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:29:02,811 INFO L481 AbstractCegarLoop]: Abstraction has 1871 states and 2288 transitions. [2020-11-29 19:29:02,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:29:02,811 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2288 transitions. [2020-11-29 19:29:02,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-29 19:29:02,813 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:29:02,813 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] [2020-11-29 19:29:02,814 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-29 19:29:02,814 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:29:02,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:29:02,814 INFO L82 PathProgramCache]: Analyzing trace with hash 1840238380, now seen corresponding path program 1 times [2020-11-29 19:29:02,814 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:29:02,815 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471370358] [2020-11-29 19:29:02,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:29:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:29:02,873 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-29 19:29:02,875 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471370358] [2020-11-29 19:29:02,875 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:29:02,875 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:29:02,876 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937067244] [2020-11-29 19:29:02,876 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:29:02,877 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:29:02,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:29:02,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:29:02,877 INFO L87 Difference]: Start difference. First operand 1871 states and 2288 transitions. Second operand 4 states. [2020-11-29 19:29:03,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:29:03,117 INFO L93 Difference]: Finished difference Result 3747 states and 4574 transitions. [2020-11-29 19:29:03,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:29:03,117 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-11-29 19:29:03,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:29:03,136 INFO L225 Difference]: With dead ends: 3747 [2020-11-29 19:29:03,136 INFO L226 Difference]: Without dead ends: 1634 [2020-11-29 19:29:03,141 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:29:03,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1634 states. [2020-11-29 19:29:03,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1634 to 1596. [2020-11-29 19:29:03,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1596 states. [2020-11-29 19:29:03,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1596 states to 1596 states and 1935 transitions. [2020-11-29 19:29:03,321 INFO L78 Accepts]: Start accepts. Automaton has 1596 states and 1935 transitions. Word has length 94 [2020-11-29 19:29:03,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:29:03,321 INFO L481 AbstractCegarLoop]: Abstraction has 1596 states and 1935 transitions. [2020-11-29 19:29:03,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:29:03,321 INFO L276 IsEmpty]: Start isEmpty. Operand 1596 states and 1935 transitions. [2020-11-29 19:29:03,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-29 19:29:03,324 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:29:03,324 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] [2020-11-29 19:29:03,324 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-29 19:29:03,325 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:29:03,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:29:03,325 INFO L82 PathProgramCache]: Analyzing trace with hash 341678357, now seen corresponding path program 1 times [2020-11-29 19:29:03,326 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:29:03,327 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109709759] [2020-11-29 19:29:03,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:29:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:29:03,400 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-29 19:29:03,400 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109709759] [2020-11-29 19:29:03,400 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:29:03,401 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:29:03,401 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033276881] [2020-11-29 19:29:03,401 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:29:03,401 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:29:03,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:29:03,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:29:03,402 INFO L87 Difference]: Start difference. First operand 1596 states and 1935 transitions. Second operand 3 states. [2020-11-29 19:29:03,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:29:03,548 INFO L93 Difference]: Finished difference Result 2909 states and 3525 transitions. [2020-11-29 19:29:03,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:29:03,549 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 94 [2020-11-29 19:29:03,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:29:03,557 INFO L225 Difference]: With dead ends: 2909 [2020-11-29 19:29:03,558 INFO L226 Difference]: Without dead ends: 1338 [2020-11-29 19:29:03,560 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:29:03,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1338 states. [2020-11-29 19:29:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1338 to 1330. [2020-11-29 19:29:03,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2020-11-29 19:29:03,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1576 transitions. [2020-11-29 19:29:03,681 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1576 transitions. Word has length 94 [2020-11-29 19:29:03,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:29:03,682 INFO L481 AbstractCegarLoop]: Abstraction has 1330 states and 1576 transitions. [2020-11-29 19:29:03,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:29:03,682 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1576 transitions. [2020-11-29 19:29:03,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-11-29 19:29:03,684 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:29:03,684 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] [2020-11-29 19:29:03,684 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-29 19:29:03,684 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:29:03,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:29:03,686 INFO L82 PathProgramCache]: Analyzing trace with hash 701412920, now seen corresponding path program 1 times [2020-11-29 19:29:03,686 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:29:03,686 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510820552] [2020-11-29 19:29:03,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:29:03,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:29:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-29 19:29:03,754 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510820552] [2020-11-29 19:29:03,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:29:03,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:29:03,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435783943] [2020-11-29 19:29:03,758 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:29:03,758 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:29:03,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:29:03,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:29:03,759 INFO L87 Difference]: Start difference. First operand 1330 states and 1576 transitions. Second operand 4 states. [2020-11-29 19:29:03,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:29:03,936 INFO L93 Difference]: Finished difference Result 2218 states and 2610 transitions. [2020-11-29 19:29:03,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-29 19:29:03,936 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 94 [2020-11-29 19:29:03,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:29:03,940 INFO L225 Difference]: With dead ends: 2218 [2020-11-29 19:29:03,940 INFO L226 Difference]: Without dead ends: 598 [2020-11-29 19:29:03,942 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-29 19:29:03,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2020-11-29 19:29:03,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 594. [2020-11-29 19:29:03,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-11-29 19:29:03,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 662 transitions. [2020-11-29 19:29:03,992 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 662 transitions. Word has length 94 [2020-11-29 19:29:03,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:29:03,992 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 662 transitions. [2020-11-29 19:29:03,992 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:29:03,992 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 662 transitions. [2020-11-29 19:29:03,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-11-29 19:29:03,996 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:29:03,997 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] [2020-11-29 19:29:03,997 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-29 19:29:03,997 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:29:03,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:29:03,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1223381222, now seen corresponding path program 1 times [2020-11-29 19:29:03,998 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:29:03,998 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978552649] [2020-11-29 19:29:03,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:29:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:29:04,162 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-11-29 19:29:04,162 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978552649] [2020-11-29 19:29:04,162 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:29:04,162 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-29 19:29:04,163 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26991271] [2020-11-29 19:29:04,163 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-29 19:29:04,163 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:29:04,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-29 19:29:04,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-29 19:29:04,164 INFO L87 Difference]: Start difference. First operand 594 states and 662 transitions. Second operand 4 states. [2020-11-29 19:29:04,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:29:04,256 INFO L93 Difference]: Finished difference Result 598 states and 666 transitions. [2020-11-29 19:29:04,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-29 19:29:04,257 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 95 [2020-11-29 19:29:04,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:29:04,261 INFO L225 Difference]: With dead ends: 598 [2020-11-29 19:29:04,261 INFO L226 Difference]: Without dead ends: 596 [2020-11-29 19:29:04,263 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 [2020-11-29 19:29:04,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2020-11-29 19:29:04,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 592. [2020-11-29 19:29:04,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 592 states. [2020-11-29 19:29:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 659 transitions. [2020-11-29 19:29:04,325 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 659 transitions. Word has length 95 [2020-11-29 19:29:04,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:29:04,325 INFO L481 AbstractCegarLoop]: Abstraction has 592 states and 659 transitions. [2020-11-29 19:29:04,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-29 19:29:04,325 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 659 transitions. [2020-11-29 19:29:04,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2020-11-29 19:29:04,327 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:29:04,327 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] [2020-11-29 19:29:04,327 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-29 19:29:04,328 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:29:04,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:29:04,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1585215284, now seen corresponding path program 1 times [2020-11-29 19:29:04,328 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:29:04,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294484346] [2020-11-29 19:29:04,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:29:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-29 19:29:04,392 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2020-11-29 19:29:04,393 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294484346] [2020-11-29 19:29:04,393 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-29 19:29:04,393 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-29 19:29:04,393 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940689220] [2020-11-29 19:29:04,395 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-29 19:29:04,395 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-29 19:29:04,396 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-29 19:29:04,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:29:04,401 INFO L87 Difference]: Start difference. First operand 592 states and 659 transitions. Second operand 3 states. [2020-11-29 19:29:04,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-29 19:29:04,517 INFO L93 Difference]: Finished difference Result 1230 states and 1372 transitions. [2020-11-29 19:29:04,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-29 19:29:04,517 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2020-11-29 19:29:04,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-29 19:29:04,522 INFO L225 Difference]: With dead ends: 1230 [2020-11-29 19:29:04,522 INFO L226 Difference]: Without dead ends: 900 [2020-11-29 19:29:04,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-29 19:29:04,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2020-11-29 19:29:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 594. [2020-11-29 19:29:04,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2020-11-29 19:29:04,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 661 transitions. [2020-11-29 19:29:04,591 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 661 transitions. Word has length 99 [2020-11-29 19:29:04,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-29 19:29:04,591 INFO L481 AbstractCegarLoop]: Abstraction has 594 states and 661 transitions. [2020-11-29 19:29:04,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-29 19:29:04,591 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 661 transitions. [2020-11-29 19:29:04,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2020-11-29 19:29:04,593 INFO L414 BasicCegarLoop]: Found error trace [2020-11-29 19:29:04,593 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] [2020-11-29 19:29:04,593 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-29 19:29:04,593 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-29 19:29:04,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-29 19:29:04,594 INFO L82 PathProgramCache]: Analyzing trace with hash 1659596600, now seen corresponding path program 1 times [2020-11-29 19:29:04,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-29 19:29:04,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417253036] [2020-11-29 19:29:04,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-29 19:29:04,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:29:04,617 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:29:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-29 19:29:04,681 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-29 19:29:04,737 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-29 19:29:04,737 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-29 19:29:04,739 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-29 19:29:04,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 07:29:04 BoogieIcfgContainer [2020-11-29 19:29:04,925 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-29 19:29:04,926 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-29 19:29:04,926 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-29 19:29:04,926 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-29 19:29:04,927 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 07:28:57" (3/4) ... [2020-11-29 19:29:04,929 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-29 19:29:05,114 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_a11e10da-cc25-4a7b-95d1-d268a367c0d9/bin/uautomizer/witness.graphml [2020-11-29 19:29:05,115 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-29 19:29:05,121 INFO L168 Benchmark]: Toolchain (without parser) took 8868.73 ms. Allocated memory was 90.2 MB in the beginning and 230.7 MB in the end (delta: 140.5 MB). Free memory was 54.6 MB in the beginning and 174.5 MB in the end (delta: -119.9 MB). Peak memory consumption was 21.6 MB. Max. memory is 16.1 GB. [2020-11-29 19:29:05,121 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 90.2 MB. Free memory is still 70.9 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-29 19:29:05,122 INFO L168 Benchmark]: CACSL2BoogieTranslator took 437.66 ms. Allocated memory is still 90.2 MB. Free memory was 54.4 MB in the beginning and 61.7 MB in the end (delta: -7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2020-11-29 19:29:05,122 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.68 ms. Allocated memory is still 90.2 MB. Free memory was 61.7 MB in the beginning and 59.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-29 19:29:05,123 INFO L168 Benchmark]: Boogie Preprocessor took 78.12 ms. Allocated memory is still 90.2 MB. Free memory was 59.0 MB in the beginning and 56.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-29 19:29:05,123 INFO L168 Benchmark]: RCFGBuilder took 1111.54 ms. Allocated memory was 90.2 MB in the beginning and 117.4 MB in the end (delta: 27.3 MB). Free memory was 56.9 MB in the beginning and 75.2 MB in the end (delta: -18.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 16.1 GB. [2020-11-29 19:29:05,124 INFO L168 Benchmark]: TraceAbstraction took 6976.22 ms. Allocated memory was 117.4 MB in the beginning and 230.7 MB in the end (delta: 113.2 MB). Free memory was 74.3 MB in the beginning and 187.1 MB in the end (delta: -112.8 MB). Peak memory consumption was 119.9 MB. Max. memory is 16.1 GB. [2020-11-29 19:29:05,124 INFO L168 Benchmark]: Witness Printer took 188.66 ms. Allocated memory is still 230.7 MB. Free memory was 187.1 MB in the beginning and 174.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2020-11-29 19:29:05,128 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.21 ms. Allocated memory is still 90.2 MB. Free memory is still 70.9 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 437.66 ms. Allocated memory is still 90.2 MB. Free memory was 54.4 MB in the beginning and 61.7 MB in the end (delta: -7.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 65.68 ms. Allocated memory is still 90.2 MB. Free memory was 61.7 MB in the beginning and 59.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 78.12 ms. Allocated memory is still 90.2 MB. Free memory was 59.0 MB in the beginning and 56.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1111.54 ms. Allocated memory was 90.2 MB in the beginning and 117.4 MB in the end (delta: 27.3 MB). Free memory was 56.9 MB in the beginning and 75.2 MB in the end (delta: -18.3 MB). Peak memory consumption was 26.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 6976.22 ms. Allocated memory was 117.4 MB in the beginning and 230.7 MB in the end (delta: 113.2 MB). Free memory was 74.3 MB in the beginning and 187.1 MB in the end (delta: -112.8 MB). Peak memory consumption was 119.9 MB. Max. memory is 16.1 GB. * Witness Printer took 188.66 ms. Allocated memory is still 230.7 MB. Free memory was 187.1 MB in the beginning and 174.5 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int 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] [L3] __assert_fail("0", "token_ring.01.cil-2.c", 3, "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, 150 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 6.7s, OverallIterations: 19, TraceHistogramMax: 3, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4021 SDtfs, 5346 SDslu, 4017 SDs, 0 SdLazy, 454 SolverSat, 166 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s 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.5s AutomataMinimizationTime, 18 MinimizatonAttempts, 1746 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.8s 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...