./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a --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 1fc4175868fd9160b7d31310c312f3c40c885306cd37c45505af16cdc713f79b --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-b5237d8 [2022-11-21 17:16:51,783 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 17:16:51,786 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 17:16:51,819 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 17:16:51,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 17:16:51,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 17:16:51,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 17:16:51,830 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 17:16:51,833 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 17:16:51,834 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 17:16:51,836 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 17:16:51,838 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 17:16:51,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 17:16:51,844 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 17:16:51,847 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 17:16:51,849 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 17:16:51,852 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 17:16:51,853 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 17:16:51,860 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 17:16:51,862 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 17:16:51,864 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 17:16:51,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 17:16:51,867 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 17:16:51,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 17:16:51,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 17:16:51,872 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 17:16:51,872 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 17:16:51,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 17:16:51,874 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 17:16:51,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 17:16:51,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 17:16:51,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 17:16:51,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 17:16:51,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 17:16:51,879 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 17:16:51,879 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 17:16:51,880 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 17:16:51,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 17:16:51,881 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 17:16:51,882 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 17:16:51,883 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 17:16:51,884 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-21 17:16:51,905 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 17:16:51,905 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 17:16:51,906 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 17:16:51,906 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 17:16:51,907 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 17:16:51,907 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 17:16:51,908 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 17:16:51,909 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 17:16:51,909 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 17:16:51,909 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 17:16:51,910 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-21 17:16:51,910 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 17:16:51,911 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-21 17:16:51,911 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 17:16:51,911 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 17:16:51,912 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 17:16:51,912 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 17:16:51,912 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-21 17:16:51,912 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 17:16:51,913 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 17:16:51,913 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 17:16:51,913 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 17:16:51,914 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 17:16:51,914 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 17:16:51,914 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:16:51,915 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 17:16:51,915 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 17:16:51,915 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 17:16:51,916 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 17:16:51,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 17:16:51,916 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 17:16:51,917 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 17:16:51,917 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 17:16:51,917 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_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/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_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a 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 -> 1fc4175868fd9160b7d31310c312f3c40c885306cd37c45505af16cdc713f79b [2022-11-21 17:16:52,200 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 17:16:52,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 17:16:52,225 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 17:16:52,226 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 17:16:52,227 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 17:16:52,228 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2022-11-21 17:16:55,269 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 17:16:55,546 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 17:16:55,547 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2022-11-21 17:16:55,561 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/data/f887e1e1a/315ff4b54f9b4714bf9de3fbdbbea40b/FLAG031c6653f [2022-11-21 17:16:55,580 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/data/f887e1e1a/315ff4b54f9b4714bf9de3fbdbbea40b [2022-11-21 17:16:55,582 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 17:16:55,585 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 17:16:55,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 17:16:55,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 17:16:55,595 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 17:16:55,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:16:55" (1/1) ... [2022-11-21 17:16:55,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ee07671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:16:55, skipping insertion in model container [2022-11-21 17:16:55,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 05:16:55" (1/1) ... [2022-11-21 17:16:55,605 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 17:16:55,661 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 17:16:55,849 WARN L237 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_762de451-28cd-4a98-aa11-d188e3da883f/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[913,926] [2022-11-21 17:16:55,926 WARN L237 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_762de451-28cd-4a98-aa11-d188e3da883f/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[5977,5990] [2022-11-21 17:16:55,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:16:55,991 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 17:16:56,009 WARN L237 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_762de451-28cd-4a98-aa11-d188e3da883f/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[913,926] [2022-11-21 17:16:56,041 WARN L237 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_762de451-28cd-4a98-aa11-d188e3da883f/sv-benchmarks/c/combinations/pc_sfifo_1.cil-2+token_ring.01.cil-2.c[5977,5990] [2022-11-21 17:16:56,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 17:16:56,107 INFO L208 MainTranslator]: Completed translation [2022-11-21 17:16:56,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:16:56 WrapperNode [2022-11-21 17:16:56,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 17:16:56,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 17:16:56,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 17:16:56,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 17:16:56,118 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:16:56" (1/1) ... [2022-11-21 17:16:56,140 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:16:56" (1/1) ... [2022-11-21 17:16:56,172 INFO L138 Inliner]: procedures = 50, calls = 52, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 422 [2022-11-21 17:16:56,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 17:16:56,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 17:16:56,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 17:16:56,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 17:16:56,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:16:56" (1/1) ... [2022-11-21 17:16:56,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:16:56" (1/1) ... [2022-11-21 17:16:56,187 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:16:56" (1/1) ... [2022-11-21 17:16:56,187 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:16:56" (1/1) ... [2022-11-21 17:16:56,194 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:16:56" (1/1) ... [2022-11-21 17:16:56,217 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:16:56" (1/1) ... [2022-11-21 17:16:56,218 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:16:56" (1/1) ... [2022-11-21 17:16:56,220 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:16:56" (1/1) ... [2022-11-21 17:16:56,239 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 17:16:56,240 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 17:16:56,241 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 17:16:56,241 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 17:16:56,242 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:16:56" (1/1) ... [2022-11-21 17:16:56,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 17:16:56,262 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:16:56,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 17:16:56,287 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 17:16:56,314 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 17:16:56,315 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2022-11-21 17:16:56,315 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2022-11-21 17:16:56,315 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify_threads [2022-11-21 17:16:56,315 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify_threads [2022-11-21 17:16:56,315 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread1 [2022-11-21 17:16:56,315 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread1 [2022-11-21 17:16:56,316 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread2 [2022-11-21 17:16:56,316 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread2 [2022-11-21 17:16:56,316 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events2 [2022-11-21 17:16:56,316 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events2 [2022-11-21 17:16:56,316 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads2 [2022-11-21 17:16:56,316 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads2 [2022-11-21 17:16:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels2 [2022-11-21 17:16:56,317 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels2 [2022-11-21 17:16:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 17:16:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events2 [2022-11-21 17:16:56,317 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events2 [2022-11-21 17:16:56,317 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 17:16:56,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 17:16:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure error1 [2022-11-21 17:16:56,318 INFO L138 BoogieDeclarations]: Found implementation of procedure error1 [2022-11-21 17:16:56,318 INFO L130 BoogieDeclarations]: Found specification of procedure error2 [2022-11-21 17:16:56,318 INFO L138 BoogieDeclarations]: Found implementation of procedure error2 [2022-11-21 17:16:56,414 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 17:16:56,416 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 17:16:56,994 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 17:16:57,002 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 17:16:57,003 INFO L300 CfgBuilder]: Removed 8 assume(true) statements. [2022-11-21 17:16:57,013 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:16:57 BoogieIcfgContainer [2022-11-21 17:16:57,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 17:16:57,019 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 17:16:57,020 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 17:16:57,023 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 17:16:57,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 05:16:55" (1/3) ... [2022-11-21 17:16:57,024 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35580a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:16:57, skipping insertion in model container [2022-11-21 17:16:57,024 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 05:16:56" (2/3) ... [2022-11-21 17:16:57,025 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@35580a77 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 05:16:57, skipping insertion in model container [2022-11-21 17:16:57,025 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:16:57" (3/3) ... [2022-11-21 17:16:57,027 INFO L112 eAbstractionObserver]: Analyzing ICFG pc_sfifo_1.cil-2+token_ring.01.cil-2.c [2022-11-21 17:16:57,048 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 17:16:57,049 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-21 17:16:57,135 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 17:16:57,144 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@212b76e5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 17:16:57,144 INFO L358 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-11-21 17:16:57,149 INFO L276 IsEmpty]: Start isEmpty. Operand has 187 states, 151 states have (on average 1.5562913907284768) internal successors, (235), 158 states have internal predecessors, (235), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) [2022-11-21 17:16:57,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-11-21 17:16:57,184 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:57,185 INFO L195 NwaCegarLoop]: 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] [2022-11-21 17:16:57,185 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:16:57,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:57,191 INFO L85 PathProgramCache]: Analyzing trace with hash 578004893, now seen corresponding path program 1 times [2022-11-21 17:16:57,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:57,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352648347] [2022-11-21 17:16:57,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:57,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:57,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:57,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 17:16:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:57,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-21 17:16:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:57,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:16:57,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:57,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352648347] [2022-11-21 17:16:57,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352648347] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:57,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:57,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:16:57,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102996272] [2022-11-21 17:16:57,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:57,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:16:57,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:57,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:16:57,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:16:57,702 INFO L87 Difference]: Start difference. First operand has 187 states, 151 states have (on average 1.5562913907284768) internal successors, (235), 158 states have internal predecessors, (235), 23 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (23), 21 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:16:58,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:58,167 INFO L93 Difference]: Finished difference Result 429 states and 652 transitions. [2022-11-21 17:16:58,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:16:58,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 44 [2022-11-21 17:16:58,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:58,190 INFO L225 Difference]: With dead ends: 429 [2022-11-21 17:16:58,190 INFO L226 Difference]: Without dead ends: 246 [2022-11-21 17:16:58,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:16:58,206 INFO L413 NwaCegarLoop]: 223 mSDtfsCounter, 297 mSDsluCounter, 215 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:58,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 438 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:16:58,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-11-21 17:16:58,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 240. [2022-11-21 17:16:58,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 200 states have (on average 1.42) internal successors, (284), 205 states have internal predecessors, (284), 27 states have call successors, (27), 12 states have call predecessors, (27), 11 states have return successors, (29), 23 states have call predecessors, (29), 23 states have call successors, (29) [2022-11-21 17:16:58,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 340 transitions. [2022-11-21 17:16:58,304 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 340 transitions. Word has length 44 [2022-11-21 17:16:58,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:58,305 INFO L495 AbstractCegarLoop]: Abstraction has 240 states and 340 transitions. [2022-11-21 17:16:58,305 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 3 states have internal predecessors, (39), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:16:58,305 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 340 transitions. [2022-11-21 17:16:58,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-21 17:16:58,315 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:58,315 INFO L195 NwaCegarLoop]: 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] [2022-11-21 17:16:58,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 17:16:58,316 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:16:58,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:58,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1000349205, now seen corresponding path program 1 times [2022-11-21 17:16:58,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:58,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098697704] [2022-11-21 17:16:58,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:58,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:58,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 17:16:58,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:58,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-21 17:16:58,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:16:58,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:58,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098697704] [2022-11-21 17:16:58,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098697704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:58,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:58,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:16:58,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692898558] [2022-11-21 17:16:58,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:58,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:16:58,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:58,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:16:58,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:16:58,446 INFO L87 Difference]: Start difference. First operand 240 states and 340 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:16:58,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:58,742 INFO L93 Difference]: Finished difference Result 488 states and 680 transitions. [2022-11-21 17:16:58,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:16:58,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-11-21 17:16:58,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:58,750 INFO L225 Difference]: With dead ends: 488 [2022-11-21 17:16:58,750 INFO L226 Difference]: Without dead ends: 364 [2022-11-21 17:16:58,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:16:58,757 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 150 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:58,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 546 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:16:58,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2022-11-21 17:16:58,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 307. [2022-11-21 17:16:58,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 307 states, 261 states have (on average 1.4099616858237547) internal successors, (368), 266 states have internal predecessors, (368), 30 states have call successors, (30), 15 states have call predecessors, (30), 14 states have return successors, (32), 26 states have call predecessors, (32), 26 states have call successors, (32) [2022-11-21 17:16:58,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 430 transitions. [2022-11-21 17:16:58,813 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 430 transitions. Word has length 45 [2022-11-21 17:16:58,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:58,813 INFO L495 AbstractCegarLoop]: Abstraction has 307 states and 430 transitions. [2022-11-21 17:16:58,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:16:58,814 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 430 transitions. [2022-11-21 17:16:58,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-11-21 17:16:58,819 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:58,819 INFO L195 NwaCegarLoop]: 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] [2022-11-21 17:16:58,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 17:16:58,820 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:16:58,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:58,821 INFO L85 PathProgramCache]: Analyzing trace with hash -284008256, now seen corresponding path program 1 times [2022-11-21 17:16:58,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:58,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174694991] [2022-11-21 17:16:58,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:58,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:58,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 17:16:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:58,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-21 17:16:58,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:58,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:16:58,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:58,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174694991] [2022-11-21 17:16:58,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174694991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:58,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:58,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:16:58,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210845356] [2022-11-21 17:16:58,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:58,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:16:58,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:58,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:16:58,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:16:58,938 INFO L87 Difference]: Start difference. First operand 307 states and 430 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:16:59,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:59,201 INFO L93 Difference]: Finished difference Result 715 states and 989 transitions. [2022-11-21 17:16:59,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:16:59,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-11-21 17:16:59,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:59,206 INFO L225 Difference]: With dead ends: 715 [2022-11-21 17:16:59,206 INFO L226 Difference]: Without dead ends: 524 [2022-11-21 17:16:59,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:16:59,217 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 306 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 321 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:59,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [321 Valid, 428 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:16:59,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2022-11-21 17:16:59,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 472. [2022-11-21 17:16:59,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 407 states have (on average 1.371007371007371) internal successors, (558), 415 states have internal predecessors, (558), 41 states have call successors, (41), 22 states have call predecessors, (41), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-11-21 17:16:59,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 648 transitions. [2022-11-21 17:16:59,280 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 648 transitions. Word has length 45 [2022-11-21 17:16:59,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:59,280 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 648 transitions. [2022-11-21 17:16:59,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-11-21 17:16:59,281 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 648 transitions. [2022-11-21 17:16:59,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-21 17:16:59,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:59,283 INFO L195 NwaCegarLoop]: 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] [2022-11-21 17:16:59,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 17:16:59,283 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:16:59,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:59,284 INFO L85 PathProgramCache]: Analyzing trace with hash -1712856217, now seen corresponding path program 1 times [2022-11-21 17:16:59,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:59,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819433329] [2022-11-21 17:16:59,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:59,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:59,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:59,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 17:16:59,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:59,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:16:59,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:59,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 17:16:59,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:59,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 17:16:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:59,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 17:16:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:16:59,392 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:16:59,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:16:59,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819433329] [2022-11-21 17:16:59,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819433329] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:16:59,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:16:59,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:16:59,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418707537] [2022-11-21 17:16:59,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:16:59,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:16:59,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:16:59,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:16:59,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:16:59,394 INFO L87 Difference]: Start difference. First operand 472 states and 648 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 17:16:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:16:59,850 INFO L93 Difference]: Finished difference Result 596 states and 832 transitions. [2022-11-21 17:16:59,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 17:16:59,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-21 17:16:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:16:59,856 INFO L225 Difference]: With dead ends: 596 [2022-11-21 17:16:59,856 INFO L226 Difference]: Without dead ends: 493 [2022-11-21 17:16:59,859 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:16:59,867 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 285 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-21 17:16:59,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [298 Valid, 465 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-21 17:16:59,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 493 states. [2022-11-21 17:16:59,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 493 to 472. [2022-11-21 17:16:59,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 407 states have (on average 1.3685503685503686) internal successors, (557), 415 states have internal predecessors, (557), 41 states have call successors, (41), 22 states have call predecessors, (41), 22 states have return successors, (49), 35 states have call predecessors, (49), 37 states have call successors, (49) [2022-11-21 17:16:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 647 transitions. [2022-11-21 17:16:59,924 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 647 transitions. Word has length 58 [2022-11-21 17:16:59,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:16:59,924 INFO L495 AbstractCegarLoop]: Abstraction has 472 states and 647 transitions. [2022-11-21 17:16:59,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 17:16:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 647 transitions. [2022-11-21 17:16:59,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-21 17:16:59,926 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:16:59,926 INFO L195 NwaCegarLoop]: 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] [2022-11-21 17:16:59,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 17:16:59,927 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:16:59,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:16:59,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1231775959, now seen corresponding path program 1 times [2022-11-21 17:16:59,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:16:59,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121050520] [2022-11-21 17:16:59,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:16:59,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:16:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:00,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 17:17:00,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:00,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:17:00,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:00,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 17:17:00,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:00,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 17:17:00,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:00,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 17:17:00,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:00,065 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:17:00,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:00,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121050520] [2022-11-21 17:17:00,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121050520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:17:00,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:17:00,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:17:00,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775284024] [2022-11-21 17:17:00,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:00,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:17:00,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:00,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:17:00,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:17:00,068 INFO L87 Difference]: Start difference. First operand 472 states and 647 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 17:17:00,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:00,755 INFO L93 Difference]: Finished difference Result 710 states and 998 transitions. [2022-11-21 17:17:00,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 17:17:00,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-21 17:17:00,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:00,762 INFO L225 Difference]: With dead ends: 710 [2022-11-21 17:17:00,762 INFO L226 Difference]: Without dead ends: 610 [2022-11-21 17:17:00,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-11-21 17:17:00,765 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 458 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:00,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 628 Invalid, 630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:17:00,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-11-21 17:17:00,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 567. [2022-11-21 17:17:00,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 567 states, 485 states have (on average 1.3855670103092783) internal successors, (672), 494 states have internal predecessors, (672), 51 states have call successors, (51), 28 states have call predecessors, (51), 29 states have return successors, (62), 45 states have call predecessors, (62), 47 states have call successors, (62) [2022-11-21 17:17:00,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 785 transitions. [2022-11-21 17:17:00,834 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 785 transitions. Word has length 58 [2022-11-21 17:17:00,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:00,834 INFO L495 AbstractCegarLoop]: Abstraction has 567 states and 785 transitions. [2022-11-21 17:17:00,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 17:17:00,835 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 785 transitions. [2022-11-21 17:17:00,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-21 17:17:00,836 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:00,836 INFO L195 NwaCegarLoop]: 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] [2022-11-21 17:17:00,837 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 17:17:00,837 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:00,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:00,837 INFO L85 PathProgramCache]: Analyzing trace with hash 696496743, now seen corresponding path program 1 times [2022-11-21 17:17:00,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:00,838 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481654752] [2022-11-21 17:17:00,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:00,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:00,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 17:17:00,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:00,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:17:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:00,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 17:17:00,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:00,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 17:17:00,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:00,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 17:17:00,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:00,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:17:00,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:00,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481654752] [2022-11-21 17:17:00,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481654752] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:17:00,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:17:00,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:17:00,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991854161] [2022-11-21 17:17:00,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:00,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:17:00,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:00,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:17:00,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:17:00,995 INFO L87 Difference]: Start difference. First operand 567 states and 785 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 17:17:01,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:01,813 INFO L93 Difference]: Finished difference Result 918 states and 1293 transitions. [2022-11-21 17:17:01,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 17:17:01,814 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-21 17:17:01,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:01,818 INFO L225 Difference]: With dead ends: 918 [2022-11-21 17:17:01,818 INFO L226 Difference]: Without dead ends: 723 [2022-11-21 17:17:01,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-21 17:17:01,820 INFO L413 NwaCegarLoop]: 237 mSDtfsCounter, 455 mSDsluCounter, 763 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 1000 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:01,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 1000 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 824 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 17:17:01,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-11-21 17:17:01,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 657. [2022-11-21 17:17:01,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 657 states, 558 states have (on average 1.39247311827957) internal successors, (777), 568 states have internal predecessors, (777), 61 states have call successors, (61), 34 states have call predecessors, (61), 36 states have return successors, (74), 56 states have call predecessors, (74), 57 states have call successors, (74) [2022-11-21 17:17:01,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 912 transitions. [2022-11-21 17:17:01,930 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 912 transitions. Word has length 58 [2022-11-21 17:17:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:01,930 INFO L495 AbstractCegarLoop]: Abstraction has 657 states and 912 transitions. [2022-11-21 17:17:01,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 17:17:01,930 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 912 transitions. [2022-11-21 17:17:01,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-21 17:17:01,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:01,932 INFO L195 NwaCegarLoop]: 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] [2022-11-21 17:17:01,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 17:17:01,932 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:01,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1589983081, now seen corresponding path program 1 times [2022-11-21 17:17:01,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:01,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556464754] [2022-11-21 17:17:01,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:01,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:02,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 17:17:02,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:02,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:17:02,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:02,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 17:17:02,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:02,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 17:17:02,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:02,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 17:17:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:17:02,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:02,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556464754] [2022-11-21 17:17:02,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556464754] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:17:02,076 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:17:02,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 17:17:02,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368785815] [2022-11-21 17:17:02,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:02,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 17:17:02,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:02,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 17:17:02,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:17:02,077 INFO L87 Difference]: Start difference. First operand 657 states and 912 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 17:17:02,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:02,956 INFO L93 Difference]: Finished difference Result 1244 states and 1756 transitions. [2022-11-21 17:17:02,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 17:17:02,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-21 17:17:02,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:02,962 INFO L225 Difference]: With dead ends: 1244 [2022-11-21 17:17:02,962 INFO L226 Difference]: Without dead ends: 959 [2022-11-21 17:17:02,964 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-21 17:17:02,965 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 448 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 459 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:02,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [459 Valid, 984 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-21 17:17:02,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2022-11-21 17:17:03,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 815. [2022-11-21 17:17:03,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 684 states have (on average 1.394736842105263) internal successors, (954), 696 states have internal predecessors, (954), 79 states have call successors, (79), 46 states have call predecessors, (79), 50 states have return successors, (100), 76 states have call predecessors, (100), 75 states have call successors, (100) [2022-11-21 17:17:03,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1133 transitions. [2022-11-21 17:17:03,087 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1133 transitions. Word has length 58 [2022-11-21 17:17:03,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:03,087 INFO L495 AbstractCegarLoop]: Abstraction has 815 states and 1133 transitions. [2022-11-21 17:17:03,088 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 5 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 17:17:03,088 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1133 transitions. [2022-11-21 17:17:03,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-11-21 17:17:03,089 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:03,090 INFO L195 NwaCegarLoop]: 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] [2022-11-21 17:17:03,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 17:17:03,090 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:03,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:03,090 INFO L85 PathProgramCache]: Analyzing trace with hash 692589803, now seen corresponding path program 1 times [2022-11-21 17:17:03,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:03,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950612016] [2022-11-21 17:17:03,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:03,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:03,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 17:17:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:03,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:17:03,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:03,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 17:17:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:03,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 17:17:03,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:03,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 17:17:03,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:03,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:17:03,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:03,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950612016] [2022-11-21 17:17:03,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950612016] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:17:03,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:17:03,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:17:03,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735302366] [2022-11-21 17:17:03,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:03,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:17:03,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:03,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:17:03,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:17:03,173 INFO L87 Difference]: Start difference. First operand 815 states and 1133 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 17:17:03,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:03,949 INFO L93 Difference]: Finished difference Result 1642 states and 2326 transitions. [2022-11-21 17:17:03,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 17:17:03,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 58 [2022-11-21 17:17:03,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:03,955 INFO L225 Difference]: With dead ends: 1642 [2022-11-21 17:17:03,955 INFO L226 Difference]: Without dead ends: 1200 [2022-11-21 17:17:03,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-21 17:17:03,958 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 562 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 636 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 636 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:03,958 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 715 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 636 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:17:03,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1200 states. [2022-11-21 17:17:04,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1200 to 1067. [2022-11-21 17:17:04,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1067 states, 885 states have (on average 1.3887005649717514) internal successors, (1229), 902 states have internal predecessors, (1229), 110 states have call successors, (110), 64 states have call predecessors, (110), 70 states have return successors, (135), 104 states have call predecessors, (135), 106 states have call successors, (135) [2022-11-21 17:17:04,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1067 states to 1067 states and 1474 transitions. [2022-11-21 17:17:04,083 INFO L78 Accepts]: Start accepts. Automaton has 1067 states and 1474 transitions. Word has length 58 [2022-11-21 17:17:04,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:04,084 INFO L495 AbstractCegarLoop]: Abstraction has 1067 states and 1474 transitions. [2022-11-21 17:17:04,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-21 17:17:04,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1067 states and 1474 transitions. [2022-11-21 17:17:04,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-21 17:17:04,086 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:04,086 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:17:04,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 17:17:04,087 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:04,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:04,087 INFO L85 PathProgramCache]: Analyzing trace with hash 228372173, now seen corresponding path program 1 times [2022-11-21 17:17:04,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:04,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972320694] [2022-11-21 17:17:04,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:04,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:04,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:04,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 17:17:04,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:04,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-21 17:17:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:04,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 17:17:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:04,165 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-21 17:17:04,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:04,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972320694] [2022-11-21 17:17:04,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972320694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:17:04,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:17:04,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:17:04,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216488843] [2022-11-21 17:17:04,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:04,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:17:04,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:04,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:17:04,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:17:04,169 INFO L87 Difference]: Start difference. First operand 1067 states and 1474 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:17:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:04,494 INFO L93 Difference]: Finished difference Result 1651 states and 2259 transitions. [2022-11-21 17:17:04,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:17:04,495 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 62 [2022-11-21 17:17:04,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:04,503 INFO L225 Difference]: With dead ends: 1651 [2022-11-21 17:17:04,503 INFO L226 Difference]: Without dead ends: 1295 [2022-11-21 17:17:04,505 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:17:04,509 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 134 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:04,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 595 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:17:04,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1295 states. [2022-11-21 17:17:04,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1295 to 1257. [2022-11-21 17:17:04,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1257 states, 1051 states have (on average 1.3596574690770695) internal successors, (1429), 1070 states have internal predecessors, (1429), 124 states have call successors, (124), 72 states have call predecessors, (124), 80 states have return successors, (159), 118 states have call predecessors, (159), 120 states have call successors, (159) [2022-11-21 17:17:04,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1257 states to 1257 states and 1712 transitions. [2022-11-21 17:17:04,647 INFO L78 Accepts]: Start accepts. Automaton has 1257 states and 1712 transitions. Word has length 62 [2022-11-21 17:17:04,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:04,648 INFO L495 AbstractCegarLoop]: Abstraction has 1257 states and 1712 transitions. [2022-11-21 17:17:04,648 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 3 states have internal predecessors, (51), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:17:04,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1257 states and 1712 transitions. [2022-11-21 17:17:04,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-11-21 17:17:04,651 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:04,651 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:17:04,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 17:17:04,651 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:04,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:04,652 INFO L85 PathProgramCache]: Analyzing trace with hash -387474386, now seen corresponding path program 1 times [2022-11-21 17:17:04,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:04,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115300216] [2022-11-21 17:17:04,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:04,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:04,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:04,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 17:17:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:04,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 17:17:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:04,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-11-21 17:17:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:04,711 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 17:17:04,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:04,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115300216] [2022-11-21 17:17:04,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115300216] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:17:04,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:17:04,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-21 17:17:04,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831827356] [2022-11-21 17:17:04,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:04,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:17:04,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:04,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:17:04,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-21 17:17:04,714 INFO L87 Difference]: Start difference. First operand 1257 states and 1712 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 17:17:05,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:05,037 INFO L93 Difference]: Finished difference Result 1910 states and 2565 transitions. [2022-11-21 17:17:05,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-21 17:17:05,038 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 67 [2022-11-21 17:17:05,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:05,045 INFO L225 Difference]: With dead ends: 1910 [2022-11-21 17:17:05,045 INFO L226 Difference]: Without dead ends: 1456 [2022-11-21 17:17:05,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:17:05,048 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 292 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:05,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 424 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:17:05,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1456 states. [2022-11-21 17:17:05,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1456 to 1401. [2022-11-21 17:17:05,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1401 states, 1179 states have (on average 1.3401187446988974) internal successors, (1580), 1200 states have internal predecessors, (1580), 132 states have call successors, (132), 78 states have call predecessors, (132), 88 states have return successors, (173), 126 states have call predecessors, (173), 128 states have call successors, (173) [2022-11-21 17:17:05,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1401 states to 1401 states and 1885 transitions. [2022-11-21 17:17:05,191 INFO L78 Accepts]: Start accepts. Automaton has 1401 states and 1885 transitions. Word has length 67 [2022-11-21 17:17:05,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:05,191 INFO L495 AbstractCegarLoop]: Abstraction has 1401 states and 1885 transitions. [2022-11-21 17:17:05,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-11-21 17:17:05,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1401 states and 1885 transitions. [2022-11-21 17:17:05,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-21 17:17:05,201 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:05,201 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:17:05,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 17:17:05,201 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:05,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:05,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1207541004, now seen corresponding path program 1 times [2022-11-21 17:17:05,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:05,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013513979] [2022-11-21 17:17:05,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:05,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:05,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:05,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 17:17:05,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:05,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-21 17:17:05,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:05,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 17:17:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:05,351 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 17:17:05,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:05,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013513979] [2022-11-21 17:17:05,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013513979] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:05,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362947451] [2022-11-21 17:17:05,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:05,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:05,353 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:17:05,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:17:05,400 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 17:17:05,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:05,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 17:17:05,516 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:17:05,646 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:17:05,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:17:05,696 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-21 17:17:05,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362947451] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:05,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-21 17:17:05,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 8 [2022-11-21 17:17:05,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778019860] [2022-11-21 17:17:05,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:05,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-21 17:17:05,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:05,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-21 17:17:05,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:17:05,698 INFO L87 Difference]: Start difference. First operand 1401 states and 1885 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:17:05,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:05,965 INFO L93 Difference]: Finished difference Result 1457 states and 1953 transitions. [2022-11-21 17:17:05,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:17:05,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 68 [2022-11-21 17:17:05,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:05,973 INFO L225 Difference]: With dead ends: 1457 [2022-11-21 17:17:05,973 INFO L226 Difference]: Without dead ends: 1454 [2022-11-21 17:17:05,974 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:17:05,974 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 419 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 419 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:05,975 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [419 Valid, 340 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:17:05,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1454 states. [2022-11-21 17:17:06,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1454 to 1400. [2022-11-21 17:17:06,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1400 states, 1179 states have (on average 1.3384223918575064) internal successors, (1578), 1199 states have internal predecessors, (1578), 131 states have call successors, (131), 78 states have call predecessors, (131), 88 states have return successors, (173), 126 states have call predecessors, (173), 128 states have call successors, (173) [2022-11-21 17:17:06,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1400 states to 1400 states and 1882 transitions. [2022-11-21 17:17:06,142 INFO L78 Accepts]: Start accepts. Automaton has 1400 states and 1882 transitions. Word has length 68 [2022-11-21 17:17:06,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:06,142 INFO L495 AbstractCegarLoop]: Abstraction has 1400 states and 1882 transitions. [2022-11-21 17:17:06,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-21 17:17:06,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1400 states and 1882 transitions. [2022-11-21 17:17:06,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-21 17:17:06,146 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:06,146 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:17:06,152 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 17:17:06,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:06,352 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:06,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:06,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1220320753, now seen corresponding path program 1 times [2022-11-21 17:17:06,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:06,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708442562] [2022-11-21 17:17:06,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:06,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:06,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:06,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 17:17:06,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:06,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-21 17:17:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:06,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-21 17:17:06,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:06,471 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-21 17:17:06,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:06,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708442562] [2022-11-21 17:17:06,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708442562] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:06,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851538988] [2022-11-21 17:17:06,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:06,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:06,472 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:17:06,473 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:17:06,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 17:17:06,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:06,579 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-21 17:17:06,584 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:17:06,900 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-21 17:17:06,900 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 17:17:06,989 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-21 17:17:06,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851538988] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 17:17:06,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-21 17:17:06,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 4] total 11 [2022-11-21 17:17:06,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340795019] [2022-11-21 17:17:06,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-21 17:17:06,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 17:17:06,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:06,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 17:17:06,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-21 17:17:06,991 INFO L87 Difference]: Start difference. First operand 1400 states and 1882 transitions. Second operand has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-21 17:17:08,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:08,438 INFO L93 Difference]: Finished difference Result 3100 states and 4102 transitions. [2022-11-21 17:17:08,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-21 17:17:08,438 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 69 [2022-11-21 17:17:08,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:08,450 INFO L225 Difference]: With dead ends: 3100 [2022-11-21 17:17:08,450 INFO L226 Difference]: Without dead ends: 2556 [2022-11-21 17:17:08,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 460 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=324, Invalid=1482, Unknown=0, NotChecked=0, Total=1806 [2022-11-21 17:17:08,454 INFO L413 NwaCegarLoop]: 318 mSDtfsCounter, 837 mSDsluCounter, 1655 mSDsCounter, 0 mSdLazyCounter, 803 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 859 SdHoareTripleChecker+Valid, 1973 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 803 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:08,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [859 Valid, 1973 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 803 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-21 17:17:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2022-11-21 17:17:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 1789. [2022-11-21 17:17:08,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1789 states, 1529 states have (on average 1.315892740353172) internal successors, (2012), 1557 states have internal predecessors, (2012), 151 states have call successors, (151), 92 states have call predecessors, (151), 107 states have return successors, (207), 143 states have call predecessors, (207), 148 states have call successors, (207) [2022-11-21 17:17:08,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1789 states to 1789 states and 2370 transitions. [2022-11-21 17:17:08,712 INFO L78 Accepts]: Start accepts. Automaton has 1789 states and 2370 transitions. Word has length 69 [2022-11-21 17:17:08,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:08,713 INFO L495 AbstractCegarLoop]: Abstraction has 1789 states and 2370 transitions. [2022-11-21 17:17:08,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 13.727272727272727) internal successors, (151), 10 states have internal predecessors, (151), 7 states have call successors, (10), 6 states have call predecessors, (10), 5 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2022-11-21 17:17:08,713 INFO L276 IsEmpty]: Start isEmpty. Operand 1789 states and 2370 transitions. [2022-11-21 17:17:08,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-11-21 17:17:08,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:08,718 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:17:08,732 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 17:17:08,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:08,924 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:08,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:08,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1470144615, now seen corresponding path program 1 times [2022-11-21 17:17:08,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:08,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107190967] [2022-11-21 17:17:08,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:08,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:08,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:08,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 17:17:08,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:08,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-21 17:17:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:09,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 17:17:09,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:09,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-11-21 17:17:09,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:09,049 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 17:17:09,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:09,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107190967] [2022-11-21 17:17:09,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107190967] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:09,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [70012190] [2022-11-21 17:17:09,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:09,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:09,051 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:17:09,052 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:17:09,077 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 17:17:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:09,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 328 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 17:17:09,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:17:09,193 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-11-21 17:17:09,193 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:17:09,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [70012190] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:17:09,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:17:09,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-21 17:17:09,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775135606] [2022-11-21 17:17:09,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:09,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:17:09,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:09,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:17:09,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:17:09,199 INFO L87 Difference]: Start difference. First operand 1789 states and 2370 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 17:17:09,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:09,403 INFO L93 Difference]: Finished difference Result 2512 states and 3308 transitions. [2022-11-21 17:17:09,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:17:09,403 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 88 [2022-11-21 17:17:09,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:09,413 INFO L225 Difference]: With dead ends: 2512 [2022-11-21 17:17:09,413 INFO L226 Difference]: Without dead ends: 1667 [2022-11-21 17:17:09,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:17:09,416 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 208 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:09,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 354 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:17:09,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1667 states. [2022-11-21 17:17:09,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1667 to 1652. [2022-11-21 17:17:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1652 states, 1408 states have (on average 1.3167613636363635) internal successors, (1854), 1435 states have internal predecessors, (1854), 143 states have call successors, (143), 86 states have call predecessors, (143), 99 states have return successors, (193), 134 states have call predecessors, (193), 140 states have call successors, (193) [2022-11-21 17:17:09,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1652 states to 1652 states and 2190 transitions. [2022-11-21 17:17:09,628 INFO L78 Accepts]: Start accepts. Automaton has 1652 states and 2190 transitions. Word has length 88 [2022-11-21 17:17:09,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:09,629 INFO L495 AbstractCegarLoop]: Abstraction has 1652 states and 2190 transitions. [2022-11-21 17:17:09,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 3 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-11-21 17:17:09,629 INFO L276 IsEmpty]: Start isEmpty. Operand 1652 states and 2190 transitions. [2022-11-21 17:17:09,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-21 17:17:09,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:09,633 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:17:09,648 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 17:17:09,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-11-21 17:17:09,840 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:09,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:09,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1819521257, now seen corresponding path program 1 times [2022-11-21 17:17:09,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:09,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027749055] [2022-11-21 17:17:09,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:09,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:09,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:09,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 17:17:09,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:09,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:17:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:09,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 17:17:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:09,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 17:17:09,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:09,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 17:17:09,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:09,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 17:17:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:09,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:09,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-21 17:17:09,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:09,975 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-21 17:17:09,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:09,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027749055] [2022-11-21 17:17:09,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027749055] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:09,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529428500] [2022-11-21 17:17:09,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:09,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:09,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:17:09,977 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:17:09,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 17:17:10,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:10,085 INFO L263 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 17:17:10,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:17:10,113 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 17:17:10,113 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:17:10,113 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [529428500] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:17:10,113 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:17:10,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-21 17:17:10,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053412433] [2022-11-21 17:17:10,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:10,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:17:10,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:10,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:17:10,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:17:10,115 INFO L87 Difference]: Start difference. First operand 1652 states and 2190 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 17:17:10,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:10,364 INFO L93 Difference]: Finished difference Result 2176 states and 2945 transitions. [2022-11-21 17:17:10,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:17:10,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 93 [2022-11-21 17:17:10,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:10,376 INFO L225 Difference]: With dead ends: 2176 [2022-11-21 17:17:10,376 INFO L226 Difference]: Without dead ends: 1891 [2022-11-21 17:17:10,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:17:10,379 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 105 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:10,379 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 594 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:17:10,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1891 states. [2022-11-21 17:17:10,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1891 to 1891. [2022-11-21 17:17:10,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1891 states, 1599 states have (on average 1.3258286429018136) internal successors, (2120), 1628 states have internal predecessors, (2120), 171 states have call successors, (171), 104 states have call predecessors, (171), 119 states have return successors, (235), 162 states have call predecessors, (235), 168 states have call successors, (235) [2022-11-21 17:17:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1891 states to 1891 states and 2526 transitions. [2022-11-21 17:17:10,620 INFO L78 Accepts]: Start accepts. Automaton has 1891 states and 2526 transitions. Word has length 93 [2022-11-21 17:17:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:10,620 INFO L495 AbstractCegarLoop]: Abstraction has 1891 states and 2526 transitions. [2022-11-21 17:17:10,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 17:17:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1891 states and 2526 transitions. [2022-11-21 17:17:10,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-11-21 17:17:10,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:10,626 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:17:10,644 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-21 17:17:10,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-21 17:17:10,832 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting error1Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:10,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:10,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1756250701, now seen corresponding path program 1 times [2022-11-21 17:17:10,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:10,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949163185] [2022-11-21 17:17:10,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:10,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:10,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:10,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 17:17:10,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:10,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-21 17:17:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:10,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-21 17:17:10,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:10,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-21 17:17:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:10,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-21 17:17:10,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:10,951 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-11-21 17:17:10,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:10,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949163185] [2022-11-21 17:17:10,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1949163185] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:10,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196622720] [2022-11-21 17:17:10,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:10,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:10,953 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:17:10,954 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:17:10,979 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-21 17:17:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:11,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 17:17:11,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:17:11,095 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-21 17:17:11,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:17:11,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196622720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:17:11,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:17:11,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2022-11-21 17:17:11,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602356733] [2022-11-21 17:17:11,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:11,097 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:17:11,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:11,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:17:11,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:17:11,098 INFO L87 Difference]: Start difference. First operand 1891 states and 2526 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-21 17:17:11,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:11,245 INFO L93 Difference]: Finished difference Result 2270 states and 2994 transitions. [2022-11-21 17:17:11,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:17:11,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2022-11-21 17:17:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:11,250 INFO L225 Difference]: With dead ends: 2270 [2022-11-21 17:17:11,251 INFO L226 Difference]: Without dead ends: 944 [2022-11-21 17:17:11,254 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:17:11,254 INFO L413 NwaCegarLoop]: 293 mSDtfsCounter, 62 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:11,255 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 516 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:17:11,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2022-11-21 17:17:11,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 944. [2022-11-21 17:17:11,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 755 states have (on average 1.4066225165562913) internal successors, (1062), 768 states have internal predecessors, (1062), 114 states have call successors, (114), 67 states have call predecessors, (114), 74 states have return successors, (143), 112 states have call predecessors, (143), 112 states have call successors, (143) [2022-11-21 17:17:11,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1319 transitions. [2022-11-21 17:17:11,376 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1319 transitions. Word has length 103 [2022-11-21 17:17:11,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:11,376 INFO L495 AbstractCegarLoop]: Abstraction has 944 states and 1319 transitions. [2022-11-21 17:17:11,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 3 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 3 states have call successors, (5) [2022-11-21 17:17:11,377 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1319 transitions. [2022-11-21 17:17:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-11-21 17:17:11,379 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:11,381 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:17:11,391 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-21 17:17:11,586 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-11-21 17:17:11,587 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:11,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:11,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1396789480, now seen corresponding path program 1 times [2022-11-21 17:17:11,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:11,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536239535] [2022-11-21 17:17:11,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:11,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:11,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:11,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 17:17:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:11,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:17:11,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:11,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 17:17:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:11,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 17:17:11,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:11,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 17:17:11,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:11,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-11-21 17:17:11,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:11,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:11,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:11,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-11-21 17:17:11,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:11,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:11,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:11,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-11-21 17:17:11,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:11,744 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 17:17:11,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:11,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536239535] [2022-11-21 17:17:11,744 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536239535] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:11,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1920027076] [2022-11-21 17:17:11,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:11,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:11,745 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:17:11,746 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:17:11,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-21 17:17:11,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:11,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 17:17:11,861 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:17:11,983 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-11-21 17:17:11,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:17:11,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1920027076] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:17:11,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:17:11,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2022-11-21 17:17:11,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868349916] [2022-11-21 17:17:11,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:11,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:17:11,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:11,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:17:11,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:17:11,986 INFO L87 Difference]: Start difference. First operand 944 states and 1319 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-21 17:17:12,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:12,186 INFO L93 Difference]: Finished difference Result 2739 states and 3855 transitions. [2022-11-21 17:17:12,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:17:12,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 119 [2022-11-21 17:17:12,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:12,194 INFO L225 Difference]: With dead ends: 2739 [2022-11-21 17:17:12,194 INFO L226 Difference]: Without dead ends: 1806 [2022-11-21 17:17:12,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:17:12,197 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 80 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:12,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 313 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:17:12,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1806 states. [2022-11-21 17:17:12,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1806 to 1780. [2022-11-21 17:17:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1780 states, 1430 states have (on average 1.4055944055944056) internal successors, (2010), 1454 states have internal predecessors, (2010), 206 states have call successors, (206), 128 states have call predecessors, (206), 143 states have return successors, (257), 201 states have call predecessors, (257), 204 states have call successors, (257) [2022-11-21 17:17:12,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1780 states to 1780 states and 2473 transitions. [2022-11-21 17:17:12,376 INFO L78 Accepts]: Start accepts. Automaton has 1780 states and 2473 transitions. Word has length 119 [2022-11-21 17:17:12,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:12,377 INFO L495 AbstractCegarLoop]: Abstraction has 1780 states and 2473 transitions. [2022-11-21 17:17:12,377 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 2 states have internal predecessors, (85), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-21 17:17:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 1780 states and 2473 transitions. [2022-11-21 17:17:12,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-11-21 17:17:12,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:12,382 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:17:12,393 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-21 17:17:12,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:12,588 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:12,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:12,589 INFO L85 PathProgramCache]: Analyzing trace with hash -936187258, now seen corresponding path program 1 times [2022-11-21 17:17:12,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:12,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930322491] [2022-11-21 17:17:12,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:12,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:12,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 17:17:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:12,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:17:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:12,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 17:17:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:12,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 17:17:12,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:12,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 17:17:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:12,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-21 17:17:12,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:12,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-21 17:17:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:12,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:12,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 17:17:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:12,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:12,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-21 17:17:12,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:12,765 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2022-11-21 17:17:12,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:12,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930322491] [2022-11-21 17:17:12,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930322491] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:12,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645533779] [2022-11-21 17:17:12,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:12,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:12,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:17:12,767 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:17:12,787 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-21 17:17:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:12,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 17:17:12,884 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:17:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-21 17:17:12,933 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:17:12,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645533779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:17:12,933 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:17:12,933 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-21 17:17:12,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901266429] [2022-11-21 17:17:12,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:12,934 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:17:12,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:12,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:17:12,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:17:12,935 INFO L87 Difference]: Start difference. First operand 1780 states and 2473 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-21 17:17:13,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:13,222 INFO L93 Difference]: Finished difference Result 3748 states and 5212 transitions. [2022-11-21 17:17:13,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:17:13,223 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 135 [2022-11-21 17:17:13,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:13,232 INFO L225 Difference]: With dead ends: 3748 [2022-11-21 17:17:13,232 INFO L226 Difference]: Without dead ends: 1980 [2022-11-21 17:17:13,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:17:13,237 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 102 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:13,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 300 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:17:13,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2022-11-21 17:17:13,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1962. [2022-11-21 17:17:13,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1588 states have (on average 1.3652392947103276) internal successors, (2168), 1612 states have internal predecessors, (2168), 212 states have call successors, (212), 146 states have call predecessors, (212), 161 states have return successors, (281), 207 states have call predecessors, (281), 210 states have call successors, (281) [2022-11-21 17:17:13,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2661 transitions. [2022-11-21 17:17:13,477 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2661 transitions. Word has length 135 [2022-11-21 17:17:13,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:13,477 INFO L495 AbstractCegarLoop]: Abstraction has 1962 states and 2661 transitions. [2022-11-21 17:17:13,477 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-21 17:17:13,477 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2661 transitions. [2022-11-21 17:17:13,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-21 17:17:13,482 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:13,482 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:17:13,491 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-21 17:17:13,691 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:13,691 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:13,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:13,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1173690117, now seen corresponding path program 1 times [2022-11-21 17:17:13,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:13,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417826251] [2022-11-21 17:17:13,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:13,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:13,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 17:17:13,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:13,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:17:13,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:13,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 17:17:13,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:13,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 17:17:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:13,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 17:17:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:13,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 17:17:13,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:13,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 17:17:13,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:13,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:13,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:13,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-21 17:17:13,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:13,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:13,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:13,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-21 17:17:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:13,854 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-21 17:17:13,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:13,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417826251] [2022-11-21 17:17:13,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417826251] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:13,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1657410378] [2022-11-21 17:17:13,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:13,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:13,855 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:17:13,856 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:17:13,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-21 17:17:13,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:13,983 INFO L263 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-21 17:17:13,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:17:14,032 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-21 17:17:14,033 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:17:14,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1657410378] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:17:14,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:17:14,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-21 17:17:14,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172627115] [2022-11-21 17:17:14,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:14,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:17:14,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:14,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:17:14,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:17:14,035 INFO L87 Difference]: Start difference. First operand 1962 states and 2661 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-21 17:17:14,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:14,238 INFO L93 Difference]: Finished difference Result 3023 states and 4170 transitions. [2022-11-21 17:17:14,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:17:14,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 136 [2022-11-21 17:17:14,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:14,248 INFO L225 Difference]: With dead ends: 3023 [2022-11-21 17:17:14,248 INFO L226 Difference]: Without dead ends: 1988 [2022-11-21 17:17:14,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:17:14,252 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 111 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:14,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 402 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:17:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2022-11-21 17:17:14,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1962. [2022-11-21 17:17:14,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1962 states, 1588 states have (on average 1.3406801007556675) internal successors, (2129), 1612 states have internal predecessors, (2129), 212 states have call successors, (212), 146 states have call predecessors, (212), 161 states have return successors, (281), 207 states have call predecessors, (281), 210 states have call successors, (281) [2022-11-21 17:17:14,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1962 states to 1962 states and 2622 transitions. [2022-11-21 17:17:14,523 INFO L78 Accepts]: Start accepts. Automaton has 1962 states and 2622 transitions. Word has length 136 [2022-11-21 17:17:14,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:14,523 INFO L495 AbstractCegarLoop]: Abstraction has 1962 states and 2622 transitions. [2022-11-21 17:17:14,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-21 17:17:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 1962 states and 2622 transitions. [2022-11-21 17:17:14,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-21 17:17:14,529 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:14,529 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:17:14,540 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-21 17:17:14,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-21 17:17:14,735 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:14,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:14,736 INFO L85 PathProgramCache]: Analyzing trace with hash -304816677, now seen corresponding path program 1 times [2022-11-21 17:17:14,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:14,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436808283] [2022-11-21 17:17:14,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:14,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:14,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 17:17:14,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:14,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:17:14,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:14,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 17:17:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:14,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 17:17:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:14,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 17:17:14,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:14,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 17:17:14,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:14,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 17:17:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:14,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:14,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-21 17:17:14,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:14,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:14,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:14,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-21 17:17:14,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-21 17:17:14,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:14,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436808283] [2022-11-21 17:17:14,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436808283] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:14,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085154125] [2022-11-21 17:17:14,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:14,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:14,924 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:17:14,925 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:17:14,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-21 17:17:15,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:15,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 458 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 17:17:15,045 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:17:15,080 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-21 17:17:15,081 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:17:15,081 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085154125] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:17:15,081 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:17:15,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2022-11-21 17:17:15,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134541586] [2022-11-21 17:17:15,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:15,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 17:17:15,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:15,085 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 17:17:15,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:17:15,085 INFO L87 Difference]: Start difference. First operand 1962 states and 2622 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-21 17:17:15,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:15,333 INFO L93 Difference]: Finished difference Result 3759 states and 5079 transitions. [2022-11-21 17:17:15,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 17:17:15,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 136 [2022-11-21 17:17:15,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:15,342 INFO L225 Difference]: With dead ends: 3759 [2022-11-21 17:17:15,342 INFO L226 Difference]: Without dead ends: 1938 [2022-11-21 17:17:15,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 17:17:15,348 INFO L413 NwaCegarLoop]: 154 mSDtfsCounter, 131 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:15,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 178 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:17:15,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2022-11-21 17:17:15,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1798. [2022-11-21 17:17:15,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1798 states, 1455 states have (on average 1.2879725085910654) internal successors, (1874), 1475 states have internal predecessors, (1874), 196 states have call successors, (196), 135 states have call predecessors, (196), 146 states have return successors, (227), 189 states have call predecessors, (227), 194 states have call successors, (227) [2022-11-21 17:17:15,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1798 states to 1798 states and 2297 transitions. [2022-11-21 17:17:15,557 INFO L78 Accepts]: Start accepts. Automaton has 1798 states and 2297 transitions. Word has length 136 [2022-11-21 17:17:15,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:15,558 INFO L495 AbstractCegarLoop]: Abstraction has 1798 states and 2297 transitions. [2022-11-21 17:17:15,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-21 17:17:15,558 INFO L276 IsEmpty]: Start isEmpty. Operand 1798 states and 2297 transitions. [2022-11-21 17:17:15,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-21 17:17:15,562 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:15,562 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:17:15,575 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-21 17:17:15,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:15,774 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:15,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:15,774 INFO L85 PathProgramCache]: Analyzing trace with hash -829513402, now seen corresponding path program 1 times [2022-11-21 17:17:15,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:15,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613809329] [2022-11-21 17:17:15,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:15,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:15,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:15,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 17:17:15,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:15,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:17:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:15,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 17:17:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:15,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 17:17:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:15,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 17:17:15,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:15,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 17:17:15,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:15,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 17:17:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:15,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:15,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-21 17:17:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:15,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:15,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:15,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 17:17:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-21 17:17:15,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:15,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613809329] [2022-11-21 17:17:15,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613809329] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:15,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1774504767] [2022-11-21 17:17:15,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:15,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:15,952 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:17:15,953 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:17:15,989 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-21 17:17:16,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:16,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 17:17:16,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:17:16,190 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-21 17:17:16,190 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:17:16,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1774504767] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:17:16,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:17:16,191 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-21 17:17:16,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400306874] [2022-11-21 17:17:16,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:16,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:17:16,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:16,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:17:16,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-21 17:17:16,193 INFO L87 Difference]: Start difference. First operand 1798 states and 2297 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 17:17:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:16,587 INFO L93 Difference]: Finished difference Result 2932 states and 3786 transitions. [2022-11-21 17:17:16,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-21 17:17:16,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-11-21 17:17:16,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:16,607 INFO L225 Difference]: With dead ends: 2932 [2022-11-21 17:17:16,607 INFO L226 Difference]: Without dead ends: 1654 [2022-11-21 17:17:16,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-11-21 17:17:16,612 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 149 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:16,613 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 255 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 17:17:16,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1654 states. [2022-11-21 17:17:16,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1654 to 1193. [2022-11-21 17:17:16,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1193 states, 968 states have (on average 1.2572314049586777) internal successors, (1217), 980 states have internal predecessors, (1217), 131 states have call successors, (131), 88 states have call predecessors, (131), 93 states have return successors, (145), 125 states have call predecessors, (145), 129 states have call successors, (145) [2022-11-21 17:17:16,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1193 states to 1193 states and 1493 transitions. [2022-11-21 17:17:16,778 INFO L78 Accepts]: Start accepts. Automaton has 1193 states and 1493 transitions. Word has length 137 [2022-11-21 17:17:16,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:16,778 INFO L495 AbstractCegarLoop]: Abstraction has 1193 states and 1493 transitions. [2022-11-21 17:17:16,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 17:17:16,779 INFO L276 IsEmpty]: Start isEmpty. Operand 1193 states and 1493 transitions. [2022-11-21 17:17:16,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-21 17:17:16,782 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:16,782 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:17:16,789 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-21 17:17:16,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:16,989 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:16,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:16,990 INFO L85 PathProgramCache]: Analyzing trace with hash 1598745220, now seen corresponding path program 1 times [2022-11-21 17:17:16,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:16,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830137924] [2022-11-21 17:17:16,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:16,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:17,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 17:17:17,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:17,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:17:17,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:17,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 17:17:17,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:17,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 17:17:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:17,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 17:17:17,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:17,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 17:17:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:17,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 17:17:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:17,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:17,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-21 17:17:17,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:17,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:17,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 17:17:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:17,144 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-21 17:17:17,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:17,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830137924] [2022-11-21 17:17:17,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830137924] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:17,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960539727] [2022-11-21 17:17:17,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:17,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:17,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:17:17,146 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:17:17,163 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-21 17:17:17,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:17,270 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-21 17:17:17,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:17:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-21 17:17:17,373 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:17:17,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960539727] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:17:17,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:17:17,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 10 [2022-11-21 17:17:17,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012139960] [2022-11-21 17:17:17,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:17,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:17:17,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:17,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:17:17,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-21 17:17:17,376 INFO L87 Difference]: Start difference. First operand 1193 states and 1493 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 17:17:17,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:17,775 INFO L93 Difference]: Finished difference Result 2526 states and 3209 transitions. [2022-11-21 17:17:17,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:17:17,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-11-21 17:17:17,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:17,781 INFO L225 Difference]: With dead ends: 2526 [2022-11-21 17:17:17,782 INFO L226 Difference]: Without dead ends: 1343 [2022-11-21 17:17:17,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-11-21 17:17:17,786 INFO L413 NwaCegarLoop]: 99 mSDtfsCounter, 171 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:17,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 249 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:17:17,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1343 states. [2022-11-21 17:17:17,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1343 to 1287. [2022-11-21 17:17:17,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1287 states, 1056 states have (on average 1.2017045454545454) internal successors, (1269), 1068 states have internal predecessors, (1269), 131 states have call successors, (131), 94 states have call predecessors, (131), 99 states have return successors, (145), 125 states have call predecessors, (145), 129 states have call successors, (145) [2022-11-21 17:17:17,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1287 states to 1287 states and 1545 transitions. [2022-11-21 17:17:17,964 INFO L78 Accepts]: Start accepts. Automaton has 1287 states and 1545 transitions. Word has length 137 [2022-11-21 17:17:17,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:17,964 INFO L495 AbstractCegarLoop]: Abstraction has 1287 states and 1545 transitions. [2022-11-21 17:17:17,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 17:17:17,964 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 1545 transitions. [2022-11-21 17:17:17,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-21 17:17:17,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:17,967 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:17:17,973 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-21 17:17:18,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-21 17:17:18,173 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:18,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:18,174 INFO L85 PathProgramCache]: Analyzing trace with hash 291602822, now seen corresponding path program 1 times [2022-11-21 17:17:18,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:18,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395355024] [2022-11-21 17:17:18,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:18,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:18,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 17:17:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:18,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:17:18,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:18,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 17:17:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:18,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 17:17:18,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:18,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 17:17:18,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:18,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 17:17:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:18,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 17:17:18,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:18,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:18,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:18,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-21 17:17:18,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:18,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:18,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:18,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 17:17:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:18,312 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2022-11-21 17:17:18,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:18,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395355024] [2022-11-21 17:17:18,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395355024] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:18,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [974333131] [2022-11-21 17:17:18,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:18,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:18,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:17:18,315 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:17:18,335 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-21 17:17:18,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:18,426 INFO L263 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 17:17:18,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:17:18,466 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2022-11-21 17:17:18,467 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:17:18,467 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [974333131] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:17:18,467 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:17:18,467 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-21 17:17:18,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496649554] [2022-11-21 17:17:18,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:18,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:17:18,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:18,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:17:18,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:17:18,469 INFO L87 Difference]: Start difference. First operand 1287 states and 1545 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 17:17:18,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:18,713 INFO L93 Difference]: Finished difference Result 2430 states and 2939 transitions. [2022-11-21 17:17:18,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:17:18,714 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-11-21 17:17:18,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:18,719 INFO L225 Difference]: With dead ends: 2430 [2022-11-21 17:17:18,719 INFO L226 Difference]: Without dead ends: 1154 [2022-11-21 17:17:18,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:17:18,723 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 48 mSDsluCounter, 441 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:18,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 585 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:17:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2022-11-21 17:17:18,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1118. [2022-11-21 17:17:18,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1118 states, 919 states have (on average 1.1664853101196953) internal successors, (1072), 930 states have internal predecessors, (1072), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-11-21 17:17:18,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1118 states to 1118 states and 1305 transitions. [2022-11-21 17:17:18,953 INFO L78 Accepts]: Start accepts. Automaton has 1118 states and 1305 transitions. Word has length 137 [2022-11-21 17:17:18,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:18,953 INFO L495 AbstractCegarLoop]: Abstraction has 1118 states and 1305 transitions. [2022-11-21 17:17:18,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 17:17:18,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1118 states and 1305 transitions. [2022-11-21 17:17:18,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-21 17:17:18,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:18,956 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:17:18,980 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-21 17:17:19,165 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-11-21 17:17:19,165 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:19,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:19,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1015302262, now seen corresponding path program 1 times [2022-11-21 17:17:19,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:19,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016918126] [2022-11-21 17:17:19,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:19,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:19,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:19,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 17:17:19,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:19,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:17:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:19,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 17:17:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:19,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 17:17:19,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:19,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 17:17:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:19,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 17:17:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:19,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 17:17:19,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:19,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:19,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:19,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-21 17:17:19,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:19,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:19,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 17:17:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:19,301 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-11-21 17:17:19,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:19,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016918126] [2022-11-21 17:17:19,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016918126] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 17:17:19,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827926824] [2022-11-21 17:17:19,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:19,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:19,302 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 17:17:19,303 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 17:17:19,331 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-21 17:17:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:19,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-21 17:17:19,420 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 17:17:19,445 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-11-21 17:17:19,445 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 17:17:19,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827926824] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:17:19,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 17:17:19,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 7 [2022-11-21 17:17:19,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571852957] [2022-11-21 17:17:19,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:19,447 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:17:19,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:19,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:17:19,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 17:17:19,448 INFO L87 Difference]: Start difference. First operand 1118 states and 1305 transitions. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 17:17:19,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:19,643 INFO L93 Difference]: Finished difference Result 2253 states and 2674 transitions. [2022-11-21 17:17:19,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:17:19,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 137 [2022-11-21 17:17:19,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:19,648 INFO L225 Difference]: With dead ends: 2253 [2022-11-21 17:17:19,648 INFO L226 Difference]: Without dead ends: 1146 [2022-11-21 17:17:19,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 157 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-21 17:17:19,651 INFO L413 NwaCegarLoop]: 144 mSDtfsCounter, 10 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:19,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 575 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-21 17:17:19,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2022-11-21 17:17:19,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1130. [2022-11-21 17:17:19,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1130 states, 931 states have (on average 1.1417830290010742) internal successors, (1063), 942 states have internal predecessors, (1063), 112 states have call successors, (112), 80 states have call predecessors, (112), 86 states have return successors, (121), 108 states have call predecessors, (121), 110 states have call successors, (121) [2022-11-21 17:17:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1130 states to 1130 states and 1296 transitions. [2022-11-21 17:17:19,837 INFO L78 Accepts]: Start accepts. Automaton has 1130 states and 1296 transitions. Word has length 137 [2022-11-21 17:17:19,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:19,837 INFO L495 AbstractCegarLoop]: Abstraction has 1130 states and 1296 transitions. [2022-11-21 17:17:19,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 17:17:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1130 states and 1296 transitions. [2022-11-21 17:17:19,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-11-21 17:17:19,840 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:19,840 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:17:19,851 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-21 17:17:20,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 17:17:20,046 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:20,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:20,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1278353166, now seen corresponding path program 1 times [2022-11-21 17:17:20,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:20,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223911315] [2022-11-21 17:17:20,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:20,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:20,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 17:17:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:20,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:17:20,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:20,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 17:17:20,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:20,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 17:17:20,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:20,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 17:17:20,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:20,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 17:17:20,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:20,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 17:17:20,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:20,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:20,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:20,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-21 17:17:20,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:20,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:20,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 17:17:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:20,204 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2022-11-21 17:17:20,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:20,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223911315] [2022-11-21 17:17:20,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223911315] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:17:20,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:17:20,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 17:17:20,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95406169] [2022-11-21 17:17:20,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:20,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 17:17:20,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:20,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 17:17:20,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:17:20,207 INFO L87 Difference]: Start difference. First operand 1130 states and 1296 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-21 17:17:20,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:20,982 INFO L93 Difference]: Finished difference Result 2094 states and 2378 transitions. [2022-11-21 17:17:20,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 17:17:20,982 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) Word has length 137 [2022-11-21 17:17:20,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:20,992 INFO L225 Difference]: With dead ends: 2094 [2022-11-21 17:17:20,993 INFO L226 Difference]: Without dead ends: 2091 [2022-11-21 17:17:20,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-11-21 17:17:20,995 INFO L413 NwaCegarLoop]: 169 mSDtfsCounter, 499 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 389 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 522 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:20,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [522 Valid, 476 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 389 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 17:17:20,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2091 states. [2022-11-21 17:17:21,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2091 to 1506. [2022-11-21 17:17:21,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1506 states, 1241 states have (on average 1.1402095084609185) internal successors, (1415), 1256 states have internal predecessors, (1415), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-11-21 17:17:21,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1724 transitions. [2022-11-21 17:17:21,306 INFO L78 Accepts]: Start accepts. Automaton has 1506 states and 1724 transitions. Word has length 137 [2022-11-21 17:17:21,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:21,307 INFO L495 AbstractCegarLoop]: Abstraction has 1506 states and 1724 transitions. [2022-11-21 17:17:21,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 5 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 3 states have call predecessors, (9), 4 states have call successors, (9) [2022-11-21 17:17:21,307 INFO L276 IsEmpty]: Start isEmpty. Operand 1506 states and 1724 transitions. [2022-11-21 17:17:21,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-11-21 17:17:21,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:21,310 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:17:21,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-21 17:17:21,310 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:21,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:21,310 INFO L85 PathProgramCache]: Analyzing trace with hash -1645790282, now seen corresponding path program 1 times [2022-11-21 17:17:21,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:21,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949438801] [2022-11-21 17:17:21,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:21,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:21,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-21 17:17:21,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:21,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 17:17:21,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:21,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2022-11-21 17:17:21,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:21,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 17:17:21,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:21,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-21 17:17:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:21,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-11-21 17:17:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:21,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 17:17:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:21,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:21,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-21 17:17:21,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:21,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 17:17:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:21,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-11-21 17:17:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 17:17:21,392 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-11-21 17:17:21,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 17:17:21,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949438801] [2022-11-21 17:17:21,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949438801] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 17:17:21,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 17:17:21,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-21 17:17:21,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173016877] [2022-11-21 17:17:21,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 17:17:21,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-21 17:17:21,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 17:17:21,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-21 17:17:21,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-21 17:17:21,394 INFO L87 Difference]: Start difference. First operand 1506 states and 1724 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 17:17:21,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 17:17:21,896 INFO L93 Difference]: Finished difference Result 2729 states and 3212 transitions. [2022-11-21 17:17:21,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 17:17:21,897 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) Word has length 141 [2022-11-21 17:17:21,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 17:17:21,912 INFO L225 Difference]: With dead ends: 2729 [2022-11-21 17:17:21,912 INFO L226 Difference]: Without dead ends: 1869 [2022-11-21 17:17:21,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-21 17:17:21,915 INFO L413 NwaCegarLoop]: 168 mSDtfsCounter, 144 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-21 17:17:21,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 446 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-21 17:17:21,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2022-11-21 17:17:22,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1508. [2022-11-21 17:17:22,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1508 states, 1243 states have (on average 1.1399839098954143) internal successors, (1417), 1258 states have internal predecessors, (1417), 146 states have call successors, (146), 104 states have call predecessors, (146), 118 states have return successors, (163), 146 states have call predecessors, (163), 144 states have call successors, (163) [2022-11-21 17:17:22,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 1726 transitions. [2022-11-21 17:17:22,174 INFO L78 Accepts]: Start accepts. Automaton has 1508 states and 1726 transitions. Word has length 141 [2022-11-21 17:17:22,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 17:17:22,175 INFO L495 AbstractCegarLoop]: Abstraction has 1508 states and 1726 transitions. [2022-11-21 17:17:22,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 3 states have internal predecessors, (75), 3 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 1 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-21 17:17:22,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1508 states and 1726 transitions. [2022-11-21 17:17:22,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-11-21 17:17:22,177 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 17:17:22,178 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:17:22,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-21 17:17:22,178 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting error2Err0ASSERT_VIOLATIONERROR_FUNCTION === [error1Err0ASSERT_VIOLATIONERROR_FUNCTION, error2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-21 17:17:22,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 17:17:22,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1749276047, now seen corresponding path program 1 times [2022-11-21 17:17:22,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 17:17:22,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845668374] [2022-11-21 17:17:22,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 17:17:22,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 17:17:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:17:22,198 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-21 17:17:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 17:17:22,270 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-21 17:17:22,270 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-21 17:17:22,271 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location error2Err0ASSERT_VIOLATIONERROR_FUNCTION (1 of 2 remaining) [2022-11-21 17:17:22,273 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location error1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 2 remaining) [2022-11-21 17:17:22,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-21 17:17:22,277 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 17:17:22,282 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-21 17:17:22,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.11 05:17:22 BoogieIcfgContainer [2022-11-21 17:17:22,455 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-21 17:17:22,456 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-21 17:17:22,456 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-21 17:17:22,456 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-21 17:17:22,456 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 05:16:57" (3/4) ... [2022-11-21 17:17:22,458 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-21 17:17:22,617 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/witness.graphml [2022-11-21 17:17:22,617 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-21 17:17:22,618 INFO L158 Benchmark]: Toolchain (without parser) took 27032.62ms. Allocated memory was 157.3MB in the beginning and 721.4MB in the end (delta: 564.1MB). Free memory was 114.3MB in the beginning and 510.0MB in the end (delta: -395.7MB). Peak memory consumption was 170.7MB. Max. memory is 16.1GB. [2022-11-21 17:17:22,618 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 113.2MB. Free memory is still 62.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-21 17:17:22,619 INFO L158 Benchmark]: CACSL2BoogieTranslator took 516.45ms. Allocated memory is still 157.3MB. Free memory was 114.3MB in the beginning and 98.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-21 17:17:22,620 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.11ms. Allocated memory is still 157.3MB. Free memory was 98.1MB in the beginning and 95.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:17:22,620 INFO L158 Benchmark]: Boogie Preprocessor took 66.12ms. Allocated memory is still 157.3MB. Free memory was 95.4MB in the beginning and 92.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-21 17:17:22,620 INFO L158 Benchmark]: RCFGBuilder took 773.56ms. Allocated memory is still 157.3MB. Free memory was 92.7MB in the beginning and 67.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-21 17:17:22,623 INFO L158 Benchmark]: TraceAbstraction took 25435.68ms. Allocated memory was 157.3MB in the beginning and 721.4MB in the end (delta: 564.1MB). Free memory was 66.7MB in the beginning and 524.7MB in the end (delta: -458.0MB). Peak memory consumption was 107.8MB. Max. memory is 16.1GB. [2022-11-21 17:17:22,623 INFO L158 Benchmark]: Witness Printer took 161.54ms. Allocated memory is still 721.4MB. Free memory was 524.7MB in the beginning and 510.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-21 17:17:22,634 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.29ms. Allocated memory is still 113.2MB. Free memory is still 62.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 516.45ms. Allocated memory is still 157.3MB. Free memory was 114.3MB in the beginning and 98.1MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.11ms. Allocated memory is still 157.3MB. Free memory was 98.1MB in the beginning and 95.4MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.12ms. Allocated memory is still 157.3MB. Free memory was 95.4MB in the beginning and 92.7MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 773.56ms. Allocated memory is still 157.3MB. Free memory was 92.7MB in the beginning and 67.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 25435.68ms. Allocated memory was 157.3MB in the beginning and 721.4MB in the end (delta: 564.1MB). Free memory was 66.7MB in the beginning and 524.7MB in the end (delta: -458.0MB). Peak memory consumption was 107.8MB. Max. memory is 16.1GB. * Witness Printer took 161.54ms. Allocated memory is still 721.4MB. Free memory was 524.7MB in the beginning and 510.0MB in the end (delta: 14.7MB). Peak memory consumption was 14.7MB. 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: 390]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L32] int q_buf_0 ; [L33] int q_free ; [L34] int q_read_ev ; [L35] int q_write_ev ; [L36] int p_num_write ; [L37] int p_last_write ; [L38] int p_dw_st ; [L39] int p_dw_pc ; [L40] int p_dw_i ; [L41] int c_num_read ; [L42] int c_last_read ; [L43] int c_dr_st ; [L44] int c_dr_pc ; [L45] int c_dr_i ; [L152] static int a_t ; [L394] int m_pc = 0; [L395] int t1_pc = 0; [L396] int m_st ; [L397] int t1_st ; [L398] int m_i ; [L399] int t1_i ; [L400] int M_E = 2; [L401] int T1_E = 2; [L402] int E_M = 2; [L403] int E_1 = 2; [L407] int token ; [L409] 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, token=0] [L868] COND FALSE !(__VERIFIER_nondet_int()) [L871] CALL main2() [L855] int __retres1 ; [L859] CALL init_model2() [L770] m_i = 1 [L771] t1_i = 1 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L859] RET init_model2() [L860] CALL start_simulation2() [L796] int kernel_st ; [L797] int tmp ; [L798] int tmp___0 ; [L802] kernel_st = 0 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, kernel_st=0, local=0, M_E=2, m_i=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L803] FCALL update_channels2() 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, kernel_st=0, local=0, M_E=2, m_i=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] CALL init_threads2() [L552] COND TRUE m_i == 1 [L553] m_st = 0 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L557] COND TRUE t1_i == 1 [L558] t1_st = 0 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L804] RET init_threads2() [L805] CALL fire_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L641] COND FALSE !(M_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L646] COND FALSE !(T1_E == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L651] COND FALSE !(E_M == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L656] COND FALSE !(E_1 == 0) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L805] RET fire_delta_events2() 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, kernel_st=0, local=0, M_E=2, m_i=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L806] CALL activate_threads2() VAL [\old(m_st)=0, \old(t1_st)=0, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L506] COND FALSE !(m_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L516] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L518] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND FALSE !(\read(tmp)) VAL [\old(m_st)=0, \old(t1_st)=0, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, token=0] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [\old(m_st)=0, \old(t1_st)=0, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L525] COND FALSE !(t1_pc == 1) VAL [\old(m_st)=0, \old(t1_st)=0, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L535] __retres1 = 0 VAL [\old(m_st)=0, \old(t1_st)=0, __retres1=0, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L537] return (__retres1); VAL [\old(m_st)=0, \old(t1_st)=0, \result=0, __retres1=0, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=0, \old(t1_st)=0, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=0, tmp___0=0, token=0] [L806] RET activate_threads2() 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, kernel_st=0, local=0, M_E=2, m_i=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L807] CALL reset_delta_events2() VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L669] COND FALSE !(M_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L674] COND FALSE !(T1_E == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L679] COND FALSE !(E_M == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L684] COND FALSE !(E_1 == 1) VAL [\old(E_1)=2, \old(E_M)=2, \old(M_E)=2, \old(T1_E)=2, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L807] RET reset_delta_events2() 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, kernel_st=0, local=0, M_E=2, m_i=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L810] COND TRUE 1 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, kernel_st=0, local=0, M_E=2, m_i=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L813] kernel_st = 1 [L814] CALL eval2() [L588] int tmp ; 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L592] COND TRUE 1 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] CALL, EXPR exists_runnable_thread2() 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L567] int __retres1 ; 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [__retres1=1, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L583] return (__retres1); VAL [\result=1, __retres1=1, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] RET, EXPR exists_runnable_thread2() 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, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND FALSE !(\read(tmp_ndt_1)) 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, tmp=1, tmp_ndt_1=0, token=0] [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE \read(tmp_ndt_2) [L621] t1_st = 1 [L622] CALL transmit1() [L470] COND TRUE t1_pc == 0 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L481] COND TRUE 1 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L483] t1_pc = 1 [L484] t1_st = 2 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L622] RET transmit1() [L592] COND TRUE 1 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L595] CALL, EXPR exists_runnable_thread2() 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L567] int __retres1 ; 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [__retres1=1, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L583] return (__retres1); VAL [\result=1, __retres1=1, 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L595] RET, EXPR exists_runnable_thread2() 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, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) 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=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=0, tmp_ndt_2=1, token=0] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE \read(tmp_ndt_1) [L607] m_st = 1 [L608] CALL master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] COND TRUE m_pc == 0 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=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L425] COND TRUE 1 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=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L428] token = __VERIFIER_nondet_int() [L429] local = token [L430] E_1 = 1 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=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=0, token=0] [L431] CALL immediate_notify() VAL [\old(m_st)=1, \old(t1_st)=2, 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=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L723] CALL activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, 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=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, 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=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L506] COND FALSE !(m_pc == 1) VAL [\old(m_st)=1, \old(t1_st)=2, 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=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L516] __retres1 = 0 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=0, 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=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L518] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=0, __retres1=0, 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=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND FALSE !(\read(tmp)) VAL [\old(m_st)=1, \old(t1_st)=2, 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=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=0, token=0] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [\old(m_st)=1, \old(t1_st)=2, 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=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L525] COND TRUE t1_pc == 1 VAL [\old(m_st)=1, \old(t1_st)=2, 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=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L526] COND TRUE E_1 == 1 [L527] __retres1 = 1 VAL [\old(m_st)=1, \old(t1_st)=2, __retres1=1, 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=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L537] return (__retres1); VAL [\old(m_st)=1, \old(t1_st)=2, \result=1, __retres1=1, 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=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND TRUE \read(tmp___0) [L710] t1_st = 0 VAL [\old(m_st)=1, \old(t1_st)=2, 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=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp=0, tmp___0=1, token=0] [L723] RET activate_threads2() VAL [\old(m_st)=1, \old(t1_st)=2, 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=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=0] [L431] RET immediate_notify() 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=1, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L432] E_1 = 2 [L433] m_pc = 1 [L434] m_st = 2 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=1, m_pc=1, m_st=2, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, tmp_var=0, token=0] [L608] RET master() [L616] COND TRUE t1_st == 0 [L617] int tmp_ndt_2; [L618] tmp_ndt_2 = __VERIFIER_nondet_int() [L619] COND TRUE \read(tmp_ndt_2) [L621] t1_st = 1 [L622] CALL transmit1() [L470] COND FALSE !(t1_pc == 0) 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=1, m_pc=1, m_st=2, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L473] COND TRUE t1_pc == 1 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=1, m_pc=1, m_st=2, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=0] [L489] token += 1 [L490] E_M = 1 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=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L491] CALL immediate_notify() VAL [\old(m_st)=2, \old(t1_st)=1, 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=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L723] CALL activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, 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=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L694] int tmp ; [L695] int tmp___0 ; [L699] CALL, EXPR is_master_triggered() [L503] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, 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=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L506] COND TRUE m_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, 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=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L507] COND TRUE E_M == 1 [L508] __retres1 = 1 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=1, 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=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L518] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=1, __retres1=1, 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=1, local=0, M_E=2, m_i=1, m_pc=1, m_st=2, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L699] RET, EXPR is_master_triggered() [L699] tmp = is_master_triggered() [L701] COND TRUE \read(tmp) [L702] m_st = 0 VAL [\old(m_st)=2, \old(t1_st)=1, 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=1, local=0, M_E=2, m_i=1, m_pc=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, token=1] [L707] CALL, EXPR is_transmit1_triggered() [L522] int __retres1 ; VAL [\old(m_st)=2, \old(t1_st)=1, 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=1, local=0, M_E=2, m_i=1, m_pc=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L525] COND TRUE t1_pc == 1 VAL [\old(m_st)=2, \old(t1_st)=1, 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=1, local=0, M_E=2, m_i=1, m_pc=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L526] COND FALSE !(E_1 == 1) VAL [\old(m_st)=2, \old(t1_st)=1, 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=1, local=0, M_E=2, m_i=1, m_pc=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L535] __retres1 = 0 VAL [\old(m_st)=2, \old(t1_st)=1, __retres1=0, 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=1, local=0, M_E=2, m_i=1, m_pc=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L537] return (__retres1); VAL [\old(m_st)=2, \old(t1_st)=1, \result=0, __retres1=0, 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=1, local=0, M_E=2, m_i=1, m_pc=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L707] RET, EXPR is_transmit1_triggered() [L707] tmp___0 = is_transmit1_triggered() [L709] COND FALSE !(\read(tmp___0)) VAL [\old(m_st)=2, \old(t1_st)=1, 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=1, local=0, M_E=2, m_i=1, m_pc=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, tmp=1, tmp___0=0, token=1] [L723] RET activate_threads2() VAL [\old(m_st)=2, \old(t1_st)=1, 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=1, local=0, M_E=2, m_i=1, m_pc=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L491] RET immediate_notify() 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=1, local=0, M_E=2, m_i=1, m_pc=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L492] E_M = 2 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=1, m_pc=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L481] COND TRUE 1 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=1, m_pc=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=1] [L483] t1_pc = 1 [L484] t1_st = 2 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=1, m_pc=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L622] RET transmit1() [L592] COND TRUE 1 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=1, m_pc=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L595] CALL, EXPR exists_runnable_thread2() 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=1, m_pc=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L567] int __retres1 ; 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=1, m_pc=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L570] COND TRUE m_st == 0 [L571] __retres1 = 1 VAL [__retres1=1, 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=1, m_pc=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L583] return (__retres1); VAL [\result=1, __retres1=1, 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=1, m_pc=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L595] RET, EXPR exists_runnable_thread2() 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, exists_runnable_thread2()=1, local=0, M_E=2, m_i=1, m_pc=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L595] tmp = exists_runnable_thread2() [L597] COND TRUE \read(tmp) 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=1, m_pc=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp=1, tmp_ndt_1=-1, tmp_ndt_2=1, token=1] [L602] COND TRUE m_st == 0 [L603] int tmp_ndt_1; [L604] tmp_ndt_1 = __VERIFIER_nondet_int() [L605] COND TRUE \read(tmp_ndt_1) [L607] m_st = 1 [L608] CALL master() [L412] int tmp_var = __VERIFIER_nondet_int(); [L414] COND FALSE !(m_pc == 0) 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=1, m_pc=1, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L417] COND TRUE m_pc == 1 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=1, m_pc=1, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L439] COND FALSE !(token != local + 1) 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=1, m_pc=1, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L444] COND TRUE tmp_var <= 5 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=1, m_pc=1, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L445] COND TRUE tmp_var >= 5 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=1, m_pc=1, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L450] COND TRUE tmp_var <= 5 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=1, m_pc=1, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L451] COND TRUE tmp_var >= 5 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=1, m_pc=1, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L452] COND TRUE tmp_var == 5 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=1, m_pc=1, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, tmp_var=5, token=1] [L453] CALL error2() 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=1, m_pc=1, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] [L390] reach_error() 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=1, m_pc=1, m_st=1, 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_free=0, q_read_ev=0, q_write_ev=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=1] - UnprovableResult [Line: 27]: 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 11 procedures, 187 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 25.2s, OverallIterations: 26, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6660 SdHoareTripleChecker+Valid, 5.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6463 mSDsluCounter, 13779 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 8455 mSDsCounter, 827 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5718 IncrementalHoareTripleChecker+Invalid, 6545 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 827 mSolverCounterUnsat, 5324 mSDtfsCounter, 5718 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 2206 GetRequests, 1996 SyntacticMatches, 4 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 597 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1962occurred in iteration=17, InterpolantAutomatonStates: 188, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 3176 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 3963 NumberOfCodeBlocks, 3963 NumberOfCodeBlocksAsserted, 39 NumberOfCheckSat, 3918 ConstructedInterpolants, 0 QuantifiedInterpolants, 6561 SizeOfPredicates, 10 NumberOfNonLiveVariables, 5146 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 40 InterpolantComputations, 24 PerfectInterpolantSequences, 1572/1814 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! [2022-11-21 17:17:22,662 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_762de451-28cd-4a98-aa11-d188e3da883f/bin/uautomizer-vX5HgA9Q3a/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