./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 b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/bin/uautomizer-GMMbpWq8iD/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/bin/uautomizer-GMMbpWq8iD/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/bin/uautomizer-GMMbpWq8iD/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/bin/uautomizer-GMMbpWq8iD/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_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/bin/uautomizer-GMMbpWq8iD --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-b2eff8b [2021-10-28 22:50:47,140 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-28 22:50:47,143 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-28 22:50:47,175 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-28 22:50:47,176 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-28 22:50:47,177 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-28 22:50:47,179 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-28 22:50:47,182 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-28 22:50:47,184 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-28 22:50:47,185 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-28 22:50:47,186 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-28 22:50:47,187 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-28 22:50:47,188 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-28 22:50:47,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-28 22:50:47,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-28 22:50:47,192 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-28 22:50:47,193 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-28 22:50:47,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-28 22:50:47,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-28 22:50:47,200 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-28 22:50:47,202 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-28 22:50:47,203 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-28 22:50:47,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-28 22:50:47,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-28 22:50:47,219 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-28 22:50:47,219 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-28 22:50:47,219 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-28 22:50:47,220 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-28 22:50:47,221 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-28 22:50:47,222 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-28 22:50:47,222 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-28 22:50:47,223 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-28 22:50:47,224 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-28 22:50:47,225 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-28 22:50:47,228 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-28 22:50:47,229 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-28 22:50:47,230 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-28 22:50:47,230 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-28 22:50:47,230 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-28 22:50:47,231 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-28 22:50:47,232 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-28 22:50:47,233 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/bin/uautomizer-GMMbpWq8iD/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-28 22:50:47,283 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-28 22:50:47,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-28 22:50:47,284 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-28 22:50:47,290 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-28 22:50:47,291 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-28 22:50:47,291 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-28 22:50:47,292 INFO L138 SettingsManager]: * Use SBE=true [2021-10-28 22:50:47,292 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-28 22:50:47,292 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-28 22:50:47,292 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-28 22:50:47,292 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-28 22:50:47,293 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-28 22:50:47,293 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-28 22:50:47,293 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-28 22:50:47,293 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-28 22:50:47,293 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-28 22:50:47,294 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-28 22:50:47,294 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-28 22:50:47,294 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-28 22:50:47,294 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-28 22:50:47,294 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-28 22:50:47,295 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-28 22:50:47,295 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 22:50:47,295 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-28 22:50:47,295 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-28 22:50:47,296 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-28 22:50:47,296 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-28 22:50:47,296 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-28 22:50:47,296 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-10-28 22:50:47,296 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-10-28 22:50:47,297 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-28 22:50:47,297 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-28 22:50:47,297 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_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/bin/uautomizer-GMMbpWq8iD/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_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/bin/uautomizer-GMMbpWq8iD 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-28 22:50:47,596 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-28 22:50:47,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-28 22:50:47,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-28 22:50:47,620 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-28 22:50:47,621 INFO L275 PluginConnector]: CDTParser initialized [2021-10-28 22:50:47,622 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/bin/uautomizer-GMMbpWq8iD/../../sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2021-10-28 22:50:47,706 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/bin/uautomizer-GMMbpWq8iD/data/c99c2ac02/8b624b3522a7459e926efee3a71a2a90/FLAGee1037adc [2021-10-28 22:50:48,238 INFO L306 CDTParser]: Found 1 translation units. [2021-10-28 22:50:48,239 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/sv-benchmarks/c/systemc/token_ring.02.cil-2.c [2021-10-28 22:50:48,257 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/bin/uautomizer-GMMbpWq8iD/data/c99c2ac02/8b624b3522a7459e926efee3a71a2a90/FLAGee1037adc [2021-10-28 22:50:48,555 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/bin/uautomizer-GMMbpWq8iD/data/c99c2ac02/8b624b3522a7459e926efee3a71a2a90 [2021-10-28 22:50:48,558 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-28 22:50:48,559 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-28 22:50:48,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-28 22:50:48,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-28 22:50:48,571 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-28 22:50:48,572 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 10:50:48" (1/1) ... [2021-10-28 22:50:48,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11dca19c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:50:48, skipping insertion in model container [2021-10-28 22:50:48,573 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 10:50:48" (1/1) ... [2021-10-28 22:50:48,581 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-28 22:50:48,610 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-28 22:50:48,797 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_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[366,379] [2021-10-28 22:50:48,855 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 22:50:48,864 INFO L203 MainTranslator]: Completed pre-run [2021-10-28 22:50:48,875 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_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/sv-benchmarks/c/systemc/token_ring.02.cil-2.c[366,379] [2021-10-28 22:50:48,917 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-28 22:50:48,948 INFO L208 MainTranslator]: Completed translation [2021-10-28 22:50:48,949 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:50:48 WrapperNode [2021-10-28 22:50:48,949 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-28 22:50:48,950 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-28 22:50:48,951 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-28 22:50:48,951 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-28 22:50:48,958 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:50:48" (1/1) ... [2021-10-28 22:50:48,967 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:50:48" (1/1) ... [2021-10-28 22:50:49,010 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-28 22:50:49,011 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-28 22:50:49,011 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-28 22:50:49,011 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-28 22:50:49,019 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:50:48" (1/1) ... [2021-10-28 22:50:49,020 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:50:48" (1/1) ... [2021-10-28 22:50:49,025 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:50:48" (1/1) ... [2021-10-28 22:50:49,025 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:50:48" (1/1) ... [2021-10-28 22:50:49,036 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:50:48" (1/1) ... [2021-10-28 22:50:49,072 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:50:48" (1/1) ... [2021-10-28 22:50:49,077 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:50:48" (1/1) ... [2021-10-28 22:50:49,083 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-28 22:50:49,084 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-28 22:50:49,084 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-28 22:50:49,085 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-28 22:50:49,085 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:50:48" (1/1) ... [2021-10-28 22:50:49,094 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-28 22:50:49,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/bin/uautomizer-GMMbpWq8iD/z3 [2021-10-28 22:50:49,118 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-28 22:50:49,124 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-28 22:50:49,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-28 22:50:49,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-28 22:50:49,167 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-28 22:50:49,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-28 22:50:49,847 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-28 22:50:49,848 INFO L299 CfgBuilder]: Removed 105 assume(true) statements. [2021-10-28 22:50:49,850 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:50:49 BoogieIcfgContainer [2021-10-28 22:50:49,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-28 22:50:49,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-28 22:50:49,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-28 22:50:49,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-28 22:50:49,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.10 10:50:48" (1/3) ... [2021-10-28 22:50:49,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ddfab6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 10:50:49, skipping insertion in model container [2021-10-28 22:50:49,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 10:50:48" (2/3) ... [2021-10-28 22:50:49,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ddfab6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.10 10:50:49, skipping insertion in model container [2021-10-28 22:50:49,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:50:49" (3/3) ... [2021-10-28 22:50:49,868 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.02.cil-2.c [2021-10-28 22:50:49,873 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-28 22:50:49,879 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-10-28 22:50:49,934 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-28 22:50:49,941 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-28 22:50:49,941 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-10-28 22:50:49,963 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-28 22:50:49,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-28 22:50:49,971 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:49,972 INFO L513 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-28 22:50:49,973 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:49,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:49,979 INFO L85 PathProgramCache]: Analyzing trace with hash 603110903, now seen corresponding path program 1 times [2021-10-28 22:50:49,988 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:49,988 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247908579] [2021-10-28 22:50:49,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:49,990 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:50,156 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-28 22:50:50,157 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:50,157 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247908579] [2021-10-28 22:50:50,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247908579] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:50,158 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:50,159 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:50:50,160 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099266891] [2021-10-28 22:50:50,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:50:50,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:50,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:50:50,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:50,182 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-28 22:50:50,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:50:50,269 INFO L93 Difference]: Finished difference Result 445 states and 697 transitions. [2021-10-28 22:50:50,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:50:50,271 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-28 22:50:50,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:50:50,288 INFO L225 Difference]: With dead ends: 445 [2021-10-28 22:50:50,288 INFO L226 Difference]: Without dead ends: 221 [2021-10-28 22:50:50,293 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:50,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2021-10-28 22:50:50,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2021-10-28 22:50:50,357 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-28 22:50:50,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 335 transitions. [2021-10-28 22:50:50,366 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 335 transitions. Word has length 50 [2021-10-28 22:50:50,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:50:50,367 INFO L470 AbstractCegarLoop]: Abstraction has 221 states and 335 transitions. [2021-10-28 22:50:50,367 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-28 22:50:50,367 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 335 transitions. [2021-10-28 22:50:50,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-28 22:50:50,373 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:50,373 INFO L513 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-28 22:50:50,373 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-28 22:50:50,374 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:50,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:50,377 INFO L85 PathProgramCache]: Analyzing trace with hash -1325161799, now seen corresponding path program 1 times [2021-10-28 22:50:50,378 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:50,378 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471391383] [2021-10-28 22:50:50,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:50,379 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:50,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:50,478 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-28 22:50:50,478 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:50,479 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471391383] [2021-10-28 22:50:50,479 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471391383] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:50,479 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:50,479 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 22:50:50,479 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838853339] [2021-10-28 22:50:50,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:50:50,481 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:50,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:50:50,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:50,481 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-28 22:50:50,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:50:50,560 INFO L93 Difference]: Finished difference Result 595 states and 901 transitions. [2021-10-28 22:50:50,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:50:50,560 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-28 22:50:50,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:50:50,564 INFO L225 Difference]: With dead ends: 595 [2021-10-28 22:50:50,566 INFO L226 Difference]: Without dead ends: 381 [2021-10-28 22:50:50,568 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:50,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2021-10-28 22:50:50,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 377. [2021-10-28 22:50:50,603 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-28 22:50:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 570 transitions. [2021-10-28 22:50:50,605 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 570 transitions. Word has length 50 [2021-10-28 22:50:50,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:50:50,606 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 570 transitions. [2021-10-28 22:50:50,606 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-28 22:50:50,606 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 570 transitions. [2021-10-28 22:50:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-28 22:50:50,608 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:50,608 INFO L513 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-28 22:50:50,609 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-28 22:50:50,609 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:50,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:50,610 INFO L85 PathProgramCache]: Analyzing trace with hash 102769205, now seen corresponding path program 1 times [2021-10-28 22:50:50,610 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:50,610 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767297149] [2021-10-28 22:50:50,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:50,611 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:50,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:50,655 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-28 22:50:50,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:50,655 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767297149] [2021-10-28 22:50:50,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767297149] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:50,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:50,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 22:50:50,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365584722] [2021-10-28 22:50:50,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:50:50,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:50,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:50:50,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:50,659 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-28 22:50:50,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:50:50,689 INFO L93 Difference]: Finished difference Result 746 states and 1129 transitions. [2021-10-28 22:50:50,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:50:50,690 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-28 22:50:50,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:50:50,692 INFO L225 Difference]: With dead ends: 746 [2021-10-28 22:50:50,693 INFO L226 Difference]: Without dead ends: 377 [2021-10-28 22:50:50,694 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:50,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-10-28 22:50:50,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2021-10-28 22:50:50,727 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-28 22:50:50,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 562 transitions. [2021-10-28 22:50:50,751 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 562 transitions. Word has length 50 [2021-10-28 22:50:50,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:50:50,751 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 562 transitions. [2021-10-28 22:50:50,751 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-28 22:50:50,751 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 562 transitions. [2021-10-28 22:50:50,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-28 22:50:50,753 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:50,753 INFO L513 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-28 22:50:50,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-28 22:50:50,753 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:50,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:50,754 INFO L85 PathProgramCache]: Analyzing trace with hash 1811399481, now seen corresponding path program 1 times [2021-10-28 22:50:50,754 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:50,754 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329609851] [2021-10-28 22:50:50,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:50,755 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:50,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:50,833 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-28 22:50:50,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:50,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329609851] [2021-10-28 22:50:50,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329609851] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:50,834 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:50,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 22:50:50,834 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457165667] [2021-10-28 22:50:50,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:50:50,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:50,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:50:50,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:50,836 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-28 22:50:50,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:50:50,866 INFO L93 Difference]: Finished difference Result 745 states and 1112 transitions. [2021-10-28 22:50:50,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:50:50,866 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-28 22:50:50,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:50:50,869 INFO L225 Difference]: With dead ends: 745 [2021-10-28 22:50:50,869 INFO L226 Difference]: Without dead ends: 377 [2021-10-28 22:50:50,871 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:50,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-10-28 22:50:50,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2021-10-28 22:50:50,896 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-28 22:50:50,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 554 transitions. [2021-10-28 22:50:50,898 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 554 transitions. Word has length 50 [2021-10-28 22:50:50,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:50:50,899 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 554 transitions. [2021-10-28 22:50:50,899 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-28 22:50:50,899 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 554 transitions. [2021-10-28 22:50:50,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-28 22:50:50,905 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:50,906 INFO L513 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-28 22:50:50,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-28 22:50:50,906 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:50,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:50,909 INFO L85 PathProgramCache]: Analyzing trace with hash 65401269, now seen corresponding path program 1 times [2021-10-28 22:50:50,909 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:50,910 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421685381] [2021-10-28 22:50:50,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:50,910 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:50,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:50,981 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-28 22:50:50,981 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:50,982 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421685381] [2021-10-28 22:50:50,982 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421685381] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:50,982 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:50,982 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 22:50:50,982 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97808296] [2021-10-28 22:50:50,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:50:50,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:50,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:50:50,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:50,984 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-28 22:50:51,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:50:51,037 INFO L93 Difference]: Finished difference Result 744 states and 1095 transitions. [2021-10-28 22:50:51,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:50:51,037 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-28 22:50:51,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:50:51,040 INFO L225 Difference]: With dead ends: 744 [2021-10-28 22:50:51,040 INFO L226 Difference]: Without dead ends: 377 [2021-10-28 22:50:51,041 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:51,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-10-28 22:50:51,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2021-10-28 22:50:51,057 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-28 22:50:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 538 transitions. [2021-10-28 22:50:51,060 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 538 transitions. Word has length 50 [2021-10-28 22:50:51,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:50:51,061 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 538 transitions. [2021-10-28 22:50:51,062 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-28 22:50:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 538 transitions. [2021-10-28 22:50:51,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-28 22:50:51,064 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:51,064 INFO L513 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-28 22:50:51,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-28 22:50:51,065 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:51,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:51,066 INFO L85 PathProgramCache]: Analyzing trace with hash 25960058, now seen corresponding path program 1 times [2021-10-28 22:50:51,066 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:51,066 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331797543] [2021-10-28 22:50:51,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:51,067 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:51,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:51,146 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-28 22:50:51,146 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:51,146 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331797543] [2021-10-28 22:50:51,146 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331797543] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:51,147 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:51,147 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:50:51,147 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794343220] [2021-10-28 22:50:51,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:50:51,148 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:51,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:50:51,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:50:51,148 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-28 22:50:51,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:50:51,270 INFO L93 Difference]: Finished difference Result 998 states and 1431 transitions. [2021-10-28 22:50:51,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:50:51,271 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-28 22:50:51,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:50:51,280 INFO L225 Difference]: With dead ends: 998 [2021-10-28 22:50:51,280 INFO L226 Difference]: Without dead ends: 632 [2021-10-28 22:50:51,281 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:50:51,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2021-10-28 22:50:51,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 377. [2021-10-28 22:50:51,319 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-28 22:50:51,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 535 transitions. [2021-10-28 22:50:51,321 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 535 transitions. Word has length 50 [2021-10-28 22:50:51,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:50:51,321 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 535 transitions. [2021-10-28 22:50:51,321 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-28 22:50:51,321 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 535 transitions. [2021-10-28 22:50:51,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-28 22:50:51,323 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:51,323 INFO L513 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-28 22:50:51,323 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-28 22:50:51,323 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:51,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:51,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1345847240, now seen corresponding path program 1 times [2021-10-28 22:50:51,324 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:51,336 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967509468] [2021-10-28 22:50:51,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:51,336 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:51,387 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-28 22:50:51,387 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:51,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967509468] [2021-10-28 22:50:51,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967509468] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:51,388 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:51,388 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 22:50:51,388 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497269086] [2021-10-28 22:50:51,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:50:51,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:51,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:50:51,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:51,389 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-28 22:50:51,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:50:51,437 INFO L93 Difference]: Finished difference Result 742 states and 1055 transitions. [2021-10-28 22:50:51,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:50:51,437 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-28 22:50:51,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:50:51,440 INFO L225 Difference]: With dead ends: 742 [2021-10-28 22:50:51,440 INFO L226 Difference]: Without dead ends: 377 [2021-10-28 22:50:51,441 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:51,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2021-10-28 22:50:51,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2021-10-28 22:50:51,460 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-28 22:50:51,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 519 transitions. [2021-10-28 22:50:51,461 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 519 transitions. Word has length 50 [2021-10-28 22:50:51,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:50:51,462 INFO L470 AbstractCegarLoop]: Abstraction has 377 states and 519 transitions. [2021-10-28 22:50:51,462 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-28 22:50:51,462 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 519 transitions. [2021-10-28 22:50:51,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-28 22:50:51,463 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:51,463 INFO L513 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-28 22:50:51,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-28 22:50:51,463 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:51,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:51,464 INFO L85 PathProgramCache]: Analyzing trace with hash -176110788, now seen corresponding path program 1 times [2021-10-28 22:50:51,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:51,464 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70541328] [2021-10-28 22:50:51,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:51,464 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:51,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:51,537 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-28 22:50:51,537 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:51,538 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70541328] [2021-10-28 22:50:51,538 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70541328] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:51,538 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:51,538 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 22:50:51,539 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552003124] [2021-10-28 22:50:51,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:50:51,540 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:51,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:50:51,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:50:51,541 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-28 22:50:51,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:50:51,646 INFO L93 Difference]: Finished difference Result 981 states and 1369 transitions. [2021-10-28 22:50:51,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 22:50:51,647 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-28 22:50:51,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:50:51,651 INFO L225 Difference]: With dead ends: 981 [2021-10-28 22:50:51,651 INFO L226 Difference]: Without dead ends: 623 [2021-10-28 22:50:51,652 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 22:50:51,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 623 states. [2021-10-28 22:50:51,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 623 to 383. [2021-10-28 22:50:51,687 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-28 22:50:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 517 transitions. [2021-10-28 22:50:51,688 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 517 transitions. Word has length 50 [2021-10-28 22:50:51,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:50:51,689 INFO L470 AbstractCegarLoop]: Abstraction has 383 states and 517 transitions. [2021-10-28 22:50:51,689 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-28 22:50:51,689 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 517 transitions. [2021-10-28 22:50:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-28 22:50:51,689 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:51,690 INFO L513 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-28 22:50:51,690 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-28 22:50:51,690 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:51,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:51,690 INFO L85 PathProgramCache]: Analyzing trace with hash -248497346, now seen corresponding path program 1 times [2021-10-28 22:50:51,691 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:51,691 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740023128] [2021-10-28 22:50:51,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:51,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:51,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:51,742 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-28 22:50:51,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:51,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740023128] [2021-10-28 22:50:51,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740023128] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:51,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:51,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:50:51,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704993954] [2021-10-28 22:50:51,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:50:51,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:51,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:50:51,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:50:51,748 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-28 22:50:51,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:50:51,918 INFO L93 Difference]: Finished difference Result 1331 states and 1797 transitions. [2021-10-28 22:50:51,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-28 22:50:51,918 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-28 22:50:51,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:50:51,924 INFO L225 Difference]: With dead ends: 1331 [2021-10-28 22:50:51,925 INFO L226 Difference]: Without dead ends: 962 [2021-10-28 22:50:51,926 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:50:51,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-10-28 22:50:52,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 886. [2021-10-28 22:50:52,003 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-28 22:50:52,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 886 states to 886 states and 1178 transitions. [2021-10-28 22:50:52,007 INFO L78 Accepts]: Start accepts. Automaton has 886 states and 1178 transitions. Word has length 50 [2021-10-28 22:50:52,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:50:52,007 INFO L470 AbstractCegarLoop]: Abstraction has 886 states and 1178 transitions. [2021-10-28 22:50:52,007 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-28 22:50:52,007 INFO L276 IsEmpty]: Start isEmpty. Operand 886 states and 1178 transitions. [2021-10-28 22:50:52,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-28 22:50:52,008 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:52,008 INFO L513 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-28 22:50:52,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-28 22:50:52,009 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:52,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:52,009 INFO L85 PathProgramCache]: Analyzing trace with hash -170072379, now seen corresponding path program 1 times [2021-10-28 22:50:52,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:52,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794498643] [2021-10-28 22:50:52,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:52,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:52,067 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-28 22:50:52,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:52,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794498643] [2021-10-28 22:50:52,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794498643] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:52,068 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:52,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 22:50:52,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018264062] [2021-10-28 22:50:52,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:50:52,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:52,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:50:52,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:50:52,070 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-28 22:50:52,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:50:52,289 INFO L93 Difference]: Finished difference Result 2286 states and 3059 transitions. [2021-10-28 22:50:52,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 22:50:52,289 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-28 22:50:52,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:50:52,298 INFO L225 Difference]: With dead ends: 2286 [2021-10-28 22:50:52,298 INFO L226 Difference]: Without dead ends: 1424 [2021-10-28 22:50:52,300 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 22:50:52,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1424 states. [2021-10-28 22:50:52,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1424 to 913. [2021-10-28 22:50:52,395 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-28 22:50:52,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1192 transitions. [2021-10-28 22:50:52,399 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1192 transitions. Word has length 63 [2021-10-28 22:50:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:50:52,399 INFO L470 AbstractCegarLoop]: Abstraction has 913 states and 1192 transitions. [2021-10-28 22:50:52,399 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-28 22:50:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1192 transitions. [2021-10-28 22:50:52,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2021-10-28 22:50:52,400 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:52,401 INFO L513 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-28 22:50:52,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-28 22:50:52,401 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:52,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:52,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1541879677, now seen corresponding path program 1 times [2021-10-28 22:50:52,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:52,404 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271279719] [2021-10-28 22:50:52,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:52,404 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:52,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:52,451 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-28 22:50:52,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:52,452 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271279719] [2021-10-28 22:50:52,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271279719] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:52,452 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:52,452 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:50:52,452 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752940374] [2021-10-28 22:50:52,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:50:52,453 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:52,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:50:52,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:52,455 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-28 22:50:52,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:50:52,613 INFO L93 Difference]: Finished difference Result 2514 states and 3253 transitions. [2021-10-28 22:50:52,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:50:52,613 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-28 22:50:52,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:50:52,622 INFO L225 Difference]: With dead ends: 2514 [2021-10-28 22:50:52,622 INFO L226 Difference]: Without dead ends: 1638 [2021-10-28 22:50:52,624 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:52,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states. [2021-10-28 22:50:52,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1638. [2021-10-28 22:50:52,777 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-28 22:50:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2079 transitions. [2021-10-28 22:50:52,783 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2079 transitions. Word has length 63 [2021-10-28 22:50:52,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:50:52,784 INFO L470 AbstractCegarLoop]: Abstraction has 1638 states and 2079 transitions. [2021-10-28 22:50:52,784 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-28 22:50:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2079 transitions. [2021-10-28 22:50:52,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-28 22:50:52,785 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:52,785 INFO L513 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-28 22:50:52,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-28 22:50:52,785 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:52,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:52,786 INFO L85 PathProgramCache]: Analyzing trace with hash -443703688, now seen corresponding path program 1 times [2021-10-28 22:50:52,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:52,786 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691113283] [2021-10-28 22:50:52,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:52,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:52,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:52,834 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-28 22:50:52,834 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:52,834 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691113283] [2021-10-28 22:50:52,834 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [691113283] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:52,834 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:52,834 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:50:52,835 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255545236] [2021-10-28 22:50:52,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:50:52,835 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:52,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:50:52,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:52,836 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-28 22:50:53,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:50:53,076 INFO L93 Difference]: Finished difference Result 4524 states and 5739 transitions. [2021-10-28 22:50:53,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:50:53,077 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-28 22:50:53,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:50:53,095 INFO L225 Difference]: With dead ends: 4524 [2021-10-28 22:50:53,096 INFO L226 Difference]: Without dead ends: 2956 [2021-10-28 22:50:53,098 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:53,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2956 states. [2021-10-28 22:50:53,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2956 to 2916. [2021-10-28 22:50:53,311 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-28 22:50:53,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 3671 transitions. [2021-10-28 22:50:53,322 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 3671 transitions. Word has length 64 [2021-10-28 22:50:53,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:50:53,322 INFO L470 AbstractCegarLoop]: Abstraction has 2916 states and 3671 transitions. [2021-10-28 22:50:53,322 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-28 22:50:53,322 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 3671 transitions. [2021-10-28 22:50:53,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2021-10-28 22:50:53,324 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:53,324 INFO L513 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-28 22:50:53,324 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-28 22:50:53,324 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:53,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:53,325 INFO L85 PathProgramCache]: Analyzing trace with hash 116996090, now seen corresponding path program 1 times [2021-10-28 22:50:53,325 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:53,325 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772515228] [2021-10-28 22:50:53,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:53,325 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:53,345 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-28 22:50:53,345 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:53,346 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772515228] [2021-10-28 22:50:53,346 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772515228] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:53,346 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:53,346 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:50:53,346 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630545186] [2021-10-28 22:50:53,346 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:50:53,347 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:53,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:50:53,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:53,348 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-28 22:50:53,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:50:53,574 INFO L93 Difference]: Finished difference Result 5712 states and 7209 transitions. [2021-10-28 22:50:53,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:50:53,575 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-28 22:50:53,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:50:53,590 INFO L225 Difference]: With dead ends: 5712 [2021-10-28 22:50:53,590 INFO L226 Difference]: Without dead ends: 2854 [2021-10-28 22:50:53,594 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:53,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2854 states. [2021-10-28 22:50:53,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2854 to 2854. [2021-10-28 22:50:53,789 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-28 22:50:53,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2854 states to 2854 states and 3601 transitions. [2021-10-28 22:50:53,802 INFO L78 Accepts]: Start accepts. Automaton has 2854 states and 3601 transitions. Word has length 64 [2021-10-28 22:50:53,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:50:53,803 INFO L470 AbstractCegarLoop]: Abstraction has 2854 states and 3601 transitions. [2021-10-28 22:50:53,803 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-28 22:50:53,803 INFO L276 IsEmpty]: Start isEmpty. Operand 2854 states and 3601 transitions. [2021-10-28 22:50:53,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2021-10-28 22:50:53,804 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:53,804 INFO L513 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-28 22:50:53,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-28 22:50:53,805 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:53,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:53,805 INFO L85 PathProgramCache]: Analyzing trace with hash 2104278287, now seen corresponding path program 1 times [2021-10-28 22:50:53,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:53,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938656077] [2021-10-28 22:50:53,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:53,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:53,840 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-28 22:50:53,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:53,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938656077] [2021-10-28 22:50:53,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938656077] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:53,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:53,841 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 22:50:53,841 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493152586] [2021-10-28 22:50:53,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:50:53,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:53,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:50:53,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:53,842 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-28 22:50:54,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:50:54,188 INFO L93 Difference]: Finished difference Result 6838 states and 8679 transitions. [2021-10-28 22:50:54,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:50:54,189 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-28 22:50:54,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:50:54,214 INFO L225 Difference]: With dead ends: 6838 [2021-10-28 22:50:54,214 INFO L226 Difference]: Without dead ends: 4770 [2021-10-28 22:50:54,218 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:54,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4770 states. [2021-10-28 22:50:54,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4770 to 3882. [2021-10-28 22:50:54,533 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-28 22:50:54,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3882 states to 3882 states and 4899 transitions. [2021-10-28 22:50:54,548 INFO L78 Accepts]: Start accepts. Automaton has 3882 states and 4899 transitions. Word has length 65 [2021-10-28 22:50:54,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:50:54,548 INFO L470 AbstractCegarLoop]: Abstraction has 3882 states and 4899 transitions. [2021-10-28 22:50:54,549 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-28 22:50:54,549 INFO L276 IsEmpty]: Start isEmpty. Operand 3882 states and 4899 transitions. [2021-10-28 22:50:54,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-10-28 22:50:54,552 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:54,552 INFO L513 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-28 22:50:54,553 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-28 22:50:54,553 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:54,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:54,553 INFO L85 PathProgramCache]: Analyzing trace with hash 23144866, now seen corresponding path program 1 times [2021-10-28 22:50:54,554 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:54,554 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114899114] [2021-10-28 22:50:54,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:54,554 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:54,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:54,598 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-28 22:50:54,598 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:54,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114899114] [2021-10-28 22:50:54,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114899114] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:54,599 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:54,599 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 22:50:54,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072889942] [2021-10-28 22:50:54,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:50:54,600 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:54,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:50:54,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:50:54,601 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-28 22:50:55,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:50:55,105 INFO L93 Difference]: Finished difference Result 9686 states and 12267 transitions. [2021-10-28 22:50:55,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-10-28 22:50:55,105 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-28 22:50:55,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:50:55,136 INFO L225 Difference]: With dead ends: 9686 [2021-10-28 22:50:55,136 INFO L226 Difference]: Without dead ends: 5862 [2021-10-28 22:50:55,144 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-10-28 22:50:55,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5862 states. [2021-10-28 22:50:55,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5862 to 3930. [2021-10-28 22:50:55,504 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-28 22:50:55,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3930 states to 3930 states and 4873 transitions. [2021-10-28 22:50:55,516 INFO L78 Accepts]: Start accepts. Automaton has 3930 states and 4873 transitions. Word has length 82 [2021-10-28 22:50:55,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:50:55,517 INFO L470 AbstractCegarLoop]: Abstraction has 3930 states and 4873 transitions. [2021-10-28 22:50:55,517 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-28 22:50:55,517 INFO L276 IsEmpty]: Start isEmpty. Operand 3930 states and 4873 transitions. [2021-10-28 22:50:55,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-10-28 22:50:55,520 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:55,520 INFO L513 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-28 22:50:55,520 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-28 22:50:55,520 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:55,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:55,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1565203036, now seen corresponding path program 1 times [2021-10-28 22:50:55,521 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:55,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902393358] [2021-10-28 22:50:55,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:55,521 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:55,557 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-28 22:50:55,557 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:55,557 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902393358] [2021-10-28 22:50:55,558 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902393358] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:55,558 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:55,558 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:50:55,558 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788508203] [2021-10-28 22:50:55,558 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:50:55,559 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:55,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:50:55,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:55,559 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-28 22:50:56,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:50:56,080 INFO L93 Difference]: Finished difference Result 11242 states and 13901 transitions. [2021-10-28 22:50:56,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:50:56,080 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-28 22:50:56,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:50:56,120 INFO L225 Difference]: With dead ends: 11242 [2021-10-28 22:50:56,120 INFO L226 Difference]: Without dead ends: 7382 [2021-10-28 22:50:56,128 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:56,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7382 states. [2021-10-28 22:50:56,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7382 to 7170. [2021-10-28 22:50:56,691 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-28 22:50:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7170 states to 7170 states and 8765 transitions. [2021-10-28 22:50:56,707 INFO L78 Accepts]: Start accepts. Automaton has 7170 states and 8765 transitions. Word has length 82 [2021-10-28 22:50:56,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:50:56,707 INFO L470 AbstractCegarLoop]: Abstraction has 7170 states and 8765 transitions. [2021-10-28 22:50:56,707 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-28 22:50:56,708 INFO L276 IsEmpty]: Start isEmpty. Operand 7170 states and 8765 transitions. [2021-10-28 22:50:56,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-10-28 22:50:56,711 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:56,711 INFO L513 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-28 22:50:56,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-28 22:50:56,712 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:56,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:56,712 INFO L85 PathProgramCache]: Analyzing trace with hash 794948131, now seen corresponding path program 1 times [2021-10-28 22:50:56,712 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:56,712 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328626771] [2021-10-28 22:50:56,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:56,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:56,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:56,745 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-28 22:50:56,746 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:56,746 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328626771] [2021-10-28 22:50:56,746 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328626771] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:56,746 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:56,746 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:50:56,746 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545825662] [2021-10-28 22:50:56,747 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:50:56,747 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:56,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:50:56,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:50:56,748 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-28 22:50:57,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:50:57,255 INFO L93 Difference]: Finished difference Result 12642 states and 15459 transitions. [2021-10-28 22:50:57,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:50:57,255 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-28 22:50:57,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:50:57,267 INFO L225 Difference]: With dead ends: 12642 [2021-10-28 22:50:57,268 INFO L226 Difference]: Without dead ends: 5509 [2021-10-28 22:50:57,276 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:50:57,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5509 states. [2021-10-28 22:50:57,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5509 to 5509. [2021-10-28 22:50:57,604 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-28 22:50:57,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5509 states to 5509 states and 6669 transitions. [2021-10-28 22:50:57,613 INFO L78 Accepts]: Start accepts. Automaton has 5509 states and 6669 transitions. Word has length 83 [2021-10-28 22:50:57,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:50:57,614 INFO L470 AbstractCegarLoop]: Abstraction has 5509 states and 6669 transitions. [2021-10-28 22:50:57,614 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-28 22:50:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 5509 states and 6669 transitions. [2021-10-28 22:50:57,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2021-10-28 22:50:57,619 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:57,619 INFO L513 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-28 22:50:57,619 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-28 22:50:57,619 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:57,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:57,620 INFO L85 PathProgramCache]: Analyzing trace with hash -471564153, now seen corresponding path program 1 times [2021-10-28 22:50:57,620 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:57,620 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962128842] [2021-10-28 22:50:57,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:57,621 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:57,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:57,654 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-28 22:50:57,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:57,655 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962128842] [2021-10-28 22:50:57,655 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962128842] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:57,655 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:57,655 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-28 22:50:57,655 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966043690] [2021-10-28 22:50:57,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:50:57,656 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:57,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:50:57,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:57,657 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-28 22:50:58,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:50:58,186 INFO L93 Difference]: Finished difference Result 12613 states and 15226 transitions. [2021-10-28 22:50:58,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:50:58,187 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-28 22:50:58,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:50:58,202 INFO L225 Difference]: With dead ends: 12613 [2021-10-28 22:50:58,203 INFO L226 Difference]: Without dead ends: 7130 [2021-10-28 22:50:58,210 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:58,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7130 states. [2021-10-28 22:50:58,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7130 to 7082. [2021-10-28 22:50:58,692 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-28 22:50:58,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 8483 transitions. [2021-10-28 22:50:58,706 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 8483 transitions. Word has length 106 [2021-10-28 22:50:58,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:50:58,707 INFO L470 AbstractCegarLoop]: Abstraction has 7082 states and 8483 transitions. [2021-10-28 22:50:58,707 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-28 22:50:58,708 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 8483 transitions. [2021-10-28 22:50:58,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-10-28 22:50:58,716 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:58,716 INFO L513 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-28 22:50:58,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-28 22:50:58,716 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:58,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:58,717 INFO L85 PathProgramCache]: Analyzing trace with hash 1818985301, now seen corresponding path program 1 times [2021-10-28 22:50:58,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:58,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438771897] [2021-10-28 22:50:58,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:58,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:58,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:58,753 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-28 22:50:58,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:58,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438771897] [2021-10-28 22:50:58,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438771897] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:58,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:58,755 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:50:58,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671491569] [2021-10-28 22:50:58,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:50:58,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:58,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:50:58,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:58,756 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-28 22:50:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:50:59,304 INFO L93 Difference]: Finished difference Result 12586 states and 15145 transitions. [2021-10-28 22:50:59,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:50:59,305 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-28 22:50:59,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:50:59,396 INFO L225 Difference]: With dead ends: 12586 [2021-10-28 22:50:59,396 INFO L226 Difference]: Without dead ends: 7114 [2021-10-28 22:50:59,401 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:50:59,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7114 states. [2021-10-28 22:50:59,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7114 to 7082. [2021-10-28 22:50:59,798 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-28 22:50:59,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 8311 transitions. [2021-10-28 22:50:59,809 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 8311 transitions. Word has length 121 [2021-10-28 22:50:59,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:50:59,810 INFO L470 AbstractCegarLoop]: Abstraction has 7082 states and 8311 transitions. [2021-10-28 22:50:59,810 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-28 22:50:59,810 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 8311 transitions. [2021-10-28 22:50:59,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2021-10-28 22:50:59,816 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:50:59,816 INFO L513 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-28 22:50:59,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-28 22:50:59,817 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:50:59,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:50:59,817 INFO L85 PathProgramCache]: Analyzing trace with hash -654472485, now seen corresponding path program 1 times [2021-10-28 22:50:59,817 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:50:59,818 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531304695] [2021-10-28 22:50:59,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:50:59,818 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:50:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:50:59,853 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-28 22:50:59,854 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:50:59,854 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531304695] [2021-10-28 22:50:59,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531304695] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:50:59,854 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:50:59,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:50:59,855 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391630129] [2021-10-28 22:50:59,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:50:59,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:50:59,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:50:59,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:50:59,856 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-28 22:51:00,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:00,272 INFO L93 Difference]: Finished difference Result 12558 states and 14771 transitions. [2021-10-28 22:51:00,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:51:00,273 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-28 22:51:00,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:00,287 INFO L225 Difference]: With dead ends: 12558 [2021-10-28 22:51:00,287 INFO L226 Difference]: Without dead ends: 7086 [2021-10-28 22:51:00,294 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:51:00,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7086 states. [2021-10-28 22:51:00,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7086 to 7082. [2021-10-28 22:51:00,745 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-28 22:51:00,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7082 states to 7082 states and 8275 transitions. [2021-10-28 22:51:00,756 INFO L78 Accepts]: Start accepts. Automaton has 7082 states and 8275 transitions. Word has length 122 [2021-10-28 22:51:00,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:00,756 INFO L470 AbstractCegarLoop]: Abstraction has 7082 states and 8275 transitions. [2021-10-28 22:51:00,757 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-28 22:51:00,757 INFO L276 IsEmpty]: Start isEmpty. Operand 7082 states and 8275 transitions. [2021-10-28 22:51:00,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2021-10-28 22:51:00,765 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:00,765 INFO L513 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-28 22:51:00,765 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-10-28 22:51:00,765 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:00,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:00,766 INFO L85 PathProgramCache]: Analyzing trace with hash -956339995, now seen corresponding path program 1 times [2021-10-28 22:51:00,766 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:00,766 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940551122] [2021-10-28 22:51:00,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:00,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:00,813 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-28 22:51:00,813 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:00,813 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940551122] [2021-10-28 22:51:00,813 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940551122] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:00,813 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:00,814 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:51:00,814 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446351255] [2021-10-28 22:51:00,814 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:51:00,814 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:00,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:51:00,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:51:00,815 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-28 22:51:01,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:01,333 INFO L93 Difference]: Finished difference Result 14324 states and 16731 transitions. [2021-10-28 22:51:01,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:51:01,334 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-28 22:51:01,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:01,348 INFO L225 Difference]: With dead ends: 14324 [2021-10-28 22:51:01,348 INFO L226 Difference]: Without dead ends: 6484 [2021-10-28 22:51:01,357 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:51:01,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6484 states. [2021-10-28 22:51:01,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6484 to 6280. [2021-10-28 22:51:01,789 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-28 22:51:01,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 7296 transitions. [2021-10-28 22:51:01,799 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 7296 transitions. Word has length 148 [2021-10-28 22:51:01,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:01,799 INFO L470 AbstractCegarLoop]: Abstraction has 6280 states and 7296 transitions. [2021-10-28 22:51:01,799 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-28 22:51:01,799 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 7296 transitions. [2021-10-28 22:51:01,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2021-10-28 22:51:01,805 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:01,805 INFO L513 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-28 22:51:01,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-10-28 22:51:01,805 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:01,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:01,806 INFO L85 PathProgramCache]: Analyzing trace with hash 199848580, now seen corresponding path program 1 times [2021-10-28 22:51:01,806 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:01,806 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258310918] [2021-10-28 22:51:01,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:01,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:01,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:01,838 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-28 22:51:01,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:01,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258310918] [2021-10-28 22:51:01,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [258310918] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:01,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:01,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:51:01,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894070423] [2021-10-28 22:51:01,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:51:01,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:01,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:51:01,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:01,841 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-28 22:51:02,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:02,201 INFO L93 Difference]: Finished difference Result 10747 states and 12514 transitions. [2021-10-28 22:51:02,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:51:02,201 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-28 22:51:02,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:02,214 INFO L225 Difference]: With dead ends: 10747 [2021-10-28 22:51:02,214 INFO L226 Difference]: Without dead ends: 6564 [2021-10-28 22:51:02,220 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:02,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6564 states. [2021-10-28 22:51:02,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6564 to 6280. [2021-10-28 22:51:02,674 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-28 22:51:02,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6280 states to 6280 states and 7176 transitions. [2021-10-28 22:51:02,682 INFO L78 Accepts]: Start accepts. Automaton has 6280 states and 7176 transitions. Word has length 149 [2021-10-28 22:51:02,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:02,682 INFO L470 AbstractCegarLoop]: Abstraction has 6280 states and 7176 transitions. [2021-10-28 22:51:02,682 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-28 22:51:02,682 INFO L276 IsEmpty]: Start isEmpty. Operand 6280 states and 7176 transitions. [2021-10-28 22:51:02,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-10-28 22:51:02,688 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:02,688 INFO L513 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-28 22:51:02,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-10-28 22:51:02,689 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:02,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:02,690 INFO L85 PathProgramCache]: Analyzing trace with hash 965086109, now seen corresponding path program 1 times [2021-10-28 22:51:02,690 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:02,690 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797098656] [2021-10-28 22:51:02,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:02,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:02,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:02,734 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-28 22:51:02,734 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:02,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797098656] [2021-10-28 22:51:02,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797098656] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:02,734 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:02,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-28 22:51:02,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693660426] [2021-10-28 22:51:02,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-28 22:51:02,736 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:02,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-28 22:51:02,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-28 22:51:02,737 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-28 22:51:02,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:02,998 INFO L93 Difference]: Finished difference Result 9034 states and 10245 transitions. [2021-10-28 22:51:02,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:51:02,999 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-28 22:51:02,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:03,002 INFO L225 Difference]: With dead ends: 9034 [2021-10-28 22:51:03,003 INFO L226 Difference]: Without dead ends: 1873 [2021-10-28 22:51:03,010 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:51:03,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2021-10-28 22:51:03,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1873. [2021-10-28 22:51:03,180 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-28 22:51:03,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 2014 transitions. [2021-10-28 22:51:03,183 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 2014 transitions. Word has length 150 [2021-10-28 22:51:03,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:03,184 INFO L470 AbstractCegarLoop]: Abstraction has 1873 states and 2014 transitions. [2021-10-28 22:51:03,184 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-28 22:51:03,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 2014 transitions. [2021-10-28 22:51:03,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2021-10-28 22:51:03,187 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:03,187 INFO L513 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-28 22:51:03,188 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-10-28 22:51:03,188 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:03,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:03,189 INFO L85 PathProgramCache]: Analyzing trace with hash -1275276035, now seen corresponding path program 1 times [2021-10-28 22:51:03,189 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:03,189 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071392959] [2021-10-28 22:51:03,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:03,189 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:03,246 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-28 22:51:03,246 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:03,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071392959] [2021-10-28 22:51:03,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071392959] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:03,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:03,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:51:03,248 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18838668] [2021-10-28 22:51:03,249 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:51:03,249 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:03,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:51:03,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:03,250 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-28 22:51:03,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:03,402 INFO L93 Difference]: Finished difference Result 2511 states and 2705 transitions. [2021-10-28 22:51:03,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:51:03,403 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-28 22:51:03,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:03,405 INFO L225 Difference]: With dead ends: 2511 [2021-10-28 22:51:03,405 INFO L226 Difference]: Without dead ends: 1507 [2021-10-28 22:51:03,409 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:03,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states. [2021-10-28 22:51:03,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2021-10-28 22:51:03,546 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-28 22:51:03,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1613 transitions. [2021-10-28 22:51:03,549 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1613 transitions. Word has length 150 [2021-10-28 22:51:03,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:03,551 INFO L470 AbstractCegarLoop]: Abstraction has 1507 states and 1613 transitions. [2021-10-28 22:51:03,551 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-28 22:51:03,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1613 transitions. [2021-10-28 22:51:03,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2021-10-28 22:51:03,554 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:03,554 INFO L513 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-28 22:51:03,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-10-28 22:51:03,555 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:03,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:03,556 INFO L85 PathProgramCache]: Analyzing trace with hash -660923245, now seen corresponding path program 1 times [2021-10-28 22:51:03,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:03,557 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521339690] [2021-10-28 22:51:03,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:03,557 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:03,698 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-28 22:51:03,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:03,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521339690] [2021-10-28 22:51:03,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521339690] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:03,699 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:03,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-28 22:51:03,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225504076] [2021-10-28 22:51:03,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-28 22:51:03,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:03,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-28 22:51:03,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:51:03,701 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-28 22:51:03,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:03,902 INFO L93 Difference]: Finished difference Result 1507 states and 1613 transitions. [2021-10-28 22:51:03,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-28 22:51:03,902 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-28 22:51:03,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:03,905 INFO L225 Difference]: With dead ends: 1507 [2021-10-28 22:51:03,905 INFO L226 Difference]: Without dead ends: 1505 [2021-10-28 22:51:03,906 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-28 22:51:03,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2021-10-28 22:51:04,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2021-10-28 22:51:04,068 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-28 22:51:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 1610 transitions. [2021-10-28 22:51:04,070 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 1610 transitions. Word has length 152 [2021-10-28 22:51:04,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:04,071 INFO L470 AbstractCegarLoop]: Abstraction has 1505 states and 1610 transitions. [2021-10-28 22:51:04,071 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-28 22:51:04,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 1610 transitions. [2021-10-28 22:51:04,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2021-10-28 22:51:04,074 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:04,074 INFO L513 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-28 22:51:04,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-10-28 22:51:04,075 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:04,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:04,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1317806111, now seen corresponding path program 1 times [2021-10-28 22:51:04,075 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:04,075 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605384672] [2021-10-28 22:51:04,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:04,076 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-28 22:51:04,125 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-28 22:51:04,126 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-28 22:51:04,126 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605384672] [2021-10-28 22:51:04,126 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605384672] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-28 22:51:04,126 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-28 22:51:04,126 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-28 22:51:04,127 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648536376] [2021-10-28 22:51:04,127 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-28 22:51:04,127 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-28 22:51:04,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-28 22:51:04,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:04,128 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-28 22:51:04,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-28 22:51:04,350 INFO L93 Difference]: Finished difference Result 2761 states and 2943 transitions. [2021-10-28 22:51:04,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-28 22:51:04,351 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-28 22:51:04,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-28 22:51:04,354 INFO L225 Difference]: With dead ends: 2761 [2021-10-28 22:51:04,354 INFO L226 Difference]: Without dead ends: 2125 [2021-10-28 22:51:04,356 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-28 22:51:04,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2125 states. [2021-10-28 22:51:04,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2125 to 1507. [2021-10-28 22:51:04,490 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-28 22:51:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1612 transitions. [2021-10-28 22:51:04,491 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1612 transitions. Word has length 156 [2021-10-28 22:51:04,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-28 22:51:04,492 INFO L470 AbstractCegarLoop]: Abstraction has 1507 states and 1612 transitions. [2021-10-28 22:51:04,492 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-28 22:51:04,492 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1612 transitions. [2021-10-28 22:51:04,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2021-10-28 22:51:04,495 INFO L505 BasicCegarLoop]: Found error trace [2021-10-28 22:51:04,495 INFO L513 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-28 22:51:04,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2021-10-28 22:51:04,496 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-10-28 22:51:04,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-28 22:51:04,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1860246650, now seen corresponding path program 1 times [2021-10-28 22:51:04,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-28 22:51:04,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038433901] [2021-10-28 22:51:04,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-28 22:51:04,497 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-28 22:51:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:51:04,517 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-28 22:51:04,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-28 22:51:04,601 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-10-28 22:51:04,602 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-28 22:51:04,602 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:51:04,604 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-28 22:51:04,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2021-10-28 22:51:04,608 INFO L731 BasicCegarLoop]: Path program 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] [2021-10-28 22:51:04,612 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-28 22:51:04,766 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.10 10:51:04 BoogieIcfgContainer [2021-10-28 22:51:04,766 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-28 22:51:04,767 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-28 22:51:04,767 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-28 22:51:04,767 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-28 22:51:04,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 10:50:49" (3/4) ... [2021-10-28 22:51:04,769 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-28 22:51:04,907 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/bin/uautomizer-GMMbpWq8iD/witness.graphml [2021-10-28 22:51:04,907 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-28 22:51:04,909 INFO L168 Benchmark]: Toolchain (without parser) took 16348.84 ms. Allocated memory was 88.1 MB in the beginning and 2.1 GB in the end (delta: 2.1 GB). Free memory was 52.4 MB in the beginning and 1.2 GB in the end (delta: -1.2 GB). Peak memory consumption was 872.2 MB. Max. memory is 16.1 GB. [2021-10-28 22:51:04,909 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 88.1 MB. Free memory was 69.3 MB in the beginning and 69.2 MB in the end (delta: 83.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-28 22:51:04,910 INFO L168 Benchmark]: CACSL2BoogieTranslator took 381.74 ms. Allocated memory is still 88.1 MB. Free memory was 52.1 MB in the beginning and 61.9 MB in the end (delta: -9.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-28 22:51:04,910 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.89 ms. Allocated memory is still 88.1 MB. Free memory was 61.9 MB in the beginning and 58.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-28 22:51:04,910 INFO L168 Benchmark]: Boogie Preprocessor took 72.52 ms. Allocated memory is still 88.1 MB. Free memory was 58.8 MB in the beginning and 56.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-28 22:51:04,911 INFO L168 Benchmark]: RCFGBuilder took 766.45 ms. Allocated memory was 88.1 MB in the beginning and 117.4 MB in the end (delta: 29.4 MB). Free memory was 56.0 MB in the beginning and 88.9 MB in the end (delta: -32.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 16.1 GB. [2021-10-28 22:51:04,911 INFO L168 Benchmark]: TraceAbstraction took 14913.74 ms. Allocated memory was 117.4 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 88.4 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 856.4 MB. Max. memory is 16.1 GB. [2021-10-28 22:51:04,912 INFO L168 Benchmark]: Witness Printer took 140.52 ms. Allocated memory is still 2.1 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-10-28 22:51:04,914 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.25 ms. Allocated memory is still 88.1 MB. Free memory was 69.3 MB in the beginning and 69.2 MB in the end (delta: 83.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 381.74 ms. Allocated memory is still 88.1 MB. Free memory was 52.1 MB in the beginning and 61.9 MB in the end (delta: -9.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 59.89 ms. Allocated memory is still 88.1 MB. Free memory was 61.9 MB in the beginning and 58.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 72.52 ms. Allocated memory is still 88.1 MB. Free memory was 58.8 MB in the beginning and 56.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 766.45 ms. Allocated memory was 88.1 MB in the beginning and 117.4 MB in the end (delta: 29.4 MB). Free memory was 56.0 MB in the beginning and 88.9 MB in the end (delta: -32.9 MB). Peak memory consumption was 26.9 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14913.74 ms. Allocated memory was 117.4 MB in the beginning and 2.1 GB in the end (delta: 2.0 GB). Free memory was 88.4 MB in the beginning and 1.3 GB in the end (delta: -1.2 GB). Peak memory consumption was 856.4 MB. Max. memory is 16.1 GB. * Witness Printer took 140.52 ms. Allocated memory is still 2.1 GB. Free memory was 1.3 GB in the beginning and 1.2 GB in the end (delta: 23.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s 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: 14.6s, OverallIterations: 27, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 8823 SDtfs, 9607 SDslu, 7212 SDs, 0 SdLazy, 639 SolverSat, 230 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 101 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s 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.0s DumpTime, AutomataMinimizationStatistics: 5.5s AutomataMinimizationTime, 26 MinimizatonAttempts, 5348 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s 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-28 22:51:04,966 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08735c7b-3e70-42b7-800a-8eb5a98fd1a0/bin/uautomizer-GMMbpWq8iD/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...