./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.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_d7638ae4-ff3c-4be9-932d-341b65f6c79f/bin/uautomizer-DrprNOufMa/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7638ae4-ff3c-4be9-932d-341b65f6c79f/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_d7638ae4-ff3c-4be9-932d-341b65f6c79f/bin/uautomizer-DrprNOufMa/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7638ae4-ff3c-4be9-932d-341b65f6c79f/bin/uautomizer-DrprNOufMa/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7638ae4-ff3c-4be9-932d-341b65f6c79f/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_d7638ae4-ff3c-4be9-932d-341b65f6c79f/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 5b66f84bda68703b1691af17c3dd17feb13fb8355b198d3c3fecdd456b0c3cb8 --- Real Ultimate output --- This is Ultimate 0.2.2-hotfix-svcomp22-839c364 [2021-12-07 00:32:02,762 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-07 00:32:02,764 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-07 00:32:02,793 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-07 00:32:02,794 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-07 00:32:02,795 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-07 00:32:02,797 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-07 00:32:02,799 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-07 00:32:02,801 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-07 00:32:02,802 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-07 00:32:02,803 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-07 00:32:02,805 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-07 00:32:02,805 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-07 00:32:02,806 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-07 00:32:02,808 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-07 00:32:02,809 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-07 00:32:02,810 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-07 00:32:02,811 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-07 00:32:02,813 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-07 00:32:02,815 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-07 00:32:02,817 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-07 00:32:02,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-07 00:32:02,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-07 00:32:02,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-07 00:32:02,824 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-07 00:32:02,825 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-07 00:32:02,825 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-07 00:32:02,826 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-07 00:32:02,826 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-07 00:32:02,827 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-07 00:32:02,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-07 00:32:02,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-07 00:32:02,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-07 00:32:02,829 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-07 00:32:02,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-07 00:32:02,830 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-07 00:32:02,831 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-07 00:32:02,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-07 00:32:02,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-07 00:32:02,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-07 00:32:02,832 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-07 00:32:02,833 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7638ae4-ff3c-4be9-932d-341b65f6c79f/bin/uautomizer-DrprNOufMa/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-07 00:32:02,855 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-07 00:32:02,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-07 00:32:02,856 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-07 00:32:02,856 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-07 00:32:02,857 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-07 00:32:02,857 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-07 00:32:02,858 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-07 00:32:02,858 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-07 00:32:02,858 INFO L138 SettingsManager]: * Use SBE=true [2021-12-07 00:32:02,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-07 00:32:02,859 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-07 00:32:02,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-07 00:32:02,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-07 00:32:02,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-07 00:32:02,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-07 00:32:02,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-07 00:32:02,859 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-07 00:32:02,860 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-07 00:32:02,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-07 00:32:02,860 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-07 00:32:02,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-07 00:32:02,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-07 00:32:02,861 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-07 00:32:02,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-07 00:32:02,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:32:02,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-07 00:32:02,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-07 00:32:02,861 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-07 00:32:02,862 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-07 00:32:02,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-07 00:32:02,862 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-07 00:32:02,862 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-07 00:32:02,862 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-07 00:32:02,863 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-07 00:32:02,863 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_d7638ae4-ff3c-4be9-932d-341b65f6c79f/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_d7638ae4-ff3c-4be9-932d-341b65f6c79f/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 -> 5b66f84bda68703b1691af17c3dd17feb13fb8355b198d3c3fecdd456b0c3cb8 [2021-12-07 00:32:03,037 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-07 00:32:03,052 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-07 00:32:03,054 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-07 00:32:03,055 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-07 00:32:03,056 INFO L275 PluginConnector]: CDTParser initialized [2021-12-07 00:32:03,057 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7638ae4-ff3c-4be9-932d-341b65f6c79f/bin/uautomizer-DrprNOufMa/../../sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2021-12-07 00:32:03,099 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7638ae4-ff3c-4be9-932d-341b65f6c79f/bin/uautomizer-DrprNOufMa/data/00b33eea5/8a2a6c35fd954933b8071e528b94bbf0/FLAG593d62885 [2021-12-07 00:32:03,504 INFO L306 CDTParser]: Found 1 translation units. [2021-12-07 00:32:03,504 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7638ae4-ff3c-4be9-932d-341b65f6c79f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2021-12-07 00:32:03,512 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7638ae4-ff3c-4be9-932d-341b65f6c79f/bin/uautomizer-DrprNOufMa/data/00b33eea5/8a2a6c35fd954933b8071e528b94bbf0/FLAG593d62885 [2021-12-07 00:32:03,523 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7638ae4-ff3c-4be9-932d-341b65f6c79f/bin/uautomizer-DrprNOufMa/data/00b33eea5/8a2a6c35fd954933b8071e528b94bbf0 [2021-12-07 00:32:03,526 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-07 00:32:03,527 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-07 00:32:03,528 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-07 00:32:03,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-07 00:32:03,531 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-07 00:32:03,531 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:32:03" (1/1) ... [2021-12-07 00:32:03,532 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24efcb1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:03, skipping insertion in model container [2021-12-07 00:32:03,532 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 12:32:03" (1/1) ... [2021-12-07 00:32:03,537 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-07 00:32:03,569 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-07 00:32:03,684 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_d7638ae4-ff3c-4be9-932d-341b65f6c79f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[914,927] [2021-12-07 00:32:03,716 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_d7638ae4-ff3c-4be9-932d-341b65f6c79f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[7125,7138] [2021-12-07 00:32:03,736 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:32:03,743 INFO L203 MainTranslator]: Completed pre-run [2021-12-07 00:32:03,751 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_d7638ae4-ff3c-4be9-932d-341b65f6c79f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[914,927] [2021-12-07 00:32:03,766 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_d7638ae4-ff3c-4be9-932d-341b65f6c79f/sv-benchmarks/c/combinations/pc_sfifo_2.cil-2+token_ring.01.cil-1.c[7125,7138] [2021-12-07 00:32:03,779 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-07 00:32:03,792 INFO L208 MainTranslator]: Completed translation [2021-12-07 00:32:03,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:03 WrapperNode [2021-12-07 00:32:03,793 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-07 00:32:03,793 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-07 00:32:03,793 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-07 00:32:03,793 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-07 00:32:03,799 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:03" (1/1) ... [2021-12-07 00:32:03,806 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:03" (1/1) ... [2021-12-07 00:32:03,831 INFO L137 Inliner]: procedures = 55, calls = 61, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 403 [2021-12-07 00:32:03,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-07 00:32:03,832 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-07 00:32:03,832 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-07 00:32:03,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-07 00:32:03,838 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:03" (1/1) ... [2021-12-07 00:32:03,839 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:03" (1/1) ... [2021-12-07 00:32:03,841 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:03" (1/1) ... [2021-12-07 00:32:03,841 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:03" (1/1) ... [2021-12-07 00:32:03,847 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:03" (1/1) ... [2021-12-07 00:32:03,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:03" (1/1) ... [2021-12-07 00:32:03,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:03" (1/1) ... [2021-12-07 00:32:03,858 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-07 00:32:03,859 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-07 00:32:03,859 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-07 00:32:03,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-07 00:32:03,860 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:03" (1/1) ... [2021-12-07 00:32:03,866 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-07 00:32:03,874 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7638ae4-ff3c-4be9-932d-341b65f6c79f/bin/uautomizer-DrprNOufMa/z3 [2021-12-07 00:32:03,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7638ae4-ff3c-4be9-932d-341b65f6c79f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-12-07 00:32:03,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7638ae4-ff3c-4be9-932d-341b65f6c79f/bin/uautomizer-DrprNOufMa/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-12-07 00:32:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-07 00:32:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2021-12-07 00:32:03,912 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2021-12-07 00:32:03,912 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_write_p_triggered [2021-12-07 00:32:03,913 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_write_p_triggered [2021-12-07 00:32:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2021-12-07 00:32:03,913 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2021-12-07 00:32:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2021-12-07 00:32:03,913 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2021-12-07 00:32:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events1 [2021-12-07 00:32:03,913 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events1 [2021-12-07 00:32:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2021-12-07 00:32:03,913 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2021-12-07 00:32:03,913 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2021-12-07 00:32:03,914 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2021-12-07 00:32:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads1 [2021-12-07 00:32:03,914 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads1 [2021-12-07 00:32:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure is_do_read_c_triggered [2021-12-07 00:32:03,914 INFO L138 BoogieDeclarations]: Found implementation of procedure is_do_read_c_triggered [2021-12-07 00:32:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels1 [2021-12-07 00:32:03,914 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels1 [2021-12-07 00:32:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2021-12-07 00:32:03,914 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2021-12-07 00:32:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-07 00:32:03,914 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2021-12-07 00:32:03,915 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2021-12-07 00:32:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events1 [2021-12-07 00:32:03,915 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events1 [2021-12-07 00:32:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-07 00:32:03,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-07 00:32:03,915 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2021-12-07 00:32:03,915 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2021-12-07 00:32:03,975 INFO L236 CfgBuilder]: Building ICFG [2021-12-07 00:32:03,976 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-07 00:32:04,260 INFO L277 CfgBuilder]: Performing block encoding [2021-12-07 00:32:04,268 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-07 00:32:04,269 INFO L301 CfgBuilder]: Removed 8 assume(true) statements. [2021-12-07 00:32:04,271 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:04 BoogieIcfgContainer [2021-12-07 00:32:04,271 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-07 00:32:04,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-07 00:32:04,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-07 00:32:04,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-07 00:32:04,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 12:32:03" (1/3) ... [2021-12-07 00:32:04,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423c112d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:32:04, skipping insertion in model container [2021-12-07 00:32:04,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 12:32:03" (2/3) ... [2021-12-07 00:32:04,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@423c112d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 12:32:04, skipping insertion in model container [2021-12-07 00:32:04,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:04" (3/3) ... [2021-12-07 00:32:04,278 INFO L111 eAbstractionObserver]: Analyzing ICFG pc_sfifo_2.cil-2+token_ring.01.cil-1.c [2021-12-07 00:32:04,283 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-07 00:32:04,283 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-07 00:32:04,337 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-07 00:32:04,344 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-07 00:32:04,345 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-12-07 00:32:04,367 INFO L276 IsEmpty]: Start isEmpty. Operand has 209 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 169 states have internal predecessors, (248), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2021-12-07 00:32:04,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-07 00:32:04,375 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:32:04,376 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-07 00:32:04,376 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:32:04,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:04,380 INFO L85 PathProgramCache]: Analyzing trace with hash 740240985, now seen corresponding path program 1 times [2021-12-07 00:32:04,387 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:04,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111189678] [2021-12-07 00:32:04,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:04,388 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:04,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:04,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:32:04,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:04,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 00:32:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:04,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 00:32:04,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:04,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 00:32:04,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:04,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 00:32:04,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:04,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-07 00:32:04,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:04,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-07 00:32:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:04,628 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-07 00:32:04,628 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:04,628 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111189678] [2021-12-07 00:32:04,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111189678] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:04,629 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:04,629 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 00:32:04,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045451766] [2021-12-07 00:32:04,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:04,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 00:32:04,634 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:04,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 00:32:04,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:32:04,659 INFO L87 Difference]: Start difference. First operand has 209 states, 162 states have (on average 1.5308641975308641) internal successors, (248), 169 states have internal predecessors, (248), 30 states have call successors, (30), 14 states have call predecessors, (30), 14 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) 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-07 00:32:05,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:32:05,180 INFO L93 Difference]: Finished difference Result 537 states and 798 transitions. [2021-12-07 00:32:05,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-07 00:32:05,182 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-07 00:32:05,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:32:05,193 INFO L225 Difference]: With dead ends: 537 [2021-12-07 00:32:05,193 INFO L226 Difference]: Without dead ends: 335 [2021-12-07 00:32:05,197 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-07 00:32:05,199 INFO L933 BasicCegarLoop]: 293 mSDtfsCounter, 664 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 861 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 00:32:05,200 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [669 Valid, 861 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 00:32:05,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2021-12-07 00:32:05,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 295. [2021-12-07 00:32:05,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 230 states have (on average 1.4130434782608696) internal successors, (325), 237 states have internal predecessors, (325), 41 states have call successors, (41), 21 states have call predecessors, (41), 22 states have return successors, (43), 39 states have call predecessors, (43), 38 states have call successors, (43) [2021-12-07 00:32:05,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 409 transitions. [2021-12-07 00:32:05,259 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 409 transitions. Word has length 59 [2021-12-07 00:32:05,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:32:05,260 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 409 transitions. [2021-12-07 00:32:05,260 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-07 00:32:05,260 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 409 transitions. [2021-12-07 00:32:05,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-07 00:32:05,264 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:32:05,264 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-07 00:32:05,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-07 00:32:05,264 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:32:05,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:05,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1502890616, now seen corresponding path program 1 times [2021-12-07 00:32:05,265 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:05,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132711123] [2021-12-07 00:32:05,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:05,265 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:05,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:05,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:32:05,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:05,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 00:32:05,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:05,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 00:32:05,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:05,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 00:32:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:05,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 00:32:05,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:05,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-07 00:32:05,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:05,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-07 00:32:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:05,361 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-07 00:32:05,361 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:05,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132711123] [2021-12-07 00:32:05,362 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132711123] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:05,362 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:05,362 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 00:32:05,362 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910840738] [2021-12-07 00:32:05,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:05,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 00:32:05,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:05,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 00:32:05,366 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:32:05,366 INFO L87 Difference]: Start difference. First operand 295 states and 409 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-07 00:32:05,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:32:05,840 INFO L93 Difference]: Finished difference Result 644 states and 888 transitions. [2021-12-07 00:32:05,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-07 00:32:05,841 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-07 00:32:05,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:32:05,845 INFO L225 Difference]: With dead ends: 644 [2021-12-07 00:32:05,845 INFO L226 Difference]: Without dead ends: 466 [2021-12-07 00:32:05,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2021-12-07 00:32:05,847 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 573 mSDsluCounter, 923 mSDsCounter, 0 mSdLazyCounter, 775 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 594 SdHoareTripleChecker+Valid, 1260 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 00:32:05,848 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [594 Valid, 1260 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 775 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 00:32:05,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2021-12-07 00:32:05,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 391. [2021-12-07 00:32:05,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 306 states have (on average 1.4019607843137254) internal successors, (429), 315 states have internal predecessors, (429), 52 states have call successors, (52), 28 states have call predecessors, (52), 31 states have return successors, (62), 51 states have call predecessors, (62), 49 states have call successors, (62) [2021-12-07 00:32:05,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 543 transitions. [2021-12-07 00:32:05,892 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 543 transitions. Word has length 59 [2021-12-07 00:32:05,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:32:05,893 INFO L470 AbstractCegarLoop]: Abstraction has 391 states and 543 transitions. [2021-12-07 00:32:05,893 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-07 00:32:05,893 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 543 transitions. [2021-12-07 00:32:05,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-07 00:32:05,896 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:32:05,896 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-07 00:32:05,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-07 00:32:05,896 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:32:05,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:05,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1898590342, now seen corresponding path program 1 times [2021-12-07 00:32:05,897 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:05,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092138463] [2021-12-07 00:32:05,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:05,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:05,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:05,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:32:05,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:05,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 00:32:05,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:05,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 00:32:05,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:05,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 00:32:05,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:05,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 00:32:05,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:06,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-07 00:32:06,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:06,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-07 00:32:06,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:06,008 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-07 00:32:06,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:06,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092138463] [2021-12-07 00:32:06,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092138463] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:06,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:06,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 00:32:06,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319684008] [2021-12-07 00:32:06,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:06,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 00:32:06,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:06,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 00:32:06,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-07 00:32:06,011 INFO L87 Difference]: Start difference. First operand 391 states and 543 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-07 00:32:06,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:32:06,404 INFO L93 Difference]: Finished difference Result 693 states and 958 transitions. [2021-12-07 00:32:06,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-07 00:32:06,405 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-07 00:32:06,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:32:06,407 INFO L225 Difference]: With dead ends: 693 [2021-12-07 00:32:06,408 INFO L226 Difference]: Without dead ends: 425 [2021-12-07 00:32:06,408 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-07 00:32:06,409 INFO L933 BasicCegarLoop]: 265 mSDtfsCounter, 210 mSDsluCounter, 1072 mSDsCounter, 0 mSdLazyCounter, 600 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 600 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2021-12-07 00:32:06,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 1337 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 600 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2021-12-07 00:32:06,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2021-12-07 00:32:06,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 396. [2021-12-07 00:32:06,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 310 states have (on average 1.3903225806451613) internal successors, (431), 319 states have internal predecessors, (431), 52 states have call successors, (52), 28 states have call predecessors, (52), 32 states have return successors, (63), 52 states have call predecessors, (63), 49 states have call successors, (63) [2021-12-07 00:32:06,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 546 transitions. [2021-12-07 00:32:06,433 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 546 transitions. Word has length 59 [2021-12-07 00:32:06,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:32:06,434 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 546 transitions. [2021-12-07 00:32:06,434 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-07 00:32:06,434 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 546 transitions. [2021-12-07 00:32:06,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-07 00:32:06,436 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:32:06,436 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-07 00:32:06,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-07 00:32:06,436 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:32:06,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1623830728, now seen corresponding path program 1 times [2021-12-07 00:32:06,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:06,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457512491] [2021-12-07 00:32:06,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:06,437 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:06,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:32:06,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:06,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 00:32:06,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:06,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 00:32:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:06,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 00:32:06,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:06,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 00:32:06,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:06,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-07 00:32:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:06,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-07 00:32:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:06,550 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-07 00:32:06,550 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:06,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457512491] [2021-12-07 00:32:06,551 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457512491] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:06,551 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:06,551 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 00:32:06,551 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930254973] [2021-12-07 00:32:06,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:06,551 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 00:32:06,551 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:06,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 00:32:06,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2021-12-07 00:32:06,552 INFO L87 Difference]: Start difference. First operand 396 states and 546 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-07 00:32:07,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:32:07,534 INFO L93 Difference]: Finished difference Result 2064 states and 2824 transitions. [2021-12-07 00:32:07,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2021-12-07 00:32:07,534 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) Word has length 59 [2021-12-07 00:32:07,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:32:07,543 INFO L225 Difference]: With dead ends: 2064 [2021-12-07 00:32:07,543 INFO L226 Difference]: Without dead ends: 1791 [2021-12-07 00:32:07,545 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 298 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=235, Invalid=887, Unknown=0, NotChecked=0, Total=1122 [2021-12-07 00:32:07,546 INFO L933 BasicCegarLoop]: 492 mSDtfsCounter, 1332 mSDsluCounter, 1045 mSDsCounter, 0 mSdLazyCounter, 1153 mSolverCounterSat, 453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1350 SdHoareTripleChecker+Valid, 1537 SdHoareTripleChecker+Invalid, 1606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 453 IncrementalHoareTripleChecker+Valid, 1153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2021-12-07 00:32:07,546 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1350 Valid, 1537 Invalid, 1606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [453 Valid, 1153 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2021-12-07 00:32:07,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1791 states. [2021-12-07 00:32:07,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1791 to 1533. [2021-12-07 00:32:07,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1533 states, 1207 states have (on average 1.3305716652858326) internal successors, (1606), 1236 states have internal predecessors, (1606), 169 states have call successors, (169), 130 states have call predecessors, (169), 155 states have return successors, (249), 170 states have call predecessors, (249), 166 states have call successors, (249) [2021-12-07 00:32:07,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1533 states to 1533 states and 2024 transitions. [2021-12-07 00:32:07,619 INFO L78 Accepts]: Start accepts. Automaton has 1533 states and 2024 transitions. Word has length 59 [2021-12-07 00:32:07,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:32:07,619 INFO L470 AbstractCegarLoop]: Abstraction has 1533 states and 2024 transitions. [2021-12-07 00:32:07,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 6 states have internal predecessors, (44), 4 states have call successors, (8), 5 states have call predecessors, (8), 4 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7) [2021-12-07 00:32:07,620 INFO L276 IsEmpty]: Start isEmpty. Operand 1533 states and 2024 transitions. [2021-12-07 00:32:07,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-07 00:32:07,621 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:32:07,621 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-07 00:32:07,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-07 00:32:07,621 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:32:07,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:07,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1699461881, now seen corresponding path program 1 times [2021-12-07 00:32:07,622 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:07,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955713646] [2021-12-07 00:32:07,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:07,622 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:07,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:07,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:32:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:07,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 00:32:07,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:07,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 00:32:07,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:07,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 00:32:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:07,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 00:32:07,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:07,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-07 00:32:07,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:07,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-07 00:32:07,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:07,718 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-07 00:32:07,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:07,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955713646] [2021-12-07 00:32:07,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955713646] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:07,719 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:07,719 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-07 00:32:07,719 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518065118] [2021-12-07 00:32:07,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:07,719 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-07 00:32:07,720 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:07,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-07 00:32:07,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2021-12-07 00:32:07,720 INFO L87 Difference]: Start difference. First operand 1533 states and 2024 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-07 00:32:08,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:32:08,110 INFO L93 Difference]: Finished difference Result 3132 states and 4143 transitions. [2021-12-07 00:32:08,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-12-07 00:32:08,110 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-07 00:32:08,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:32:08,122 INFO L225 Difference]: With dead ends: 3132 [2021-12-07 00:32:08,122 INFO L226 Difference]: Without dead ends: 1722 [2021-12-07 00:32:08,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2021-12-07 00:32:08,127 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 208 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2021-12-07 00:32:08,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [209 Valid, 1330 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2021-12-07 00:32:08,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1722 states. [2021-12-07 00:32:08,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1722 to 1578. [2021-12-07 00:32:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1243 states have (on average 1.3137570394207563) internal successors, (1633), 1272 states have internal predecessors, (1633), 169 states have call successors, (169), 130 states have call predecessors, (169), 164 states have return successors, (261), 179 states have call predecessors, (261), 166 states have call successors, (261) [2021-12-07 00:32:08,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 2063 transitions. [2021-12-07 00:32:08,209 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 2063 transitions. Word has length 59 [2021-12-07 00:32:08,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:32:08,209 INFO L470 AbstractCegarLoop]: Abstraction has 1578 states and 2063 transitions. [2021-12-07 00:32:08,210 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-07 00:32:08,210 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 2063 transitions. [2021-12-07 00:32:08,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-07 00:32:08,211 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:32:08,211 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-07 00:32:08,211 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-07 00:32:08,211 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:32:08,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:08,211 INFO L85 PathProgramCache]: Analyzing trace with hash -105976453, now seen corresponding path program 1 times [2021-12-07 00:32:08,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:08,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853178739] [2021-12-07 00:32:08,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:08,212 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:08,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2021-12-07 00:32:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:08,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-07 00:32:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:08,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-07 00:32:08,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:08,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-07 00:32:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:08,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-07 00:32:08,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:08,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2021-12-07 00:32:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:08,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2021-12-07 00:32:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-07 00:32:08,285 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-07 00:32:08,285 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-07 00:32:08,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853178739] [2021-12-07 00:32:08,286 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853178739] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-07 00:32:08,286 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-07 00:32:08,286 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-07 00:32:08,286 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965001151] [2021-12-07 00:32:08,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-07 00:32:08,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-07 00:32:08,287 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-07 00:32:08,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-07 00:32:08,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-12-07 00:32:08,287 INFO L87 Difference]: Start difference. First operand 1578 states and 2063 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-07 00:32:08,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-07 00:32:08,838 INFO L93 Difference]: Finished difference Result 3013 states and 3900 transitions. [2021-12-07 00:32:08,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2021-12-07 00:32:08,838 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-07 00:32:08,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-07 00:32:08,846 INFO L225 Difference]: With dead ends: 3013 [2021-12-07 00:32:08,846 INFO L226 Difference]: Without dead ends: 1777 [2021-12-07 00:32:08,849 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2021-12-07 00:32:08,850 INFO L933 BasicCegarLoop]: 282 mSDtfsCounter, 558 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 726 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 576 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2021-12-07 00:32:08,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [576 Valid, 978 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 726 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2021-12-07 00:32:08,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2021-12-07 00:32:08,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1556. [2021-12-07 00:32:08,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1229 states have (on average 1.309194467046379) internal successors, (1609), 1252 states have internal predecessors, (1609), 169 states have call successors, (169), 130 states have call predecessors, (169), 156 states have return successors, (245), 177 states have call predecessors, (245), 166 states have call successors, (245) [2021-12-07 00:32:08,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 2023 transitions. [2021-12-07 00:32:08,924 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 2023 transitions. Word has length 59 [2021-12-07 00:32:08,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-07 00:32:08,924 INFO L470 AbstractCegarLoop]: Abstraction has 1556 states and 2023 transitions. [2021-12-07 00:32:08,924 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-07 00:32:08,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 2023 transitions. [2021-12-07 00:32:08,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-12-07 00:32:08,926 INFO L506 BasicCegarLoop]: Found error trace [2021-12-07 00:32:08,926 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-07 00:32:08,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-07 00:32:08,926 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, error1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-07 00:32:08,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-07 00:32:08,927 INFO L85 PathProgramCache]: Analyzing trace with hash -2100121159, now seen corresponding path program 1 times [2021-12-07 00:32:08,927 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-07 00:32:08,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96005536] [2021-12-07 00:32:08,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-07 00:32:08,927 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-07 00:32:08,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:32:08,936 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-07 00:32:08,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-07 00:32:08,969 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-07 00:32:08,969 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-07 00:32:08,970 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2021-12-07 00:32:08,971 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2021-12-07 00:32:08,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-07 00:32:08,974 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2021-12-07 00:32:08,977 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-07 00:32:09,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 12:32:09 BoogieIcfgContainer [2021-12-07 00:32:09,036 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-07 00:32:09,037 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-07 00:32:09,037 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-07 00:32:09,037 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-07 00:32:09,037 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 12:32:04" (3/4) ... [2021-12-07 00:32:09,039 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-07 00:32:09,094 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7638ae4-ff3c-4be9-932d-341b65f6c79f/bin/uautomizer-DrprNOufMa/witness.graphml [2021-12-07 00:32:09,094 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-07 00:32:09,094 INFO L158 Benchmark]: Toolchain (without parser) took 5567.33ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 56.8MB in the beginning and 58.4MB in the end (delta: -1.6MB). Peak memory consumption was 41.1MB. Max. memory is 16.1GB. [2021-12-07 00:32:09,094 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 92.3MB. Free memory was 73.6MB in the beginning and 73.5MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-07 00:32:09,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.34ms. Allocated memory is still 92.3MB. Free memory was 56.7MB in the beginning and 63.8MB in the end (delta: -7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-07 00:32:09,095 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.08ms. Allocated memory is still 92.3MB. Free memory was 63.8MB in the beginning and 61.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 00:32:09,095 INFO L158 Benchmark]: Boogie Preprocessor took 26.76ms. Allocated memory is still 92.3MB. Free memory was 61.0MB in the beginning and 58.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-07 00:32:09,096 INFO L158 Benchmark]: RCFGBuilder took 411.82ms. Allocated memory is still 92.3MB. Free memory was 58.9MB in the beginning and 36.7MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-12-07 00:32:09,096 INFO L158 Benchmark]: TraceAbstraction took 4763.81ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 36.3MB in the beginning and 68.9MB in the end (delta: -32.7MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. [2021-12-07 00:32:09,096 INFO L158 Benchmark]: Witness Printer took 57.03ms. Allocated memory is still 134.2MB. Free memory was 68.9MB in the beginning and 58.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-07 00:32:09,098 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 92.3MB. Free memory was 73.6MB in the beginning and 73.5MB in the end (delta: 84.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 264.34ms. Allocated memory is still 92.3MB. Free memory was 56.7MB in the beginning and 63.8MB in the end (delta: -7.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.08ms. Allocated memory is still 92.3MB. Free memory was 63.8MB in the beginning and 61.0MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.76ms. Allocated memory is still 92.3MB. Free memory was 61.0MB in the beginning and 58.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 411.82ms. Allocated memory is still 92.3MB. Free memory was 58.9MB in the beginning and 36.7MB in the end (delta: 22.2MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4763.81ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 36.3MB in the beginning and 68.9MB in the end (delta: -32.7MB). Peak memory consumption was 12.0MB. Max. memory is 16.1GB. * Witness Printer took 57.03ms. Allocated memory is still 134.2MB. Free memory was 68.9MB in the beginning and 58.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. 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 m_st ; [L503] int t1_st ; [L504] int m_i ; [L505] int t1_i ; [L506] int M_E = 2; [L507] int T1_E = 2; [L508] int E_M = 2; [L509] int E_1 = 2; [L513] int token ; [L515] 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_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, token=0] [L962] COND TRUE __VERIFIER_nondet_int() [L963] 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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_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, 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, 209 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.6s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3609 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3545 mSDsluCounter, 7303 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5371 mSDsCounter, 1079 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4360 IncrementalHoareTripleChecker+Invalid, 5439 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1079 mSolverCounterUnsat, 1932 mSDtfsCounter, 4360 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 234 GetRequests, 123 SyntacticMatches, 1 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1578occurred in iteration=5, InterpolantAutomatonStates: 100, 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, 767 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 413 NumberOfCodeBlocks, 413 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 348 ConstructedInterpolants, 0 QuantifiedInterpolants, 870 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-07 00:32:09,138 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7638ae4-ff3c-4be9-932d-341b65f6c79f/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