./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e943c265 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/bin/uautomizer-j4sWxH34Be/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/bin/uautomizer-j4sWxH34Be/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/bin/uautomizer-j4sWxH34Be/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/bin/uautomizer-j4sWxH34Be/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/bin/uautomizer-j4sWxH34Be --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 22ffb61098d8e108d7bca6506429f5e795a7ac60c8cbed943135472a4b174d52 ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1-dev-e943c26 [2021-10-21 18:59:38,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-21 18:59:38,941 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-21 18:59:38,990 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-21 18:59:38,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-21 18:59:38,995 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-21 18:59:38,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-21 18:59:38,998 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-21 18:59:39,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-21 18:59:39,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-21 18:59:39,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-21 18:59:39,003 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-21 18:59:39,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-21 18:59:39,005 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-21 18:59:39,006 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-21 18:59:39,008 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-21 18:59:39,014 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-21 18:59:39,016 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-21 18:59:39,018 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-21 18:59:39,028 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-21 18:59:39,030 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-21 18:59:39,032 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-21 18:59:39,036 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-21 18:59:39,037 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-21 18:59:39,045 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-21 18:59:39,046 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-21 18:59:39,046 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-21 18:59:39,048 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-21 18:59:39,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-21 18:59:39,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-21 18:59:39,051 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-21 18:59:39,052 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-21 18:59:39,054 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-21 18:59:39,055 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-21 18:59:39,056 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-21 18:59:39,057 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-21 18:59:39,057 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-21 18:59:39,058 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-21 18:59:39,058 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-21 18:59:39,059 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-21 18:59:39,060 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-21 18:59:39,060 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/bin/uautomizer-j4sWxH34Be/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-21 18:59:39,086 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-21 18:59:39,086 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-21 18:59:39,086 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-21 18:59:39,087 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-21 18:59:39,088 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-21 18:59:39,088 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-21 18:59:39,088 INFO L138 SettingsManager]: * Use SBE=true [2021-10-21 18:59:39,088 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-21 18:59:39,089 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-21 18:59:39,089 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-21 18:59:39,089 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-21 18:59:39,089 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-21 18:59:39,089 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-21 18:59:39,089 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-21 18:59:39,090 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-21 18:59:39,090 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-21 18:59:39,090 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-21 18:59:39,090 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-21 18:59:39,090 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-21 18:59:39,091 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-21 18:59:39,091 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-21 18:59:39,091 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-21 18:59:39,091 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 18:59:39,091 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-21 18:59:39,092 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-21 18:59:39,092 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-21 18:59:39,092 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-21 18:59:39,092 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-21 18:59:39,092 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-21 18:59:39,093 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-21 18:59:39,093 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-21 18:59:39,093 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-21 18:59:39,093 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/bin/uautomizer-j4sWxH34Be/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/bin/uautomizer-j4sWxH34Be 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 -> 22ffb61098d8e108d7bca6506429f5e795a7ac60c8cbed943135472a4b174d52 [2021-10-21 18:59:39,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-21 18:59:39,372 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-21 18:59:39,375 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-21 18:59:39,376 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-21 18:59:39,377 INFO L275 PluginConnector]: CDTParser initialized [2021-10-21 18:59:39,378 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/bin/uautomizer-j4sWxH34Be/../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2021-10-21 18:59:39,443 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/bin/uautomizer-j4sWxH34Be/data/9018fe06c/765f0ef87dec41e0b760f3827e80dd20/FLAG6bbb9f0d0 [2021-10-21 18:59:39,910 INFO L306 CDTParser]: Found 1 translation units. [2021-10-21 18:59:39,911 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2021-10-21 18:59:39,932 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/bin/uautomizer-j4sWxH34Be/data/9018fe06c/765f0ef87dec41e0b760f3827e80dd20/FLAG6bbb9f0d0 [2021-10-21 18:59:40,267 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/bin/uautomizer-j4sWxH34Be/data/9018fe06c/765f0ef87dec41e0b760f3827e80dd20 [2021-10-21 18:59:40,270 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-21 18:59:40,271 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-21 18:59:40,273 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-21 18:59:40,273 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-21 18:59:40,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-21 18:59:40,278 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 06:59:40" (1/1) ... [2021-10-21 18:59:40,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cac322d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 06:59:40, skipping insertion in model container [2021-10-21 18:59:40,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.10 06:59:40" (1/1) ... [2021-10-21 18:59:40,285 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-21 18:59:40,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-21 18:59:40,505 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[366,379] [2021-10-21 18:59:40,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 18:59:40,575 INFO L203 MainTranslator]: Completed pre-run [2021-10-21 18:59:40,590 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[366,379] [2021-10-21 18:59:40,634 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-21 18:59:40,656 INFO L208 MainTranslator]: Completed translation [2021-10-21 18:59:40,657 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 06:59:40 WrapperNode [2021-10-21 18:59:40,657 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-21 18:59:40,658 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-21 18:59:40,658 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-21 18:59:40,658 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-21 18:59:40,668 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 06:59:40" (1/1) ... [2021-10-21 18:59:40,684 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 06:59:40" (1/1) ... [2021-10-21 18:59:40,739 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-21 18:59:40,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-21 18:59:40,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-21 18:59:40,753 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-21 18:59:40,761 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 06:59:40" (1/1) ... [2021-10-21 18:59:40,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 06:59:40" (1/1) ... [2021-10-21 18:59:40,778 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 06:59:40" (1/1) ... [2021-10-21 18:59:40,792 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 06:59:40" (1/1) ... [2021-10-21 18:59:40,803 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 06:59:40" (1/1) ... [2021-10-21 18:59:40,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 06:59:40" (1/1) ... [2021-10-21 18:59:40,830 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 06:59:40" (1/1) ... [2021-10-21 18:59:40,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-21 18:59:40,837 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-21 18:59:40,837 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-21 18:59:40,837 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-21 18:59:40,850 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 06:59:40" (1/1) ... [2021-10-21 18:59:40,857 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-21 18:59:40,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/bin/uautomizer-j4sWxH34Be/z3 [2021-10-21 18:59:40,878 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-21 18:59:40,896 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-21 18:59:40,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-21 18:59:40,929 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-21 18:59:40,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-21 18:59:40,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-21 18:59:41,659 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-21 18:59:41,660 INFO L299 CfgBuilder]: Removed 105 assume(true) statements. [2021-10-21 18:59:41,662 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 06:59:41 BoogieIcfgContainer [2021-10-21 18:59:41,663 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-21 18:59:41,664 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-21 18:59:41,664 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-21 18:59:41,668 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-21 18:59:41,668 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.10 06:59:40" (1/3) ... [2021-10-21 18:59:41,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7865e5ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 06:59:41, skipping insertion in model container [2021-10-21 18:59:41,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.10 06:59:40" (2/3) ... [2021-10-21 18:59:41,669 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7865e5ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.10 06:59:41, skipping insertion in model container [2021-10-21 18:59:41,669 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 06:59:41" (3/3) ... [2021-10-21 18:59:41,671 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2021-10-21 18:59:41,676 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-21 18:59:41,678 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-21 18:59:41,745 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-21 18:59:41,753 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-21 18:59:41,754 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-21 18:59:41,780 INFO L276 IsEmpty]: Start isEmpty. Operand has 225 states, 222 states have (on average 1.5855855855855856) internal successors, (352), 224 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:41,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-21 18:59:41,791 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:41,792 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:41,792 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:41,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:41,798 INFO L82 PathProgramCache]: Analyzing trace with hash 603110903, now seen corresponding path program 1 times [2021-10-21 18:59:41,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:41,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340006850] [2021-10-21 18:59:41,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:41,835 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:41,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:42,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 18:59:42,115 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:42,116 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340006850] [2021-10-21 18:59:42,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340006850] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:42,117 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:42,117 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 18:59:42,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434355471] [2021-10-21 18:59:42,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 18:59:42,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:42,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 18:59:42,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:42,158 INFO L87 Difference]: Start difference. First operand has 225 states, 222 states have (on average 1.5855855855855856) internal successors, (352), 224 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:42,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:42,266 INFO L93 Difference]: Finished difference Result 445 states and 697 transitions. [2021-10-21 18:59:42,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 18:59:42,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-10-21 18:59:42,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:42,288 INFO L225 Difference]: With dead ends: 445 [2021-10-21 18:59:42,288 INFO L226 Difference]: Without dead ends: 221 [2021-10-21 18:59:42,293 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:42,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-10-21 18:59:42,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2021-10-21 18:59:42,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 219 states have (on average 1.5296803652968036) internal successors, (335), 220 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:42,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 335 transitions. [2021-10-21 18:59:42,374 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 335 transitions. Word has length 50 [2021-10-21 18:59:42,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:42,374 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 335 transitions. [2021-10-21 18:59:42,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:42,375 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 335 transitions. [2021-10-21 18:59:42,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-21 18:59:42,379 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:42,379 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:42,380 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-21 18:59:42,380 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:42,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:42,384 INFO L82 PathProgramCache]: Analyzing trace with hash -1325161799, now seen corresponding path program 1 times [2021-10-21 18:59:42,384 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:42,385 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889932275] [2021-10-21 18:59:42,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:42,385 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:42,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:42,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 18:59:42,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:42,485 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889932275] [2021-10-21 18:59:42,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889932275] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:42,486 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:42,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 18:59:42,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192958653] [2021-10-21 18:59:42,488 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 18:59:42,489 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:42,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 18:59:42,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:42,491 INFO L87 Difference]: Start difference. First operand 221 states and 335 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:42,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:42,566 INFO L93 Difference]: Finished difference Result 595 states and 901 transitions. [2021-10-21 18:59:42,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 18:59:42,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-10-21 18:59:42,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:42,572 INFO L225 Difference]: With dead ends: 595 [2021-10-21 18:59:42,572 INFO L226 Difference]: Without dead ends: 381 [2021-10-21 18:59:42,577 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:42,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-10-21 18:59:42,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2021-10-21 18:59:42,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 375 states have (on average 1.52) internal successors, (570), 376 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:42,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 570 transitions. [2021-10-21 18:59:42,624 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 570 transitions. Word has length 50 [2021-10-21 18:59:42,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:42,625 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 570 transitions. [2021-10-21 18:59:42,625 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:42,625 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 570 transitions. [2021-10-21 18:59:42,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-21 18:59:42,630 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:42,630 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:42,631 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-21 18:59:42,632 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:42,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:42,642 INFO L82 PathProgramCache]: Analyzing trace with hash 102769205, now seen corresponding path program 1 times [2021-10-21 18:59:42,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:42,643 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675642030] [2021-10-21 18:59:42,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:42,643 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:42,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 18:59:42,711 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:42,712 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675642030] [2021-10-21 18:59:42,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675642030] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:42,716 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:42,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 18:59:42,720 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237212145] [2021-10-21 18:59:42,721 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 18:59:42,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:42,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 18:59:42,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:42,723 INFO L87 Difference]: Start difference. First operand 377 states and 570 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:42,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:42,774 INFO L93 Difference]: Finished difference Result 746 states and 1129 transitions. [2021-10-21 18:59:42,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 18:59:42,774 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-10-21 18:59:42,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:42,777 INFO L225 Difference]: With dead ends: 746 [2021-10-21 18:59:42,777 INFO L226 Difference]: Without dead ends: 377 [2021-10-21 18:59:42,778 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:42,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-10-21 18:59:42,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2021-10-21 18:59:42,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 375 states have (on average 1.4986666666666666) internal successors, (562), 376 states have internal predecessors, (562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:42,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 562 transitions. [2021-10-21 18:59:42,804 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 562 transitions. Word has length 50 [2021-10-21 18:59:42,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:42,804 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 562 transitions. [2021-10-21 18:59:42,804 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:42,805 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 562 transitions. [2021-10-21 18:59:42,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-21 18:59:42,806 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:42,806 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:42,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-21 18:59:42,806 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:42,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:42,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1811399481, now seen corresponding path program 1 times [2021-10-21 18:59:42,807 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:42,807 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155204489] [2021-10-21 18:59:42,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:42,808 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 18:59:42,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:42,872 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155204489] [2021-10-21 18:59:42,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155204489] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:42,872 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:42,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 18:59:42,873 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903105867] [2021-10-21 18:59:42,873 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 18:59:42,873 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:42,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 18:59:42,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:42,875 INFO L87 Difference]: Start difference. First operand 377 states and 562 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:42,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:42,905 INFO L93 Difference]: Finished difference Result 745 states and 1112 transitions. [2021-10-21 18:59:42,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 18:59:42,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-10-21 18:59:42,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:42,908 INFO L225 Difference]: With dead ends: 745 [2021-10-21 18:59:42,909 INFO L226 Difference]: Without dead ends: 377 [2021-10-21 18:59:42,910 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:42,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-10-21 18:59:42,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2021-10-21 18:59:42,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 375 states have (on average 1.4773333333333334) internal successors, (554), 376 states have internal predecessors, (554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:42,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 554 transitions. [2021-10-21 18:59:42,930 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 554 transitions. Word has length 50 [2021-10-21 18:59:42,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:42,931 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 554 transitions. [2021-10-21 18:59:42,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:42,931 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 554 transitions. [2021-10-21 18:59:42,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-21 18:59:42,932 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:42,933 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:42,933 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-21 18:59:42,933 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:42,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:42,934 INFO L82 PathProgramCache]: Analyzing trace with hash 65401269, now seen corresponding path program 1 times [2021-10-21 18:59:42,934 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:42,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800773492] [2021-10-21 18:59:42,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:42,935 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:42,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:42,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 18:59:42,992 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:42,993 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800773492] [2021-10-21 18:59:42,993 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800773492] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:42,993 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:42,993 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 18:59:42,994 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467555721] [2021-10-21 18:59:42,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 18:59:42,994 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:42,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 18:59:42,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:42,995 INFO L87 Difference]: Start difference. First operand 377 states and 554 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:43,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:43,064 INFO L93 Difference]: Finished difference Result 744 states and 1095 transitions. [2021-10-21 18:59:43,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 18:59:43,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-10-21 18:59:43,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:43,069 INFO L225 Difference]: With dead ends: 744 [2021-10-21 18:59:43,069 INFO L226 Difference]: Without dead ends: 377 [2021-10-21 18:59:43,070 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:43,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-10-21 18:59:43,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2021-10-21 18:59:43,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 375 states have (on average 1.4346666666666668) internal successors, (538), 376 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:43,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 538 transitions. [2021-10-21 18:59:43,098 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 538 transitions. Word has length 50 [2021-10-21 18:59:43,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:43,100 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 538 transitions. [2021-10-21 18:59:43,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:43,100 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 538 transitions. [2021-10-21 18:59:43,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-21 18:59:43,102 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:43,103 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:43,103 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-21 18:59:43,103 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:43,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:43,104 INFO L82 PathProgramCache]: Analyzing trace with hash 25960058, now seen corresponding path program 1 times [2021-10-21 18:59:43,104 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:43,105 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1824072218] [2021-10-21 18:59:43,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:43,105 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:43,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:43,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 18:59:43,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:43,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1824072218] [2021-10-21 18:59:43,199 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1824072218] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:43,199 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:43,199 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 18:59:43,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [537009449] [2021-10-21 18:59:43,203 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 18:59:43,203 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:43,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 18:59:43,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 18:59:43,204 INFO L87 Difference]: Start difference. First operand 377 states and 538 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:43,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:43,342 INFO L93 Difference]: Finished difference Result 998 states and 1431 transitions. [2021-10-21 18:59:43,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 18:59:43,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-10-21 18:59:43,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:43,355 INFO L225 Difference]: With dead ends: 998 [2021-10-21 18:59:43,355 INFO L226 Difference]: Without dead ends: 632 [2021-10-21 18:59:43,356 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 18:59:43,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2021-10-21 18:59:43,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 377. [2021-10-21 18:59:43,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 375 states have (on average 1.4266666666666667) internal successors, (535), 376 states have internal predecessors, (535), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:43,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 535 transitions. [2021-10-21 18:59:43,389 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 535 transitions. Word has length 50 [2021-10-21 18:59:43,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:43,390 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 535 transitions. [2021-10-21 18:59:43,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:43,390 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 535 transitions. [2021-10-21 18:59:43,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-21 18:59:43,391 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:43,391 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:43,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-21 18:59:43,392 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:43,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:43,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1345847240, now seen corresponding path program 1 times [2021-10-21 18:59:43,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:43,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112060011] [2021-10-21 18:59:43,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:43,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:43,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 18:59:43,456 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:43,456 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112060011] [2021-10-21 18:59:43,456 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112060011] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:43,456 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:43,457 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 18:59:43,457 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029374809] [2021-10-21 18:59:43,457 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 18:59:43,457 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:43,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 18:59:43,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:43,458 INFO L87 Difference]: Start difference. First operand 377 states and 535 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:43,519 INFO L93 Difference]: Finished difference Result 742 states and 1055 transitions. [2021-10-21 18:59:43,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 18:59:43,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-10-21 18:59:43,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:43,522 INFO L225 Difference]: With dead ends: 742 [2021-10-21 18:59:43,522 INFO L226 Difference]: Without dead ends: 377 [2021-10-21 18:59:43,523 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:43,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-10-21 18:59:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2021-10-21 18:59:43,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 375 states have (on average 1.384) internal successors, (519), 376 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:43,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 519 transitions. [2021-10-21 18:59:43,551 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 519 transitions. Word has length 50 [2021-10-21 18:59:43,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:43,551 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 519 transitions. [2021-10-21 18:59:43,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 519 transitions. [2021-10-21 18:59:43,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-21 18:59:43,552 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:43,552 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:43,552 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-21 18:59:43,552 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:43,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:43,553 INFO L82 PathProgramCache]: Analyzing trace with hash -176110788, now seen corresponding path program 1 times [2021-10-21 18:59:43,553 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:43,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436912942] [2021-10-21 18:59:43,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:43,554 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:43,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:43,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 18:59:43,638 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:43,639 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436912942] [2021-10-21 18:59:43,639 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436912942] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:43,639 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:43,639 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 18:59:43,639 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038090633] [2021-10-21 18:59:43,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 18:59:43,640 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:43,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 18:59:43,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 18:59:43,641 INFO L87 Difference]: Start difference. First operand 377 states and 519 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:43,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:43,765 INFO L93 Difference]: Finished difference Result 981 states and 1369 transitions. [2021-10-21 18:59:43,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 18:59:43,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-10-21 18:59:43,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:43,776 INFO L225 Difference]: With dead ends: 981 [2021-10-21 18:59:43,777 INFO L226 Difference]: Without dead ends: 623 [2021-10-21 18:59:43,777 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-21 18:59:43,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2021-10-21 18:59:43,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 383. [2021-10-21 18:59:43,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 381 states have (on average 1.356955380577428) internal successors, (517), 382 states have internal predecessors, (517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:43,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 517 transitions. [2021-10-21 18:59:43,817 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 517 transitions. Word has length 50 [2021-10-21 18:59:43,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:43,818 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 517 transitions. [2021-10-21 18:59:43,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:43,818 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 517 transitions. [2021-10-21 18:59:43,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-21 18:59:43,819 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:43,819 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:43,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-21 18:59:43,819 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:43,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:43,820 INFO L82 PathProgramCache]: Analyzing trace with hash -248497346, now seen corresponding path program 1 times [2021-10-21 18:59:43,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:43,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785840681] [2021-10-21 18:59:43,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:43,820 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:43,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 18:59:43,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:43,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785840681] [2021-10-21 18:59:43,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785840681] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:43,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:43,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 18:59:43,877 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111014429] [2021-10-21 18:59:43,878 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 18:59:43,878 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:43,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 18:59:43,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 18:59:43,879 INFO L87 Difference]: Start difference. First operand 383 states and 517 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:44,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:44,056 INFO L93 Difference]: Finished difference Result 1331 states and 1797 transitions. [2021-10-21 18:59:44,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-21 18:59:44,057 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2021-10-21 18:59:44,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:44,063 INFO L225 Difference]: With dead ends: 1331 [2021-10-21 18:59:44,063 INFO L226 Difference]: Without dead ends: 962 [2021-10-21 18:59:44,066 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 18:59:44,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-10-21 18:59:44,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 886. [2021-10-21 18:59:44,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 886 states, 884 states have (on average 1.332579185520362) internal successors, (1178), 885 states have internal predecessors, (1178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:44,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1178 transitions. [2021-10-21 18:59:44,151 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1178 transitions. Word has length 50 [2021-10-21 18:59:44,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:44,154 INFO L470 AbstractCegarLoop]: Abstraction has 886 states and 1178 transitions. [2021-10-21 18:59:44,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 3 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:44,154 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1178 transitions. [2021-10-21 18:59:44,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-21 18:59:44,155 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:44,155 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:44,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-21 18:59:44,156 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:44,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:44,156 INFO L82 PathProgramCache]: Analyzing trace with hash -170072379, now seen corresponding path program 1 times [2021-10-21 18:59:44,157 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:44,158 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942489257] [2021-10-21 18:59:44,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:44,159 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:44,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:44,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-10-21 18:59:44,231 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:44,231 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942489257] [2021-10-21 18:59:44,231 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942489257] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:44,231 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:44,231 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 18:59:44,232 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815747033] [2021-10-21 18:59:44,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 18:59:44,232 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:44,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 18:59:44,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 18:59:44,233 INFO L87 Difference]: Start difference. First operand 886 states and 1178 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:44,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:44,455 INFO L93 Difference]: Finished difference Result 2286 states and 3059 transitions. [2021-10-21 18:59:44,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 18:59:44,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-10-21 18:59:44,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:44,465 INFO L225 Difference]: With dead ends: 2286 [2021-10-21 18:59:44,465 INFO L226 Difference]: Without dead ends: 1424 [2021-10-21 18:59:44,467 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-21 18:59:44,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2021-10-21 18:59:44,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 913. [2021-10-21 18:59:44,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 911 states have (on average 1.3084522502744238) internal successors, (1192), 912 states have internal predecessors, (1192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:44,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1192 transitions. [2021-10-21 18:59:44,552 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1192 transitions. Word has length 63 [2021-10-21 18:59:44,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:44,553 INFO L470 AbstractCegarLoop]: Abstraction has 913 states and 1192 transitions. [2021-10-21 18:59:44,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1192 transitions. [2021-10-21 18:59:44,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-21 18:59:44,555 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:44,555 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:44,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-21 18:59:44,555 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:44,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:44,556 INFO L82 PathProgramCache]: Analyzing trace with hash -1541879677, now seen corresponding path program 1 times [2021-10-21 18:59:44,556 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:44,558 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671461591] [2021-10-21 18:59:44,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:44,559 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:44,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:44,614 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 18:59:44,614 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:44,614 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671461591] [2021-10-21 18:59:44,614 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671461591] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:44,615 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:44,615 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 18:59:44,615 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902316435] [2021-10-21 18:59:44,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 18:59:44,615 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:44,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 18:59:44,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:44,617 INFO L87 Difference]: Start difference. First operand 913 states and 1192 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:44,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:44,769 INFO L93 Difference]: Finished difference Result 2514 states and 3253 transitions. [2021-10-21 18:59:44,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 18:59:44,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 63 [2021-10-21 18:59:44,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:44,779 INFO L225 Difference]: With dead ends: 2514 [2021-10-21 18:59:44,779 INFO L226 Difference]: Without dead ends: 1638 [2021-10-21 18:59:44,783 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:44,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2021-10-21 18:59:44,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1638. [2021-10-21 18:59:44,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1638 states, 1636 states have (on average 1.2707823960880196) internal successors, (2079), 1637 states have internal predecessors, (2079), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2079 transitions. [2021-10-21 18:59:44,923 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2079 transitions. Word has length 63 [2021-10-21 18:59:44,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:44,924 INFO L470 AbstractCegarLoop]: Abstraction has 1638 states and 2079 transitions. [2021-10-21 18:59:44,924 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:44,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2079 transitions. [2021-10-21 18:59:44,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-21 18:59:44,929 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:44,929 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:44,929 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-21 18:59:44,930 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:44,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:44,930 INFO L82 PathProgramCache]: Analyzing trace with hash -443703688, now seen corresponding path program 1 times [2021-10-21 18:59:44,930 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:44,931 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835763642] [2021-10-21 18:59:44,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:44,931 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:44,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:44,981 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 18:59:44,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:44,981 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835763642] [2021-10-21 18:59:44,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835763642] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:44,983 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:44,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 18:59:44,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033026712] [2021-10-21 18:59:44,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 18:59:44,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:44,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 18:59:44,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:44,985 INFO L87 Difference]: Start difference. First operand 1638 states and 2079 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:45,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:45,238 INFO L93 Difference]: Finished difference Result 4524 states and 5739 transitions. [2021-10-21 18:59:45,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 18:59:45,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-10-21 18:59:45,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:45,254 INFO L225 Difference]: With dead ends: 4524 [2021-10-21 18:59:45,254 INFO L226 Difference]: Without dead ends: 2956 [2021-10-21 18:59:45,257 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:45,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2021-10-21 18:59:45,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2916. [2021-10-21 18:59:45,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2914 states have (on average 1.259780370624571) internal successors, (3671), 2915 states have internal predecessors, (3671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:45,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 3671 transitions. [2021-10-21 18:59:45,584 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 3671 transitions. Word has length 64 [2021-10-21 18:59:45,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:45,584 INFO L470 AbstractCegarLoop]: Abstraction has 2916 states and 3671 transitions. [2021-10-21 18:59:45,584 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:45,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 3671 transitions. [2021-10-21 18:59:45,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-21 18:59:45,587 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:45,587 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:45,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-21 18:59:45,588 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:45,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:45,588 INFO L82 PathProgramCache]: Analyzing trace with hash 116996090, now seen corresponding path program 1 times [2021-10-21 18:59:45,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:45,589 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035455600] [2021-10-21 18:59:45,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:45,589 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:45,615 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-21 18:59:45,615 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:45,616 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035455600] [2021-10-21 18:59:45,616 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035455600] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:45,616 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:45,616 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 18:59:45,617 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076692379] [2021-10-21 18:59:45,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 18:59:45,617 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:45,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 18:59:45,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:45,619 INFO L87 Difference]: Start difference. First operand 2916 states and 3671 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:45,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:45,878 INFO L93 Difference]: Finished difference Result 5712 states and 7209 transitions. [2021-10-21 18:59:45,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 18:59:45,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2021-10-21 18:59:45,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:45,894 INFO L225 Difference]: With dead ends: 5712 [2021-10-21 18:59:45,894 INFO L226 Difference]: Without dead ends: 2854 [2021-10-21 18:59:45,898 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:45,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2021-10-21 18:59:46,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2854. [2021-10-21 18:59:46,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2854 states, 2852 states have (on average 1.2626227208976157) internal successors, (3601), 2853 states have internal predecessors, (3601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:46,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 3601 transitions. [2021-10-21 18:59:46,135 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 3601 transitions. Word has length 64 [2021-10-21 18:59:46,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:46,135 INFO L470 AbstractCegarLoop]: Abstraction has 2854 states and 3601 transitions. [2021-10-21 18:59:46,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:46,136 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3601 transitions. [2021-10-21 18:59:46,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-21 18:59:46,137 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:46,137 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:46,137 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-21 18:59:46,138 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:46,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:46,138 INFO L82 PathProgramCache]: Analyzing trace with hash 2104278287, now seen corresponding path program 1 times [2021-10-21 18:59:46,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:46,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509415200] [2021-10-21 18:59:46,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:46,139 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:46,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:46,184 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-21 18:59:46,184 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:46,184 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509415200] [2021-10-21 18:59:46,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509415200] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:46,185 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:46,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 18:59:46,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166737923] [2021-10-21 18:59:46,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 18:59:46,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:46,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 18:59:46,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:46,187 INFO L87 Difference]: Start difference. First operand 2854 states and 3601 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:46,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:46,565 INFO L93 Difference]: Finished difference Result 6838 states and 8679 transitions. [2021-10-21 18:59:46,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 18:59:46,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2021-10-21 18:59:46,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:46,592 INFO L225 Difference]: With dead ends: 6838 [2021-10-21 18:59:46,592 INFO L226 Difference]: Without dead ends: 4770 [2021-10-21 18:59:46,597 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:46,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4770 states. [2021-10-21 18:59:46,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4770 to 3882. [2021-10-21 18:59:46,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3882 states, 3880 states have (on average 1.2626288659793814) internal successors, (4899), 3881 states have internal predecessors, (4899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:46,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3882 states to 3882 states and 4899 transitions. [2021-10-21 18:59:46,922 INFO L78 Accepts]: Start accepts. Automaton has 3882 states and 4899 transitions. Word has length 65 [2021-10-21 18:59:46,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:46,923 INFO L470 AbstractCegarLoop]: Abstraction has 3882 states and 4899 transitions. [2021-10-21 18:59:46,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 2 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 3882 states and 4899 transitions. [2021-10-21 18:59:46,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-10-21 18:59:46,926 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:46,926 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:46,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-21 18:59:46,927 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:46,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:46,927 INFO L82 PathProgramCache]: Analyzing trace with hash 23144866, now seen corresponding path program 1 times [2021-10-21 18:59:46,928 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:46,928 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080103440] [2021-10-21 18:59:46,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:46,928 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 18:59:47,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:47,012 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080103440] [2021-10-21 18:59:47,012 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080103440] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:47,012 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:47,012 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 18:59:47,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955742633] [2021-10-21 18:59:47,013 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 18:59:47,013 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:47,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 18:59:47,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 18:59:47,014 INFO L87 Difference]: Start difference. First operand 3882 states and 4899 transitions. Second operand has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:47,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:47,478 INFO L93 Difference]: Finished difference Result 9686 states and 12267 transitions. [2021-10-21 18:59:47,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-21 18:59:47,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-10-21 18:59:47,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:47,509 INFO L225 Difference]: With dead ends: 9686 [2021-10-21 18:59:47,509 INFO L226 Difference]: Without dead ends: 5862 [2021-10-21 18:59:47,517 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 22.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-21 18:59:47,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5862 states. [2021-10-21 18:59:47,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5862 to 3930. [2021-10-21 18:59:47,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3930 states, 3928 states have (on average 1.2405804480651732) internal successors, (4873), 3929 states have internal predecessors, (4873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:47,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3930 states to 3930 states and 4873 transitions. [2021-10-21 18:59:47,873 INFO L78 Accepts]: Start accepts. Automaton has 3930 states and 4873 transitions. Word has length 82 [2021-10-21 18:59:47,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:47,873 INFO L470 AbstractCegarLoop]: Abstraction has 3930 states and 4873 transitions. [2021-10-21 18:59:47,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.4) internal successors, (82), 5 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:47,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3930 states and 4873 transitions. [2021-10-21 18:59:47,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-10-21 18:59:47,876 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:47,876 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:47,877 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-21 18:59:47,877 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:47,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:47,877 INFO L82 PathProgramCache]: Analyzing trace with hash -1565203036, now seen corresponding path program 1 times [2021-10-21 18:59:47,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:47,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352171480] [2021-10-21 18:59:47,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:47,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:47,935 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 18:59:47,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:47,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352171480] [2021-10-21 18:59:47,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352171480] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:47,938 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:47,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 18:59:47,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638267914] [2021-10-21 18:59:47,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 18:59:47,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:47,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 18:59:47,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:47,940 INFO L87 Difference]: Start difference. First operand 3930 states and 4873 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:48,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:48,524 INFO L93 Difference]: Finished difference Result 11242 states and 13901 transitions. [2021-10-21 18:59:48,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 18:59:48,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2021-10-21 18:59:48,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:48,561 INFO L225 Difference]: With dead ends: 11242 [2021-10-21 18:59:48,561 INFO L226 Difference]: Without dead ends: 7382 [2021-10-21 18:59:48,568 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:48,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2021-10-21 18:59:49,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7170. [2021-10-21 18:59:49,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7170 states, 7168 states have (on average 1.2227957589285714) internal successors, (8765), 7169 states have internal predecessors, (8765), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:49,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 8765 transitions. [2021-10-21 18:59:49,139 INFO L78 Accepts]: Start accepts. Automaton has 7170 states and 8765 transitions. Word has length 82 [2021-10-21 18:59:49,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:49,139 INFO L470 AbstractCegarLoop]: Abstraction has 7170 states and 8765 transitions. [2021-10-21 18:59:49,140 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:49,140 INFO L276 IsEmpty]: Start isEmpty. Operand 7170 states and 8765 transitions. [2021-10-21 18:59:49,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-10-21 18:59:49,143 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:49,143 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:49,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-21 18:59:49,144 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:49,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:49,144 INFO L82 PathProgramCache]: Analyzing trace with hash 794948131, now seen corresponding path program 1 times [2021-10-21 18:59:49,145 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:49,145 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163564436] [2021-10-21 18:59:49,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:49,145 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:49,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:49,179 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 18:59:49,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:49,179 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163564436] [2021-10-21 18:59:49,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163564436] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:49,179 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:49,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 18:59:49,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6312166] [2021-10-21 18:59:49,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 18:59:49,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:49,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 18:59:49,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 18:59:49,181 INFO L87 Difference]: Start difference. First operand 7170 states and 8765 transitions. Second operand has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:49,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:49,742 INFO L93 Difference]: Finished difference Result 12642 states and 15459 transitions. [2021-10-21 18:59:49,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 18:59:49,742 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-10-21 18:59:49,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:49,754 INFO L225 Difference]: With dead ends: 12642 [2021-10-21 18:59:49,755 INFO L226 Difference]: Without dead ends: 5509 [2021-10-21 18:59:49,764 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 18:59:49,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2021-10-21 18:59:50,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 5509. [2021-10-21 18:59:50,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5509 states, 5507 states have (on average 1.211004176502633) internal successors, (6669), 5508 states have internal predecessors, (6669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:50,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 6669 transitions. [2021-10-21 18:59:50,188 INFO L78 Accepts]: Start accepts. Automaton has 5509 states and 6669 transitions. Word has length 83 [2021-10-21 18:59:50,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:50,188 INFO L470 AbstractCegarLoop]: Abstraction has 5509 states and 6669 transitions. [2021-10-21 18:59:50,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.75) internal successors, (83), 4 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:50,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5509 states and 6669 transitions. [2021-10-21 18:59:50,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-10-21 18:59:50,194 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:50,194 INFO L512 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:50,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-21 18:59:50,194 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:50,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:50,195 INFO L82 PathProgramCache]: Analyzing trace with hash -471564153, now seen corresponding path program 1 times [2021-10-21 18:59:50,195 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:50,195 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441984350] [2021-10-21 18:59:50,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:50,195 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:50,229 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 18:59:50,229 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:50,230 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441984350] [2021-10-21 18:59:50,230 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441984350] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:50,230 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:50,230 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-21 18:59:50,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946811467] [2021-10-21 18:59:50,231 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 18:59:50,231 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:50,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 18:59:50,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:50,232 INFO L87 Difference]: Start difference. First operand 5509 states and 6669 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:50,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:50,813 INFO L93 Difference]: Finished difference Result 12613 states and 15226 transitions. [2021-10-21 18:59:50,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 18:59:50,814 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2021-10-21 18:59:50,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:50,830 INFO L225 Difference]: With dead ends: 12613 [2021-10-21 18:59:50,830 INFO L226 Difference]: Without dead ends: 7130 [2021-10-21 18:59:50,839 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:50,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7130 states. [2021-10-21 18:59:51,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7130 to 7082. [2021-10-21 18:59:51,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7082 states, 7080 states have (on average 1.1981638418079097) internal successors, (8483), 7081 states have internal predecessors, (8483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:51,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 8483 transitions. [2021-10-21 18:59:51,379 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 8483 transitions. Word has length 106 [2021-10-21 18:59:51,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:51,379 INFO L470 AbstractCegarLoop]: Abstraction has 7082 states and 8483 transitions. [2021-10-21 18:59:51,380 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 2 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:51,380 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 8483 transitions. [2021-10-21 18:59:51,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-10-21 18:59:51,388 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:51,388 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:51,388 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-21 18:59:51,389 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:51,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:51,389 INFO L82 PathProgramCache]: Analyzing trace with hash 1818985301, now seen corresponding path program 1 times [2021-10-21 18:59:51,389 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:51,390 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592669780] [2021-10-21 18:59:51,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:51,390 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:51,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:51,426 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 18:59:51,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:51,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592669780] [2021-10-21 18:59:51,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592669780] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:51,427 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:51,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 18:59:51,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233845203] [2021-10-21 18:59:51,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 18:59:51,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:51,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 18:59:51,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:51,429 INFO L87 Difference]: Start difference. First operand 7082 states and 8483 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:51,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:51,867 INFO L93 Difference]: Finished difference Result 12586 states and 15145 transitions. [2021-10-21 18:59:51,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 18:59:51,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2021-10-21 18:59:51,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:51,882 INFO L225 Difference]: With dead ends: 12586 [2021-10-21 18:59:51,882 INFO L226 Difference]: Without dead ends: 7114 [2021-10-21 18:59:51,891 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:51,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7114 states. [2021-10-21 18:59:52,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7114 to 7082. [2021-10-21 18:59:52,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7082 states, 7080 states have (on average 1.1738700564971751) internal successors, (8311), 7081 states have internal predecessors, (8311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:52,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 8311 transitions. [2021-10-21 18:59:52,385 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 8311 transitions. Word has length 121 [2021-10-21 18:59:52,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:52,386 INFO L470 AbstractCegarLoop]: Abstraction has 7082 states and 8311 transitions. [2021-10-21 18:59:52,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:52,386 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 8311 transitions. [2021-10-21 18:59:52,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-10-21 18:59:52,393 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:52,393 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:52,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-21 18:59:52,393 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:52,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:52,394 INFO L82 PathProgramCache]: Analyzing trace with hash -654472485, now seen corresponding path program 1 times [2021-10-21 18:59:52,394 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:52,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714494935] [2021-10-21 18:59:52,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:52,395 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:52,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:52,446 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 18:59:52,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:52,447 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714494935] [2021-10-21 18:59:52,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714494935] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:52,447 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:52,447 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 18:59:52,447 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456466493] [2021-10-21 18:59:52,448 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 18:59:52,448 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:52,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 18:59:52,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 18:59:52,449 INFO L87 Difference]: Start difference. First operand 7082 states and 8311 transitions. Second operand has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:52,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:52,939 INFO L93 Difference]: Finished difference Result 12558 states and 14771 transitions. [2021-10-21 18:59:52,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 18:59:52,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 122 [2021-10-21 18:59:52,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:52,953 INFO L225 Difference]: With dead ends: 12558 [2021-10-21 18:59:52,953 INFO L226 Difference]: Without dead ends: 7086 [2021-10-21 18:59:52,960 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 18:59:52,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7086 states. [2021-10-21 18:59:53,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7086 to 7082. [2021-10-21 18:59:53,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7082 states, 7080 states have (on average 1.1687853107344632) internal successors, (8275), 7081 states have internal predecessors, (8275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:53,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 8275 transitions. [2021-10-21 18:59:53,382 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 8275 transitions. Word has length 122 [2021-10-21 18:59:53,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:53,383 INFO L470 AbstractCegarLoop]: Abstraction has 7082 states and 8275 transitions. [2021-10-21 18:59:53,383 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 30.5) internal successors, (122), 4 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:53,383 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 8275 transitions. [2021-10-21 18:59:53,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-10-21 18:59:53,392 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:53,392 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:53,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-21 18:59:53,393 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:53,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:53,393 INFO L82 PathProgramCache]: Analyzing trace with hash -956339995, now seen corresponding path program 1 times [2021-10-21 18:59:53,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:53,394 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747373938] [2021-10-21 18:59:53,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:53,394 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-10-21 18:59:53,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:53,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747373938] [2021-10-21 18:59:53,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747373938] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:53,445 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:53,445 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 18:59:53,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545659640] [2021-10-21 18:59:53,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 18:59:53,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:53,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 18:59:53,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 18:59:53,446 INFO L87 Difference]: Start difference. First operand 7082 states and 8275 transitions. Second operand has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:53,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:53,913 INFO L93 Difference]: Finished difference Result 14324 states and 16731 transitions. [2021-10-21 18:59:53,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 18:59:53,913 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 148 [2021-10-21 18:59:53,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:53,923 INFO L225 Difference]: With dead ends: 14324 [2021-10-21 18:59:53,924 INFO L226 Difference]: Without dead ends: 6484 [2021-10-21 18:59:53,933 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 18:59:53,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6484 states. [2021-10-21 18:59:54,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6484 to 6280. [2021-10-21 18:59:54,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6280 states, 6278 states have (on average 1.1621535520866517) internal successors, (7296), 6279 states have internal predecessors, (7296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:54,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 7296 transitions. [2021-10-21 18:59:54,392 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 7296 transitions. Word has length 148 [2021-10-21 18:59:54,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:54,393 INFO L470 AbstractCegarLoop]: Abstraction has 6280 states and 7296 transitions. [2021-10-21 18:59:54,393 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.25) internal successors, (145), 4 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:54,393 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 7296 transitions. [2021-10-21 18:59:54,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-10-21 18:59:54,399 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:54,399 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:54,399 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-21 18:59:54,400 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:54,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:54,400 INFO L82 PathProgramCache]: Analyzing trace with hash 199848580, now seen corresponding path program 1 times [2021-10-21 18:59:54,400 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:54,400 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230003875] [2021-10-21 18:59:54,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:54,401 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:54,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:54,433 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-21 18:59:54,434 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:54,434 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230003875] [2021-10-21 18:59:54,434 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230003875] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:54,434 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:54,434 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 18:59:54,435 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088604820] [2021-10-21 18:59:54,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 18:59:54,435 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:54,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 18:59:54,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:54,436 INFO L87 Difference]: Start difference. First operand 6280 states and 7296 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:55,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:55,000 INFO L93 Difference]: Finished difference Result 10747 states and 12514 transitions. [2021-10-21 18:59:55,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 18:59:55,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 149 [2021-10-21 18:59:55,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:55,014 INFO L225 Difference]: With dead ends: 10747 [2021-10-21 18:59:55,014 INFO L226 Difference]: Without dead ends: 6564 [2021-10-21 18:59:55,021 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6564 states. [2021-10-21 18:59:55,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6564 to 6280. [2021-10-21 18:59:55,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6280 states, 6278 states have (on average 1.1430391844536476) internal successors, (7176), 6279 states have internal predecessors, (7176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:55,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 7176 transitions. [2021-10-21 18:59:55,474 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 7176 transitions. Word has length 149 [2021-10-21 18:59:55,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:55,474 INFO L470 AbstractCegarLoop]: Abstraction has 6280 states and 7176 transitions. [2021-10-21 18:59:55,475 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:55,475 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 7176 transitions. [2021-10-21 18:59:55,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-10-21 18:59:55,482 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:55,482 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:55,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-21 18:59:55,483 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:55,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:55,483 INFO L82 PathProgramCache]: Analyzing trace with hash 965086109, now seen corresponding path program 1 times [2021-10-21 18:59:55,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:55,484 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181400610] [2021-10-21 18:59:55,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:55,484 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:55,531 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-21 18:59:55,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:55,532 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181400610] [2021-10-21 18:59:55,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181400610] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:55,532 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:55,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-21 18:59:55,532 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900294934] [2021-10-21 18:59:55,533 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-21 18:59:55,533 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:55,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-21 18:59:55,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-21 18:59:55,534 INFO L87 Difference]: Start difference. First operand 6280 states and 7176 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:55,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:55,908 INFO L93 Difference]: Finished difference Result 9034 states and 10245 transitions. [2021-10-21 18:59:55,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 18:59:55,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2021-10-21 18:59:55,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:55,913 INFO L225 Difference]: With dead ends: 9034 [2021-10-21 18:59:55,913 INFO L226 Difference]: Without dead ends: 1873 [2021-10-21 18:59:55,923 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-21 18:59:55,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2021-10-21 18:59:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1873. [2021-10-21 18:59:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1871 states have (on average 1.076429716729022) internal successors, (2014), 1872 states have internal predecessors, (2014), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2014 transitions. [2021-10-21 18:59:56,054 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2014 transitions. Word has length 150 [2021-10-21 18:59:56,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:56,054 INFO L470 AbstractCegarLoop]: Abstraction has 1873 states and 2014 transitions. [2021-10-21 18:59:56,055 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:56,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2014 transitions. [2021-10-21 18:59:56,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-10-21 18:59:56,058 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:56,059 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:56,059 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-21 18:59:56,059 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:56,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:56,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1275276035, now seen corresponding path program 1 times [2021-10-21 18:59:56,060 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:56,060 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146025069] [2021-10-21 18:59:56,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:56,061 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:56,101 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-21 18:59:56,101 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:56,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146025069] [2021-10-21 18:59:56,101 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146025069] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:56,101 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:56,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 18:59:56,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235294682] [2021-10-21 18:59:56,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 18:59:56,102 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:56,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 18:59:56,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:56,103 INFO L87 Difference]: Start difference. First operand 1873 states and 2014 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:56,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:56,263 INFO L93 Difference]: Finished difference Result 2511 states and 2705 transitions. [2021-10-21 18:59:56,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 18:59:56,264 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2021-10-21 18:59:56,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:56,267 INFO L225 Difference]: With dead ends: 2511 [2021-10-21 18:59:56,267 INFO L226 Difference]: Without dead ends: 1507 [2021-10-21 18:59:56,269 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:56,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2021-10-21 18:59:56,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2021-10-21 18:59:56,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1505 states have (on average 1.0717607973421928) internal successors, (1613), 1506 states have internal predecessors, (1613), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:56,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1613 transitions. [2021-10-21 18:59:56,411 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1613 transitions. Word has length 150 [2021-10-21 18:59:56,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:56,412 INFO L470 AbstractCegarLoop]: Abstraction has 1507 states and 1613 transitions. [2021-10-21 18:59:56,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:56,412 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1613 transitions. [2021-10-21 18:59:56,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-10-21 18:59:56,415 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:56,416 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:56,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-21 18:59:56,416 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:56,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:56,417 INFO L82 PathProgramCache]: Analyzing trace with hash -660923245, now seen corresponding path program 1 times [2021-10-21 18:59:56,417 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:56,417 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082844788] [2021-10-21 18:59:56,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:56,417 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:56,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2021-10-21 18:59:56,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:56,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082844788] [2021-10-21 18:59:56,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082844788] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:56,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:56,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-21 18:59:56,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691868796] [2021-10-21 18:59:56,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-21 18:59:56,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:56,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-21 18:59:56,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 18:59:56,570 INFO L87 Difference]: Start difference. First operand 1507 states and 1613 transitions. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:56,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:56,777 INFO L93 Difference]: Finished difference Result 1507 states and 1613 transitions. [2021-10-21 18:59:56,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-21 18:59:56,777 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 152 [2021-10-21 18:59:56,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:56,780 INFO L225 Difference]: With dead ends: 1507 [2021-10-21 18:59:56,781 INFO L226 Difference]: Without dead ends: 1505 [2021-10-21 18:59:56,781 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.9ms TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-21 18:59:56,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2021-10-21 18:59:56,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2021-10-21 18:59:56,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.0704787234042554) internal successors, (1610), 1504 states have internal predecessors, (1610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:56,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1610 transitions. [2021-10-21 18:59:56,944 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1610 transitions. Word has length 152 [2021-10-21 18:59:56,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:56,945 INFO L470 AbstractCegarLoop]: Abstraction has 1505 states and 1610 transitions. [2021-10-21 18:59:56,945 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:56,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1610 transitions. [2021-10-21 18:59:56,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-10-21 18:59:56,948 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:56,948 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:56,948 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-21 18:59:56,949 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:56,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:56,949 INFO L82 PathProgramCache]: Analyzing trace with hash -1317806111, now seen corresponding path program 1 times [2021-10-21 18:59:56,949 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:56,949 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627994078] [2021-10-21 18:59:56,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:56,950 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-21 18:59:57,004 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2021-10-21 18:59:57,005 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-21 18:59:57,005 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627994078] [2021-10-21 18:59:57,005 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627994078] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-21 18:59:57,005 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-21 18:59:57,005 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-21 18:59:57,006 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363249253] [2021-10-21 18:59:57,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-21 18:59:57,007 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-21 18:59:57,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-21 18:59:57,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:57,008 INFO L87 Difference]: Start difference. First operand 1505 states and 1610 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:57,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-21 18:59:57,192 INFO L93 Difference]: Finished difference Result 2761 states and 2943 transitions. [2021-10-21 18:59:57,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-21 18:59:57,193 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 156 [2021-10-21 18:59:57,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-21 18:59:57,197 INFO L225 Difference]: With dead ends: 2761 [2021-10-21 18:59:57,198 INFO L226 Difference]: Without dead ends: 2125 [2021-10-21 18:59:57,199 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-21 18:59:57,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2021-10-21 18:59:57,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1507. [2021-10-21 18:59:57,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1507 states, 1506 states have (on average 1.0703851261620185) internal successors, (1612), 1506 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1612 transitions. [2021-10-21 18:59:57,330 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1612 transitions. Word has length 156 [2021-10-21 18:59:57,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-21 18:59:57,331 INFO L470 AbstractCegarLoop]: Abstraction has 1507 states and 1612 transitions. [2021-10-21 18:59:57,331 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-21 18:59:57,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1612 transitions. [2021-10-21 18:59:57,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-10-21 18:59:57,335 INFO L504 BasicCegarLoop]: Found error trace [2021-10-21 18:59:57,335 INFO L512 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-21 18:59:57,335 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-21 18:59:57,335 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-21 18:59:57,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-21 18:59:57,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1860246650, now seen corresponding path program 1 times [2021-10-21 18:59:57,336 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-21 18:59:57,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169774965] [2021-10-21 18:59:57,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-21 18:59:57,337 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-21 18:59:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 18:59:57,363 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-21 18:59:57,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-21 18:59:57,465 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-21 18:59:57,465 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-10-21 18:59:57,466 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 18:59:57,468 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-21 18:59:57,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-21 18:59:57,479 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-21 18:59:57,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.10 06:59:57 BoogieIcfgContainer [2021-10-21 18:59:57,628 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-21 18:59:57,629 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-21 18:59:57,629 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-21 18:59:57,629 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-21 18:59:57,629 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.10 06:59:41" (3/4) ... [2021-10-21 18:59:57,631 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-21 18:59:57,829 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/bin/uautomizer-j4sWxH34Be/witness.graphml [2021-10-21 18:59:57,829 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-21 18:59:57,831 INFO L168 Benchmark]: Toolchain (without parser) took 17558.35 ms. Allocated memory was 115.3 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 74.5 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.1 GB. Max. memory is 16.1 GB. [2021-10-21 18:59:57,831 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 115.3 MB. Free memory is still 90.8 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-21 18:59:57,832 INFO L168 Benchmark]: CACSL2BoogieTranslator took 384.03 ms. Allocated memory is still 115.3 MB. Free memory was 74.3 MB in the beginning and 85.7 MB in the end (delta: -11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-21 18:59:57,832 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.43 ms. Allocated memory is still 115.3 MB. Free memory was 85.7 MB in the beginning and 82.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 18:59:57,833 INFO L168 Benchmark]: Boogie Preprocessor took 83.30 ms. Allocated memory is still 115.3 MB. Free memory was 82.4 MB in the beginning and 80.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-21 18:59:57,833 INFO L168 Benchmark]: RCFGBuilder took 826.11 ms. Allocated memory is still 115.3 MB. Free memory was 80.0 MB in the beginning and 53.4 MB in the end (delta: 26.6 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2021-10-21 18:59:57,834 INFO L168 Benchmark]: TraceAbstraction took 15963.83 ms. Allocated memory was 115.3 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 53.0 MB in the beginning and 729.6 MB in the end (delta: -676.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 16.1 GB. [2021-10-21 18:59:57,834 INFO L168 Benchmark]: Witness Printer took 200.51 ms. Allocated memory is still 1.9 GB. Free memory was 728.6 MB in the beginning and 1.8 GB in the end (delta: -1.1 GB). Peak memory consumption was 19.9 MB. Max. memory is 16.1 GB. [2021-10-21 18:59:57,836 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.22 ms. Allocated memory is still 115.3 MB. Free memory is still 90.8 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 384.03 ms. Allocated memory is still 115.3 MB. Free memory was 74.3 MB in the beginning and 85.7 MB in the end (delta: -11.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 94.43 ms. Allocated memory is still 115.3 MB. Free memory was 85.7 MB in the beginning and 82.4 MB in the end (delta: 3.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 83.30 ms. Allocated memory is still 115.3 MB. Free memory was 82.4 MB in the beginning and 80.0 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 826.11 ms. Allocated memory is still 115.3 MB. Free memory was 80.0 MB in the beginning and 53.4 MB in the end (delta: 26.6 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15963.83 ms. Allocated memory was 115.3 MB in the beginning and 1.9 GB in the end (delta: 1.7 GB). Free memory was 53.0 MB in the beginning and 729.6 MB in the end (delta: -676.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 16.1 GB. * Witness Printer took 200.51 ms. Allocated memory is still 1.9 GB. Free memory was 728.6 MB in the beginning and 1.8 GB in the end (delta: -1.1 GB). Peak memory consumption was 19.9 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 12]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L16] int m_pc = 0; [L17] int t1_pc = 0; [L18] int t2_pc = 0; [L19] int m_st ; [L20] int t1_st ; [L21] int t2_st ; [L22] int m_i ; [L23] int t1_i ; [L24] int t2_i ; [L25] int M_E = 2; [L26] int T1_E = 2; [L27] int T2_E = 2; [L28] int E_M = 2; [L29] int E_1 = 2; [L30] int E_2 = 2; [L35] int token ; [L37] int local ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, token=0] [L602] int __retres1 ; [L516] m_i = 1 [L517] t1_i = 1 [L518] t2_i = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L543] int kernel_st ; [L544] int tmp ; [L545] int tmp___0 ; [L549] kernel_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L235] COND TRUE m_i == 1 [L236] m_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L240] COND TRUE t1_i == 1 [L241] t1_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L245] COND TRUE t2_i == 1 [L246] t2_st = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L348] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L353] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L358] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L363] COND FALSE !(E_M == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L368] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L373] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L170] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L180] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L182] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L189] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L201] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L208] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L220] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L386] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L391] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L396] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L401] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L406] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L411] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L557] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L560] kernel_st = 1 [L281] int tmp ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L285] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L276] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L309] COND TRUE t1_st == 0 [L310] int tmp_ndt_2; [L311] tmp_ndt_2 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_2) [L314] t1_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L98] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L109] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L111] t1_pc = 1 [L112] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, token=0] [L323] COND TRUE t2_st == 0 [L324] int tmp_ndt_3; [L325] tmp_ndt_3 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp_ndt_3) [L328] t2_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L134] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L145] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, token=0] [L147] t2_pc = 1 [L148] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L285] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L276] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_1) [L300] m_st = 1 [L40] int tmp_var = __VERIFIER_nondet_int(); [L42] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L53] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L56] token = __VERIFIER_nondet_int() [L57] local = token [L58] E_1 = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L170] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L180] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L182] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L186] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L189] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L190] COND TRUE E_1 == 1 [L191] __retres1 = 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L201] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L435] tmp___0 = is_transmit1_triggered() [L437] COND TRUE \read(tmp___0) [L438] t1_st = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L205] int __retres1 ; VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L208] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L209] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L218] __retres1 = 0 VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L220] return (__retres1); VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L60] E_1 = 2 [L61] m_pc = 1 [L62] m_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L309] COND TRUE t1_st == 0 [L310] int tmp_ndt_2; [L311] tmp_ndt_2 = __VERIFIER_nondet_int() [L312] COND TRUE \read(tmp_ndt_2) [L314] t1_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L98] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L101] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=0] [L117] token += 1 [L118] E_2 = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L170] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L171] COND FALSE !(E_M == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L180] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L182] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L427] tmp = is_master_triggered() [L429] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L186] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L189] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L190] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L199] __retres1 = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L201] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L205] int __retres1 ; VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L208] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L209] COND TRUE E_2 == 1 [L210] __retres1 = 1 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L220] return (__retres1); VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=1] [L443] tmp___1 = is_transmit2_triggered() [L445] COND TRUE \read(tmp___1) [L446] t2_st = 0 VAL [E_1=2, E_2=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L120] E_2 = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L109] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L111] t1_pc = 1 [L112] t1_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, token=1] [L323] COND TRUE t2_st == 0 [L324] int tmp_ndt_3; [L325] tmp_ndt_3 = __VERIFIER_nondet_int() [L326] COND TRUE \read(tmp_ndt_3) [L328] t2_st = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L134] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L137] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=1] [L153] token += 1 [L154] E_M = 1 [L421] int tmp ; [L422] int tmp___0 ; [L423] int tmp___1 ; [L167] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L170] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L171] COND TRUE E_M == 1 [L172] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L182] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L427] tmp = is_master_triggered() [L429] COND TRUE \read(tmp) [L430] m_st = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L186] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L189] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L190] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L199] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L201] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L435] tmp___0 = is_transmit1_triggered() [L437] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L205] int __retres1 ; VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L208] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L209] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L218] __retres1 = 0 VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L220] return (__retres1); VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L443] tmp___1 = is_transmit2_triggered() [L445] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, E_M=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L156] E_M = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L145] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, token=2] [L147] t2_pc = 1 [L148] t2_st = 2 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L285] COND TRUE 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L255] int __retres1 ; VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L258] COND TRUE m_st == 0 [L259] __retres1 = 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L276] return (__retres1); VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L288] tmp = exists_runnable_thread() [L290] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L295] COND TRUE m_st == 0 [L296] int tmp_ndt_1; [L297] tmp_ndt_1 = __VERIFIER_nondet_int() [L298] COND TRUE \read(tmp_ndt_1) [L300] m_st = 1 [L40] int tmp_var = __VERIFIER_nondet_int(); [L42] COND FALSE !(m_pc == 0) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L45] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L67] COND FALSE !(token != local + 2) VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L72] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L73] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L78] COND TRUE tmp_var <= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L79] COND TRUE tmp_var >= 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L80] COND TRUE tmp_var == 5 VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] [L12] reach_error() VAL [E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, token=2] - UnprovableResult [Line: 12]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 225 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 15730.0ms, OverallIterations: 27, TraceHistogramMax: 3, EmptinessCheckTime: 103.8ms, AutomataDifference: 7651.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 18.8ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 8823 SDtfs, 9607 SDslu, 7212 SDs, 0 SdLazy, 639 SolverSat, 230 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 705.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 176.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=7170occurred in iteration=16, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 5765.5ms AutomataMinimizationTime, 26 MinimizatonAttempts, 5348 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 105.8ms SsaConstructionTime, 409.1ms SatisfiabilityAnalysisTime, 1115.2ms InterpolantComputationTime, 2427 NumberOfCodeBlocks, 2427 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 2244 ConstructedInterpolants, 0 QuantifiedInterpolants, 4036 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 PerfectInterpolantSequences, 344/344 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! [2021-10-21 18:59:57,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7340dca9-20f2-498f-a46c-487161ab9770/bin/uautomizer-j4sWxH34Be/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...