./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 839c364b Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366375b1-3499-45f6-808c-2a348a1ac637/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366375b1-3499-45f6-808c-2a348a1ac637/bin/uautomizer-DrprNOufMa/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366375b1-3499-45f6-808c-2a348a1ac637/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366375b1-3499-45f6-808c-2a348a1ac637/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366375b1-3499-45f6-808c-2a348a1ac637/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366375b1-3499-45f6-808c-2a348a1ac637/bin/uautomizer-DrprNOufMa --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 c106345e9477571987e92ea289ca141c8dda13e5ec4cb633eccf96e295486f4c --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-06 22:52:49,702 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-06 22:52:49,703 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-06 22:52:49,725 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-06 22:52:49,726 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-06 22:52:49,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-06 22:52:49,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-06 22:52:49,730 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-06 22:52:49,731 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-06 22:52:49,732 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-06 22:52:49,733 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-06 22:52:49,734 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-06 22:52:49,734 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-06 22:52:49,735 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-06 22:52:49,736 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-06 22:52:49,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-06 22:52:49,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-06 22:52:49,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-06 22:52:49,741 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-06 22:52:49,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-06 22:52:49,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-06 22:52:49,745 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-06 22:52:49,746 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-06 22:52:49,747 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-06 22:52:49,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-06 22:52:49,750 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-06 22:52:49,750 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-06 22:52:49,751 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-06 22:52:49,751 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-06 22:52:49,752 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-06 22:52:49,753 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-06 22:52:49,753 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-06 22:52:49,754 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-06 22:52:49,754 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-06 22:52:49,755 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-06 22:52:49,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-06 22:52:49,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-06 22:52:49,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-06 22:52:49,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-06 22:52:49,757 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-06 22:52:49,757 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-06 22:52:49,758 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366375b1-3499-45f6-808c-2a348a1ac637/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-06 22:52:49,776 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-06 22:52:49,776 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-06 22:52:49,776 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-06 22:52:49,776 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-06 22:52:49,777 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-06 22:52:49,777 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-06 22:52:49,777 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-06 22:52:49,778 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-06 22:52:49,778 INFO L138 SettingsManager]: * Use SBE=true [2021-12-06 22:52:49,778 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-06 22:52:49,778 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-06 22:52:49,778 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-06 22:52:49,778 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-06 22:52:49,778 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-06 22:52:49,778 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-06 22:52:49,779 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-06 22:52:49,779 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-06 22:52:49,779 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-06 22:52:49,779 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-06 22:52:49,779 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-06 22:52:49,779 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-06 22:52:49,779 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-06 22:52:49,779 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-06 22:52:49,779 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-06 22:52:49,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:52:49,780 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-06 22:52:49,780 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-06 22:52:49,780 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-06 22:52:49,780 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-06 22:52:49,780 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-06 22:52:49,780 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-06 22:52:49,780 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-06 22:52:49,780 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-06 22:52:49,781 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-06 22:52:49,781 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_366375b1-3499-45f6-808c-2a348a1ac637/bin/uautomizer-DrprNOufMa/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_366375b1-3499-45f6-808c-2a348a1ac637/bin/uautomizer-DrprNOufMa 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 -> c106345e9477571987e92ea289ca141c8dda13e5ec4cb633eccf96e295486f4c [2021-12-06 22:52:49,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-06 22:52:49,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-06 22:52:49,994 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-06 22:52:49,995 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-06 22:52:49,995 INFO L275 PluginConnector]: CDTParser initialized [2021-12-06 22:52:49,996 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366375b1-3499-45f6-808c-2a348a1ac637/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2021-12-06 22:52:50,040 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366375b1-3499-45f6-808c-2a348a1ac637/bin/uautomizer-DrprNOufMa/data/dd27869ae/2e91c375cad64f8f96613ad229836cd5/FLAGd07540379 [2021-12-06 22:52:50,433 INFO L306 CDTParser]: Found 1 translation units. [2021-12-06 22:52:50,433 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366375b1-3499-45f6-808c-2a348a1ac637/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2021-12-06 22:52:50,441 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366375b1-3499-45f6-808c-2a348a1ac637/bin/uautomizer-DrprNOufMa/data/dd27869ae/2e91c375cad64f8f96613ad229836cd5/FLAGd07540379 [2021-12-06 22:52:50,451 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366375b1-3499-45f6-808c-2a348a1ac637/bin/uautomizer-DrprNOufMa/data/dd27869ae/2e91c375cad64f8f96613ad229836cd5 [2021-12-06 22:52:50,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-06 22:52:50,453 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-06 22:52:50,455 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-06 22:52:50,455 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-06 22:52:50,457 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-06 22:52:50,458 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:52:50" (1/1) ... [2021-12-06 22:52:50,458 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@68f15c59 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:50, skipping insertion in model container [2021-12-06 22:52:50,459 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.12 10:52:50" (1/1) ... [2021-12-06 22:52:50,464 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-06 22:52:50,491 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-06 22:52:50,614 WARN L230 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_366375b1-3499-45f6-808c-2a348a1ac637/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[914,927] [2021-12-06 22:52:50,647 WARN L230 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_366375b1-3499-45f6-808c-2a348a1ac637/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[7125,7138] [2021-12-06 22:52:50,670 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:52:50,677 INFO L203 MainTranslator]: Completed pre-run [2021-12-06 22:52:50,685 WARN L230 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_366375b1-3499-45f6-808c-2a348a1ac637/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[914,927] [2021-12-06 22:52:50,699 WARN L230 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_366375b1-3499-45f6-808c-2a348a1ac637/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.02.cil-1.c[7125,7138] [2021-12-06 22:52:50,715 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-06 22:52:50,730 INFO L208 MainTranslator]: Completed translation [2021-12-06 22:52:50,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:50 WrapperNode [2021-12-06 22:52:50,730 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-06 22:52:50,731 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-06 22:52:50,731 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-06 22:52:50,732 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-06 22:52:50,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:50" (1/1) ... [2021-12-06 22:52:50,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:50" (1/1) ... [2021-12-06 22:52:50,779 INFO L137 Inliner]: procedures = 57, calls = 64, calls flagged for inlining = 26, calls inlined = 26, statements flattened = 461 [2021-12-06 22:52:50,780 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-06 22:52:50,781 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-06 22:52:50,781 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-06 22:52:50,781 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-06 22:52:50,790 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:50" (1/1) ... [2021-12-06 22:52:50,790 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:50" (1/1) ... [2021-12-06 22:52:50,794 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:50" (1/1) ... [2021-12-06 22:52:50,794 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:50" (1/1) ... [2021-12-06 22:52:50,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:50" (1/1) ... [2021-12-06 22:52:50,814 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:50" (1/1) ... [2021-12-06 22:52:50,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:50" (1/1) ... [2021-12-06 22:52:50,820 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-06 22:52:50,821 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-06 22:52:50,821 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-06 22:52:50,821 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-06 22:52:50,822 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:50" (1/1) ... [2021-12-06 22:52:50,828 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-06 22:52:50,836 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366375b1-3499-45f6-808c-2a348a1ac637/bin/uautomizer-DrprNOufMa/z3 [2021-12-06 22:52:50,845 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366375b1-3499-45f6-808c-2a348a1ac637/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-06 22:52:50,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366375b1-3499-45f6-808c-2a348a1ac637/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-06 22:52:50,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-06 22:52:50,882 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-06 22:52:50,882 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-06 22:52:50,882 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-06 22:52:50,882 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-06 22:52:50,882 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-06 22:52:50,882 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-06 22:52:50,882 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-06 22:52:50,882 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-06 22:52:50,882 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-06 22:52:50,883 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-06 22:52:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-06 22:52:50,883 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-06 22:52:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-06 22:52:50,883 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-06 22:52:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-06 22:52:50,883 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-06 22:52:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-06 22:52:50,883 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-06 22:52:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-06 22:52:50,883 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-06 22:52:50,883 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-06 22:52:50,884 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-06 22:52:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-06 22:52:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-06 22:52:50,884 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-06 22:52:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-06 22:52:50,884 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-06 22:52:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-06 22:52:50,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-06 22:52:50,884 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-06 22:52:50,884 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-06 22:52:50,949 INFO L236 CfgBuilder]: Building ICFG [2021-12-06 22:52:50,951 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-06 22:52:51,256 INFO L277 CfgBuilder]: Performing block encoding [2021-12-06 22:52:51,263 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-06 22:52:51,264 INFO L301 CfgBuilder]: Removed 9 assume(true) statements. [2021-12-06 22:52:51,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:52:51 BoogieIcfgContainer [2021-12-06 22:52:51,265 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-06 22:52:51,267 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-06 22:52:51,267 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-06 22:52:51,269 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-06 22:52:51,269 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.12 10:52:50" (1/3) ... [2021-12-06 22:52:51,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fdf7698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:52:51, skipping insertion in model container [2021-12-06 22:52:51,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.12 10:52:50" (2/3) ... [2021-12-06 22:52:51,270 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fdf7698 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.12 10:52:51, skipping insertion in model container [2021-12-06 22:52:51,270 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:52:51" (3/3) ... [2021-12-06 22:52:51,271 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.02.cil-1.c [2021-12-06 22:52:51,275 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-06 22:52:51,275 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-06 22:52:51,310 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-06 22:52:51,315 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-12-06 22:52:51,315 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-06 22:52:51,337 INFO L276 IsEmpty]: Start isEmpty. Operand has 234 states, 186 states have (on average 1.553763440860215) internal successors, (289), 193 states have internal predecessors, (289), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2021-12-06 22:52:51,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 22:52:51,344 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:52:51,345 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:52:51,345 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:52:51,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:51,349 INFO L85 PathProgramCache]: Analyzing trace with hash 381071048, now seen corresponding path program 1 times [2021-12-06 22:52:51,356 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:51,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830246376] [2021-12-06 22:52:51,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:51,357 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:51,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:51,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 22:52:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:51,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 22:52:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:51,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 22:52:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:51,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 22:52:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:51,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:52:51,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:51,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 22:52:51,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:51,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 22:52:51,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:51,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:52:51,573 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:51,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830246376] [2021-12-06 22:52:51,574 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830246376] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:52:51,574 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:52:51,574 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-06 22:52:51,575 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032515590] [2021-12-06 22:52:51,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:51,579 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-06 22:52:51,579 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:51,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-06 22:52:51,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-12-06 22:52:51,608 INFO L87 Difference]: Start difference. First operand has 234 states, 186 states have (on average 1.553763440860215) internal successors, (289), 193 states have internal predecessors, (289), 31 states have call successors, (31), 14 states have call predecessors, (31), 14 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 22:52:51,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:52:51,955 INFO L93 Difference]: Finished difference Result 469 states and 703 transitions. [2021-12-06 22:52:51,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-06 22:52:51,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-06 22:52:51,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:52:51,968 INFO L225 Difference]: With dead ends: 469 [2021-12-06 22:52:51,968 INFO L226 Difference]: Without dead ends: 242 [2021-12-06 22:52:51,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-06 22:52:51,976 INFO L933 BasicCegarLoop]: 324 mSDtfsCounter, 459 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 469 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 22:52:51,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [469 Valid, 730 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 22:52:51,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2021-12-06 22:52:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 224. [2021-12-06 22:52:52,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 178 states have (on average 1.449438202247191) internal successors, (258), 183 states have internal predecessors, (258), 31 states have call successors, (31), 14 states have call predecessors, (31), 13 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2021-12-06 22:52:52,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 317 transitions. [2021-12-06 22:52:52,035 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 317 transitions. Word has length 59 [2021-12-06 22:52:52,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:52:52,036 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 317 transitions. [2021-12-06 22:52:52,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 1 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 22:52:52,036 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 317 transitions. [2021-12-06 22:52:52,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 22:52:52,039 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:52:52,039 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:52:52,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-06 22:52:52,040 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:52:52,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:52,040 INFO L85 PathProgramCache]: Analyzing trace with hash 862151306, now seen corresponding path program 1 times [2021-12-06 22:52:52,040 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:52,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046255724] [2021-12-06 22:52:52,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:52,041 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:52,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:52,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 22:52:52,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:52,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 22:52:52,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:52,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 22:52:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:52,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 22:52:52,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:52,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:52:52,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:52,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 22:52:52,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:52,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 22:52:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:52,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:52:52,140 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:52,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046255724] [2021-12-06 22:52:52,141 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046255724] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:52:52,141 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:52:52,141 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 22:52:52,141 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497720256] [2021-12-06 22:52:52,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:52,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 22:52:52,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:52,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 22:52:52,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:52:52,143 INFO L87 Difference]: Start difference. First operand 224 states and 317 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 22:52:52,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:52:52,580 INFO L93 Difference]: Finished difference Result 449 states and 633 transitions. [2021-12-06 22:52:52,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-06 22:52:52,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-06 22:52:52,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:52:52,585 INFO L225 Difference]: With dead ends: 449 [2021-12-06 22:52:52,586 INFO L226 Difference]: Without dead ends: 360 [2021-12-06 22:52:52,587 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2021-12-06 22:52:52,588 INFO L933 BasicCegarLoop]: 322 mSDtfsCounter, 598 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 174 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 22:52:52,589 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [603 Valid, 1071 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [174 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 22:52:52,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-12-06 22:52:52,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 320. [2021-12-06 22:52:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 254 states have (on average 1.4251968503937007) internal successors, (362), 261 states have internal predecessors, (362), 42 states have call successors, (42), 21 states have call predecessors, (42), 22 states have return successors, (44), 40 states have call predecessors, (44), 39 states have call successors, (44) [2021-12-06 22:52:52,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 448 transitions. [2021-12-06 22:52:52,626 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 448 transitions. Word has length 59 [2021-12-06 22:52:52,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:52:52,626 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 448 transitions. [2021-12-06 22:52:52,626 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 5 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 22:52:52,626 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 448 transitions. [2021-12-06 22:52:52,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 22:52:52,629 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:52:52,629 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:52:52,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-06 22:52:52,629 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:52:52,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:52,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1624800937, now seen corresponding path program 1 times [2021-12-06 22:52:52,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:52,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723043046] [2021-12-06 22:52:52,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:52,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:52,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:52,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 22:52:52,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:52,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 22:52:52,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:52,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 22:52:52,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:52,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 22:52:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:52,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:52:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:52,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 22:52:52,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:52,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 22:52:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:52:52,741 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:52,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723043046] [2021-12-06 22:52:52,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723043046] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:52:52,741 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:52:52,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 22:52:52,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079376778] [2021-12-06 22:52:52,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:52,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 22:52:52,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:52,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 22:52:52,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 22:52:52,743 INFO L87 Difference]: Start difference. First operand 320 states and 448 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 22:52:53,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:52:53,091 INFO L93 Difference]: Finished difference Result 535 states and 743 transitions. [2021-12-06 22:52:53,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-06 22:52:53,092 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2021-12-06 22:52:53,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:52:53,095 INFO L225 Difference]: With dead ends: 535 [2021-12-06 22:52:53,095 INFO L226 Difference]: Without dead ends: 357 [2021-12-06 22:52:53,096 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2021-12-06 22:52:53,097 INFO L933 BasicCegarLoop]: 304 mSDtfsCounter, 368 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 630 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1373 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-06 22:52:53,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [369 Valid, 1373 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 630 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-06 22:52:53,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2021-12-06 22:52:53,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 325. [2021-12-06 22:52:53,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 258 states have (on average 1.4147286821705427) internal successors, (365), 265 states have internal predecessors, (365), 42 states have call successors, (42), 21 states have call predecessors, (42), 23 states have return successors, (45), 41 states have call predecessors, (45), 39 states have call successors, (45) [2021-12-06 22:52:53,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 452 transitions. [2021-12-06 22:52:53,119 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 452 transitions. Word has length 59 [2021-12-06 22:52:53,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:52:53,120 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 452 transitions. [2021-12-06 22:52:53,120 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 22:52:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 452 transitions. [2021-12-06 22:52:53,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 22:52:53,122 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:52:53,122 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:52:53,122 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-06 22:52:53,122 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:52:53,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:53,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1899560551, now seen corresponding path program 1 times [2021-12-06 22:52:53,123 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:53,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180280607] [2021-12-06 22:52:53,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:53,123 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:53,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 22:52:53,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:53,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 22:52:53,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:53,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 22:52:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:53,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 22:52:53,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:53,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:52:53,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:53,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 22:52:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:53,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 22:52:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:53,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:52:53,211 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:53,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180280607] [2021-12-06 22:52:53,212 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180280607] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:52:53,212 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:52:53,212 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-06 22:52:53,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146174512] [2021-12-06 22:52:53,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:53,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-06 22:52:53,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:53,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-06 22:52:53,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2021-12-06 22:52:53,214 INFO L87 Difference]: Start difference. First operand 325 states and 452 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-06 22:52:54,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:52:54,233 INFO L93 Difference]: Finished difference Result 1239 states and 1680 transitions. [2021-12-06 22:52:54,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-06 22:52:54,234 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2021-12-06 22:52:54,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:52:54,240 INFO L225 Difference]: With dead ends: 1239 [2021-12-06 22:52:54,240 INFO L226 Difference]: Without dead ends: 1044 [2021-12-06 22:52:54,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2021-12-06 22:52:54,243 INFO L933 BasicCegarLoop]: 429 mSDtfsCounter, 2085 mSDsluCounter, 1043 mSDsCounter, 0 mSdLazyCounter, 1285 mSolverCounterSat, 607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2101 SdHoareTripleChecker+Valid, 1472 SdHoareTripleChecker+Invalid, 1892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 607 IncrementalHoareTripleChecker+Valid, 1285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-06 22:52:54,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2101 Valid, 1472 Invalid, 1892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [607 Valid, 1285 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-06 22:52:54,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1044 states. [2021-12-06 22:52:54,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1044 to 906. [2021-12-06 22:52:54,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 720 states have (on average 1.3611111111111112) internal successors, (980), 735 states have internal predecessors, (980), 99 states have call successors, (99), 74 states have call predecessors, (99), 85 states have return successors, (114), 98 states have call predecessors, (114), 96 states have call successors, (114) [2021-12-06 22:52:54,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1193 transitions. [2021-12-06 22:52:54,299 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1193 transitions. Word has length 59 [2021-12-06 22:52:54,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:52:54,299 INFO L470 AbstractCegarLoop]: Abstraction has 906 states and 1193 transitions. [2021-12-06 22:52:54,300 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 7 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-06 22:52:54,300 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1193 transitions. [2021-12-06 22:52:54,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 22:52:54,301 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:52:54,301 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:52:54,301 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-06 22:52:54,301 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:52:54,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:54,301 INFO L85 PathProgramCache]: Analyzing trace with hash 927885864, now seen corresponding path program 1 times [2021-12-06 22:52:54,302 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:54,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965404002] [2021-12-06 22:52:54,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:54,302 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:54,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 22:52:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:54,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 22:52:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:54,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 22:52:54,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:54,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 22:52:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:54,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:52:54,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:54,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 22:52:54,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:54,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 22:52:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:52:54,385 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:54,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965404002] [2021-12-06 22:52:54,385 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965404002] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:52:54,386 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:52:54,386 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-06 22:52:54,386 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112809792] [2021-12-06 22:52:54,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:54,386 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-06 22:52:54,386 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:54,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-06 22:52:54,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-06 22:52:54,387 INFO L87 Difference]: Start difference. First operand 906 states and 1193 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 22:52:54,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:52:54,726 INFO L93 Difference]: Finished difference Result 1788 states and 2337 transitions. [2021-12-06 22:52:54,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-06 22:52:54,727 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) Word has length 59 [2021-12-06 22:52:54,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:52:54,732 INFO L225 Difference]: With dead ends: 1788 [2021-12-06 22:52:54,732 INFO L226 Difference]: Without dead ends: 1018 [2021-12-06 22:52:54,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-06 22:52:54,735 INFO L933 BasicCegarLoop]: 301 mSDtfsCounter, 369 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 1360 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-06 22:52:54,735 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 1360 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-06 22:52:54,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1018 states. [2021-12-06 22:52:54,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1018 to 926. [2021-12-06 22:52:54,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 926 states, 736 states have (on average 1.346467391304348) internal successors, (991), 751 states have internal predecessors, (991), 99 states have call successors, (99), 74 states have call predecessors, (99), 89 states have return successors, (118), 102 states have call predecessors, (118), 96 states have call successors, (118) [2021-12-06 22:52:54,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1208 transitions. [2021-12-06 22:52:54,784 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1208 transitions. Word has length 59 [2021-12-06 22:52:54,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:52:54,785 INFO L470 AbstractCegarLoop]: Abstraction has 926 states and 1208 transitions. [2021-12-06 22:52:54,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 5 states have internal predecessors, (44), 2 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 2 states have call successors, (7) [2021-12-06 22:52:54,785 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1208 transitions. [2021-12-06 22:52:54,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 22:52:54,786 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:52:54,786 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:52:54,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-06 22:52:54,786 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:52:54,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:54,786 INFO L85 PathProgramCache]: Analyzing trace with hash -877552470, now seen corresponding path program 1 times [2021-12-06 22:52:54,786 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:54,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963113827] [2021-12-06 22:52:54,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:54,787 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:54,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-06 22:52:54,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:54,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-06 22:52:54,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:54,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-06 22:52:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:54,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-06 22:52:54,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:54,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-06 22:52:54,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:54,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-06 22:52:54,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:54,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-06 22:52:54,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-06 22:52:54,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-06 22:52:54,865 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-06 22:52:54,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963113827] [2021-12-06 22:52:54,865 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963113827] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-06 22:52:54,865 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-06 22:52:54,866 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-06 22:52:54,866 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485183356] [2021-12-06 22:52:54,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-06 22:52:54,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-06 22:52:54,866 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-06 22:52:54,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-06 22:52:54,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-06 22:52:54,867 INFO L87 Difference]: Start difference. First operand 926 states and 1208 transitions. Second operand has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 22:52:55,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-06 22:52:55,407 INFO L93 Difference]: Finished difference Result 2496 states and 3157 transitions. [2021-12-06 22:52:55,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-06 22:52:55,407 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 59 [2021-12-06 22:52:55,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-06 22:52:55,418 INFO L225 Difference]: With dead ends: 2496 [2021-12-06 22:52:55,418 INFO L226 Difference]: Without dead ends: 1707 [2021-12-06 22:52:55,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-12-06 22:52:55,421 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 637 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 656 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-06 22:52:55,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [656 Valid, 1118 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-06 22:52:55,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2021-12-06 22:52:55,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1374. [2021-12-06 22:52:55,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1089 states have (on average 1.322314049586777) internal successors, (1440), 1113 states have internal predecessors, (1440), 145 states have call successors, (145), 113 states have call predecessors, (145), 138 states have return successors, (190), 150 states have call predecessors, (190), 142 states have call successors, (190) [2021-12-06 22:52:55,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1775 transitions. [2021-12-06 22:52:55,482 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1775 transitions. Word has length 59 [2021-12-06 22:52:55,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-06 22:52:55,482 INFO L470 AbstractCegarLoop]: Abstraction has 1374 states and 1775 transitions. [2021-12-06 22:52:55,483 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.5) internal successors, (44), 6 states have internal predecessors, (44), 3 states have call successors, (8), 5 states have call predecessors, (8), 3 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2021-12-06 22:52:55,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1775 transitions. [2021-12-06 22:52:55,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-06 22:52:55,484 INFO L506 BasicCegarLoop]: Found error trace [2021-12-06 22:52:55,484 INFO L514 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:52:55,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-06 22:52:55,484 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-06 22:52:55,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-06 22:52:55,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1423270120, now seen corresponding path program 1 times [2021-12-06 22:52:55,484 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-06 22:52:55,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441458767] [2021-12-06 22:52:55,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-06 22:52:55,485 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-06 22:52:55,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:52:55,494 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-06 22:52:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-06 22:52:55,533 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-06 22:52:55,533 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-06 22:52:55,534 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-06 22:52:55,535 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-06 22:52:55,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-06 22:52:55,539 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2021-12-06 22:52:55,541 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-06 22:52:55,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.12 10:52:55 BoogieIcfgContainer [2021-12-06 22:52:55,618 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-06 22:52:55,619 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-06 22:52:55,619 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-06 22:52:55,619 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-06 22:52:55,619 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.12 10:52:51" (3/4) ... [2021-12-06 22:52:55,620 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-06 22:52:55,689 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366375b1-3499-45f6-808c-2a348a1ac637/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-06 22:52:55,689 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-06 22:52:55,689 INFO L158 Benchmark]: Toolchain (without parser) took 5235.94ms. Allocated memory was 109.1MB in the beginning and 148.9MB in the end (delta: 39.8MB). Free memory was 68.2MB in the beginning and 116.2MB in the end (delta: -48.0MB). Peak memory consumption was 72.5MB. Max. memory is 16.1GB. [2021-12-06 22:52:55,690 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 109.1MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-12-06 22:52:55,690 INFO L158 Benchmark]: CACSL2BoogieTranslator took 276.28ms. Allocated memory is still 109.1MB. Free memory was 68.0MB in the beginning and 76.6MB in the end (delta: -8.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-06 22:52:55,690 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.54ms. Allocated memory is still 109.1MB. Free memory was 76.6MB in the beginning and 73.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-06 22:52:55,690 INFO L158 Benchmark]: Boogie Preprocessor took 39.57ms. Allocated memory is still 109.1MB. Free memory was 73.6MB in the beginning and 71.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-06 22:52:55,691 INFO L158 Benchmark]: RCFGBuilder took 444.67ms. Allocated memory is still 109.1MB. Free memory was 71.0MB in the beginning and 46.3MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-12-06 22:52:55,691 INFO L158 Benchmark]: TraceAbstraction took 4351.55ms. Allocated memory was 109.1MB in the beginning and 148.9MB in the end (delta: 39.8MB). Free memory was 45.9MB in the beginning and 46.9MB in the end (delta: -1.1MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2021-12-06 22:52:55,691 INFO L158 Benchmark]: Witness Printer took 70.39ms. Allocated memory is still 148.9MB. Free memory was 46.9MB in the beginning and 116.2MB in the end (delta: -69.3MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2021-12-06 22:52:55,693 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.21ms. Allocated memory is still 109.1MB. Free memory is still 84.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 276.28ms. Allocated memory is still 109.1MB. Free memory was 68.0MB in the beginning and 76.6MB in the end (delta: -8.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.54ms. Allocated memory is still 109.1MB. Free memory was 76.6MB in the beginning and 73.6MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.57ms. Allocated memory is still 109.1MB. Free memory was 73.6MB in the beginning and 71.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 444.67ms. Allocated memory is still 109.1MB. Free memory was 71.0MB in the beginning and 46.3MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 4351.55ms. Allocated memory was 109.1MB in the beginning and 148.9MB in the end (delta: 39.8MB). Free memory was 45.9MB in the beginning and 46.9MB in the end (delta: -1.1MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. * Witness Printer took 70.39ms. Allocated memory is still 148.9MB. Free memory was 46.9MB in the beginning and 116.2MB in the end (delta: -69.3MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. * 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: 28]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L33] int q_buf_0 ; [L34] int q_free ; [L35] int q_read_ev ; [L36] int q_write_ev ; [L37] int q_req_up ; [L38] int q_ev ; [L59] int p_num_write ; [L60] int p_last_write ; [L61] int p_dw_st ; [L62] int p_dw_pc ; [L63] int p_dw_i ; [L64] int c_num_read ; [L65] int c_last_read ; [L66] int c_dr_st ; [L67] int c_dr_pc ; [L68] int c_dr_i ; [L172] static int a_t ; [L500] int m_pc = 0; [L501] int t1_pc = 0; [L502] int t2_pc = 0; [L503] int m_st ; [L504] int t1_st ; [L505] int t2_st ; [L506] int m_i ; [L507] int t1_i ; [L508] int t2_i ; [L509] int M_E = 2; [L510] int T1_E = 2; [L511] int T2_E = 2; [L512] int E_M = 2; [L513] int E_1 = 2; [L514] int E_2 = 2; [L519] int token ; [L521] int local ; VAL [a_t=0, c_dr_i=0, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=0, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=0, q_read_ev=0, q_req_up=0, q_write_ev=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] [L1087] COND TRUE __VERIFIER_nondet_int() [L1088] CALL main1() [L474] int __retres1 ; [L478] CALL init_model1() [L460] q_free = 1 [L461] q_write_ev = 2 [L462] q_read_ev = q_write_ev [L463] p_num_write = 0 [L464] p_dw_pc = 0 [L465] p_dw_i = 1 [L466] c_num_read = 0 [L467] c_dr_pc = 0 [L468] c_dr_i = 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L478] RET init_model1() [L479] CALL start_simulation1() [L414] int kernel_st ; [L415] int tmp ; [L419] kernel_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L420] CALL update_channels1() VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L230] COND FALSE !((int )q_req_up == 1) VAL [\old(q_ev)=0, \old(q_read_ev)=2, \old(q_req_up)=0, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L420] RET update_channels1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L421] CALL init_threads1() [L245] COND TRUE (int )p_dw_i == 1 [L246] p_dw_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L250] COND TRUE (int )c_dr_i == 1 [L251] c_dr_st = 0 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L421] RET init_threads1() [L422] CALL fire_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L283] COND FALSE !((int )q_read_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L288] COND FALSE !((int )q_write_ev == 0) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L422] RET fire_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L423] CALL activate_threads1() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L316] int tmp ; [L317] int tmp___0 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L321] CALL, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L70] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L73] COND FALSE !((int )p_dw_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L83] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L85] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L321] RET, EXPR is_do_write_p_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, is_do_write_p_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L321] tmp = is_do_write_p_triggered() [L323] COND FALSE !(\read(tmp)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, tmp=0, token=0] [L329] CALL, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L89] int __retres1 ; VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L92] COND FALSE !((int )c_dr_pc == 1) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L102] __retres1 = 0 VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L104] return (__retres1); VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, \result=0, __retres1=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L329] RET, EXPR is_do_read_c_triggered() VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, is_do_read_c_triggered()=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, tmp=0, token=0] [L329] tmp___0 = is_do_read_c_triggered() [L331] COND FALSE !(\read(tmp___0)) VAL [\old(c_dr_st)=0, \old(p_dw_st)=0, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, tmp=0, tmp___0=0, token=0] [L423] RET activate_threads1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L424] CALL reset_delta_events1() VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L301] COND FALSE !((int )q_read_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L306] COND FALSE !((int )q_write_ev == 1) VAL [\old(q_read_ev)=2, \old(q_write_ev)=2, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L424] RET reset_delta_events1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L427] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, kernel_st=0, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L430] kernel_st = 1 [L431] CALL eval1() [L341] int tmp ; [L342] int tmp___0 ; [L343] int tmp___1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L347] COND TRUE 1 VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L350] CALL, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L260] int __retres1 ; VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L263] COND TRUE (int )p_dw_st == 0 [L264] __retres1 = 1 VAL [__retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L276] return (__retres1); VAL [\result=1, __retres1=1, a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L350] RET, EXPR exists_runnable_thread1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, exists_runnable_thread1()=1, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L350] tmp___1 = exists_runnable_thread1() [L352] COND TRUE \read(tmp___1) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, tmp___1=1, token=0] [L357] COND TRUE (int )p_dw_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0, tmp=0, tmp___1=1, token=0] [L367] CALL error1() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] [L28] reach_error() VAL [a_t=0, c_dr_i=1, c_dr_pc=0, c_dr_st=0, c_last_read=0, c_num_read=0, E_1=2, E_2=2, E_M=2, local=0, M_E=2, m_i=0, m_pc=0, m_st=0, p_dw_i=1, p_dw_pc=0, p_dw_st=0, p_last_write=0, p_num_write=0, q_buf_0=0, q_ev=0, q_free=1, q_read_ev=2, q_req_up=0, q_write_ev=2, 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] - UnprovableResult [Line: 496]: 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 15 procedures, 234 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4569 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4516 mSDsluCounter, 7124 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5121 mSDsCounter, 1259 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4089 IncrementalHoareTripleChecker+Invalid, 5348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1259 mSolverCounterUnsat, 2003 mSDtfsCounter, 4089 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 216 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 505 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1374occurred in iteration=6, InterpolantAutomatonStates: 92, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 6 MinimizatonAttempts, 653 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 733 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 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-12-06 22:52:55,733 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_366375b1-3499-45f6-808c-2a348a1ac637/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE