./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a 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_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R --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 d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 --- 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-38b53e6 [2022-11-25 17:08:41,821 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:08:41,823 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:08:41,845 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:08:41,846 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:08:41,847 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:08:41,849 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:08:41,851 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:08:41,853 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:08:41,854 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:08:41,855 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:08:41,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:08:41,857 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:08:41,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:08:41,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:08:41,861 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:08:41,862 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:08:41,863 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:08:41,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:08:41,867 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:08:41,869 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:08:41,870 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:08:41,872 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:08:41,873 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:08:41,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:08:41,877 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:08:41,878 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:08:41,879 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:08:41,879 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:08:41,880 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:08:41,881 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:08:41,882 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:08:41,883 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:08:41,884 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:08:41,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:08:41,885 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:08:41,886 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:08:41,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:08:41,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:08:41,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:08:41,889 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:08:41,894 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:08:41,929 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:08:41,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:08:41,935 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:08:41,935 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:08:41,936 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:08:41,937 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:08:41,938 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:08:41,939 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:08:41,940 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:08:41,940 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:08:41,941 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:08:41,942 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:08:41,942 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:08:41,942 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:08:41,943 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:08:41,943 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:08:41,943 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:08:41,943 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:08:41,944 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:08:41,944 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:08:41,944 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:08:41,944 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:08:41,945 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:08:41,945 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:08:41,945 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:08:41,945 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:08:41,946 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:08:41,946 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:08:41,947 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:08:41,947 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:08:41,948 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:08:41,948 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:08:41,948 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:08:41,949 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:08:41,949 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/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_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R 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 -> d6dd7af8c681da9a32811252853803422c95f4df19741eb4bc23f2d0511fe647 [2022-11-25 17:08:42,317 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:08:42,351 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:08:42,355 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:08:42,356 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:08:42,357 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:08:42,359 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2022-11-25 17:08:45,843 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:08:46,114 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:08:46,115 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2022-11-25 17:08:46,127 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/data/5864a0bff/c55de9198c134899b62a8c0014303f72/FLAG4865db81f [2022-11-25 17:08:46,146 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/data/5864a0bff/c55de9198c134899b62a8c0014303f72 [2022-11-25 17:08:46,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:08:46,152 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:08:46,154 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:08:46,154 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:08:46,160 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:08:46,161 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:08:46" (1/1) ... [2022-11-25 17:08:46,162 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4402b4bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:46, skipping insertion in model container [2022-11-25 17:08:46,163 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:08:46" (1/1) ... [2022-11-25 17:08:46,173 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:08:46,215 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:08:46,590 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_8156bb75-b902-4692-8811-6c69a6ebe05c/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2022-11-25 17:08:46,596 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:08:46,611 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:08:46,714 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_8156bb75-b902-4692-8811-6c69a6ebe05c/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2022-11-25 17:08:46,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:08:46,758 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:08:46,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:46 WrapperNode [2022-11-25 17:08:46,761 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:08:46,763 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:08:46,763 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:08:46,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:08:46,774 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:46" (1/1) ... [2022-11-25 17:08:46,790 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:46" (1/1) ... [2022-11-25 17:08:46,839 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 389 [2022-11-25 17:08:46,839 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:08:46,840 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:08:46,840 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:08:46,841 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:08:46,853 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:46" (1/1) ... [2022-11-25 17:08:46,853 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:46" (1/1) ... [2022-11-25 17:08:46,858 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:46" (1/1) ... [2022-11-25 17:08:46,859 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:46" (1/1) ... [2022-11-25 17:08:46,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:46" (1/1) ... [2022-11-25 17:08:46,878 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:46" (1/1) ... [2022-11-25 17:08:46,881 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:46" (1/1) ... [2022-11-25 17:08:46,883 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:46" (1/1) ... [2022-11-25 17:08:46,888 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:08:46,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:08:46,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:08:46,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:08:46,891 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:46" (1/1) ... [2022-11-25 17:08:46,899 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:08:46,914 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:08:46,931 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:08:46,952 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:08:46,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:08:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2022-11-25 17:08:46,996 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2022-11-25 17:08:46,996 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-11-25 17:08:46,997 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-11-25 17:08:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2022-11-25 17:08:46,997 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2022-11-25 17:08:46,997 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2022-11-25 17:08:46,997 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2022-11-25 17:08:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2022-11-25 17:08:46,998 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2022-11-25 17:08:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:08:46,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:08:46,999 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:08:47,133 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:08:47,136 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:08:47,883 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:08:47,895 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:08:47,898 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-25 17:08:47,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:08:47 BoogieIcfgContainer [2022-11-25 17:08:47,902 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:08:47,916 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:08:47,917 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:08:47,921 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:08:47,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:08:46" (1/3) ... [2022-11-25 17:08:47,930 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f54cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:08:47, skipping insertion in model container [2022-11-25 17:08:47,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:08:46" (2/3) ... [2022-11-25 17:08:47,931 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45f54cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:08:47, skipping insertion in model container [2022-11-25 17:08:47,931 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:08:47" (3/3) ... [2022-11-25 17:08:47,933 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2022-11-25 17:08:47,961 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:08:47,962 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:08:48,071 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:08:48,080 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;@5c1a1c9a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:08:48,081 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:08:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 136 states have (on average 1.6029411764705883) internal successors, (218), 140 states have internal predecessors, (218), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-25 17:08:48,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-25 17:08:48,101 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:48,102 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:48,103 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:48,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:48,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1581125196, now seen corresponding path program 1 times [2022-11-25 17:08:48,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:48,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209580033] [2022-11-25 17:08:48,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:48,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:48,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:48,536 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-25 17:08:48,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:48,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209580033] [2022-11-25 17:08:48,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209580033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:48,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:48,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:08:48,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107413719] [2022-11-25 17:08:48,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:48,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:48,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:48,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:48,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:08:48,631 INFO L87 Difference]: Start difference. First operand has 175 states, 136 states have (on average 1.6029411764705883) internal successors, (218), 140 states have internal predecessors, (218), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:48,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:48,771 INFO L93 Difference]: Finished difference Result 355 states and 607 transitions. [2022-11-25 17:08:48,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:48,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-25 17:08:48,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:48,797 INFO L225 Difference]: With dead ends: 355 [2022-11-25 17:08:48,802 INFO L226 Difference]: Without dead ends: 179 [2022-11-25 17:08:48,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-25 17:08:48,812 INFO L413 NwaCegarLoop]: 269 mSDtfsCounter, 18 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:48,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 790 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:08:48,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-11-25 17:08:48,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2022-11-25 17:08:48,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 138 states have (on average 1.5434782608695652) internal successors, (213), 141 states have internal predecessors, (213), 32 states have call successors, (32), 6 states have call predecessors, (32), 6 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2022-11-25 17:08:48,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 277 transitions. [2022-11-25 17:08:48,896 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 277 transitions. Word has length 15 [2022-11-25 17:08:48,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:48,897 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 277 transitions. [2022-11-25 17:08:48,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 2 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:48,898 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 277 transitions. [2022-11-25 17:08:48,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-25 17:08:48,900 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:48,901 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:48,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 17:08:48,901 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:48,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:48,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1712914003, now seen corresponding path program 1 times [2022-11-25 17:08:48,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:48,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102499140] [2022-11-25 17:08:48,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:48,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,040 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-25 17:08:49,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:49,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102499140] [2022-11-25 17:08:49,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102499140] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:49,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:49,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:08:49,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141846687] [2022-11-25 17:08:49,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:49,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:49,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:49,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:49,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:08:49,050 INFO L87 Difference]: Start difference. First operand 177 states and 277 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:49,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:49,162 INFO L93 Difference]: Finished difference Result 367 states and 577 transitions. [2022-11-25 17:08:49,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:49,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-25 17:08:49,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:49,166 INFO L225 Difference]: With dead ends: 367 [2022-11-25 17:08:49,167 INFO L226 Difference]: Without dead ends: 193 [2022-11-25 17:08:49,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-25 17:08:49,171 INFO L413 NwaCegarLoop]: 270 mSDtfsCounter, 25 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:49,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 799 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:08:49,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-11-25 17:08:49,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2022-11-25 17:08:49,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 149 states have (on average 1.523489932885906) internal successors, (227), 152 states have internal predecessors, (227), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-11-25 17:08:49,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 293 transitions. [2022-11-25 17:08:49,198 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 293 transitions. Word has length 16 [2022-11-25 17:08:49,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:49,199 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 293 transitions. [2022-11-25 17:08:49,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 17:08:49,200 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 293 transitions. [2022-11-25 17:08:49,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-25 17:08:49,202 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:49,202 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] [2022-11-25 17:08:49,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 17:08:49,203 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:49,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:49,204 INFO L85 PathProgramCache]: Analyzing trace with hash -218612603, now seen corresponding path program 1 times [2022-11-25 17:08:49,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:49,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737891630] [2022-11-25 17:08:49,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:49,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:49,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:49,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,327 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-25 17:08:49,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:49,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737891630] [2022-11-25 17:08:49,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737891630] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:49,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:49,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:08:49,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591417043] [2022-11-25 17:08:49,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:49,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 17:08:49,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:49,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 17:08:49,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:08:49,333 INFO L87 Difference]: Start difference. First operand 190 states and 293 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:08:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:49,368 INFO L93 Difference]: Finished difference Result 399 states and 623 transitions. [2022-11-25 17:08:49,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 17:08:49,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-11-25 17:08:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:49,371 INFO L225 Difference]: With dead ends: 399 [2022-11-25 17:08:49,372 INFO L226 Difference]: Without dead ends: 219 [2022-11-25 17:08:49,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 17:08:49,375 INFO L413 NwaCegarLoop]: 273 mSDtfsCounter, 22 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:49,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 540 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:08:49,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-11-25 17:08:49,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 192. [2022-11-25 17:08:49,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 151 states have (on average 1.5165562913907285) internal successors, (229), 154 states have internal predecessors, (229), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-11-25 17:08:49,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 295 transitions. [2022-11-25 17:08:49,400 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 295 transitions. Word has length 23 [2022-11-25 17:08:49,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:49,401 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 295 transitions. [2022-11-25 17:08:49,401 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 17:08:49,401 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 295 transitions. [2022-11-25 17:08:49,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-25 17:08:49,403 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:49,404 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] [2022-11-25 17:08:49,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 17:08:49,404 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:49,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:49,405 INFO L85 PathProgramCache]: Analyzing trace with hash 805469494, now seen corresponding path program 1 times [2022-11-25 17:08:49,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:49,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602427408] [2022-11-25 17:08:49,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:49,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:49,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,540 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-25 17:08:49,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:49,548 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602427408] [2022-11-25 17:08:49,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602427408] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:49,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:49,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:08:49,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221965164] [2022-11-25 17:08:49,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:49,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:49,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:49,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:49,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:08:49,556 INFO L87 Difference]: Start difference. First operand 192 states and 295 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:08:49,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:49,649 INFO L93 Difference]: Finished difference Result 430 states and 678 transitions. [2022-11-25 17:08:49,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:49,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 31 [2022-11-25 17:08:49,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:49,653 INFO L225 Difference]: With dead ends: 430 [2022-11-25 17:08:49,653 INFO L226 Difference]: Without dead ends: 289 [2022-11-25 17:08:49,654 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-25 17:08:49,656 INFO L413 NwaCegarLoop]: 288 mSDtfsCounter, 120 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:49,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 834 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:08:49,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-25 17:08:49,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2022-11-25 17:08:49,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 151 states have (on average 1.490066225165563) internal successors, (225), 154 states have internal predecessors, (225), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-11-25 17:08:49,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 291 transitions. [2022-11-25 17:08:49,714 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 291 transitions. Word has length 31 [2022-11-25 17:08:49,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:49,715 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 291 transitions. [2022-11-25 17:08:49,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:08:49,715 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 291 transitions. [2022-11-25 17:08:49,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-25 17:08:49,716 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:49,717 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 17:08:49,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-25 17:08:49,717 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:49,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:49,718 INFO L85 PathProgramCache]: Analyzing trace with hash -956786536, now seen corresponding path program 1 times [2022-11-25 17:08:49,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:49,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871273991] [2022-11-25 17:08:49,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:49,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:49,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:49,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:49,917 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:08:49,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:49,919 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871273991] [2022-11-25 17:08:49,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871273991] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:49,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:49,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:08:49,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833074943] [2022-11-25 17:08:49,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:49,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:08:49,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:49,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:08:49,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:49,925 INFO L87 Difference]: Start difference. First operand 192 states and 291 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:08:49,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:49,987 INFO L93 Difference]: Finished difference Result 374 states and 571 transitions. [2022-11-25 17:08:49,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:49,988 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2022-11-25 17:08:49,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:49,990 INFO L225 Difference]: With dead ends: 374 [2022-11-25 17:08:49,991 INFO L226 Difference]: Without dead ends: 194 [2022-11-25 17:08:49,992 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:49,994 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 0 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:49,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1052 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:08:49,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-25 17:08:50,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2022-11-25 17:08:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 151 states have (on average 1.4834437086092715) internal successors, (224), 154 states have internal predecessors, (224), 33 states have call successors, (33), 7 states have call predecessors, (33), 7 states have return successors, (33), 33 states have call predecessors, (33), 33 states have call successors, (33) [2022-11-25 17:08:50,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 290 transitions. [2022-11-25 17:08:50,015 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 290 transitions. Word has length 32 [2022-11-25 17:08:50,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:50,016 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 290 transitions. [2022-11-25 17:08:50,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:08:50,016 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 290 transitions. [2022-11-25 17:08:50,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-25 17:08:50,018 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:50,018 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-11-25 17:08:50,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-25 17:08:50,019 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:50,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:50,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1412048612, now seen corresponding path program 1 times [2022-11-25 17:08:50,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:50,020 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134023359] [2022-11-25 17:08:50,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:50,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:50,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:50,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:50,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:50,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:50,170 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:08:50,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:50,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134023359] [2022-11-25 17:08:50,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134023359] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:50,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960045657] [2022-11-25 17:08:50,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:50,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:50,172 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:08:50,181 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:08:50,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:08:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:50,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:08:50,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:50,430 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:08:50,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:08:50,517 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-25 17:08:50,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960045657] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:08:50,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:08:50,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-25 17:08:50,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306092258] [2022-11-25 17:08:50,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:08:50,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:08:50,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:50,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:08:50,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:50,523 INFO L87 Difference]: Start difference. First operand 192 states and 290 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:08:50,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:50,605 INFO L93 Difference]: Finished difference Result 432 states and 667 transitions. [2022-11-25 17:08:50,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:50,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 35 [2022-11-25 17:08:50,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:50,611 INFO L225 Difference]: With dead ends: 432 [2022-11-25 17:08:50,611 INFO L226 Difference]: Without dead ends: 251 [2022-11-25 17:08:50,617 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 72 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:50,622 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 58 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:50,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 1043 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:08:50,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-25 17:08:50,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2022-11-25 17:08:50,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 194 states have (on average 1.458762886597938) internal successors, (283), 197 states have internal predecessors, (283), 43 states have call successors, (43), 7 states have call predecessors, (43), 7 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-11-25 17:08:50,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 369 transitions. [2022-11-25 17:08:50,663 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 369 transitions. Word has length 35 [2022-11-25 17:08:50,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:50,664 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 369 transitions. [2022-11-25 17:08:50,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-11-25 17:08:50,664 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 369 transitions. [2022-11-25 17:08:50,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 17:08:50,677 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:50,678 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:50,691 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:50,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:50,891 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:50,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:50,892 INFO L85 PathProgramCache]: Analyzing trace with hash 1166895868, now seen corresponding path program 2 times [2022-11-25 17:08:50,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:50,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211004677] [2022-11-25 17:08:50,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:50,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:50,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:51,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:08:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:08:51,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,066 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-25 17:08:51,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:51,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211004677] [2022-11-25 17:08:51,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211004677] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:51,068 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:51,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:08:51,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709552644] [2022-11-25 17:08:51,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:51,072 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:51,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:51,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:51,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:08:51,074 INFO L87 Difference]: Start difference. First operand 245 states and 369 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:08:51,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:51,140 INFO L93 Difference]: Finished difference Result 470 states and 728 transitions. [2022-11-25 17:08:51,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:51,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2022-11-25 17:08:51,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:51,146 INFO L225 Difference]: With dead ends: 470 [2022-11-25 17:08:51,147 INFO L226 Difference]: Without dead ends: 254 [2022-11-25 17:08:51,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-25 17:08:51,155 INFO L413 NwaCegarLoop]: 265 mSDtfsCounter, 19 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:51,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 777 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:08:51,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-11-25 17:08:51,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2022-11-25 17:08:51,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 200 states have (on average 1.455) internal successors, (291), 203 states have internal predecessors, (291), 43 states have call successors, (43), 8 states have call predecessors, (43), 8 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2022-11-25 17:08:51,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 377 transitions. [2022-11-25 17:08:51,189 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 377 transitions. Word has length 57 [2022-11-25 17:08:51,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:51,190 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 377 transitions. [2022-11-25 17:08:51,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 3 states have internal predecessors, (26), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:08:51,191 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 377 transitions. [2022-11-25 17:08:51,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-25 17:08:51,192 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:51,193 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:51,193 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 17:08:51,193 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:51,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:51,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1021652299, now seen corresponding path program 1 times [2022-11-25 17:08:51,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:51,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600341403] [2022-11-25 17:08:51,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:51,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:51,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:51,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:08:51,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:08:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-25 17:08:51,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:51,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600341403] [2022-11-25 17:08:51,322 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600341403] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:51,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:51,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:08:51,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555761219] [2022-11-25 17:08:51,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:51,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:51,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:51,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:51,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:08:51,326 INFO L87 Difference]: Start difference. First operand 252 states and 377 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:08:51,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:51,389 INFO L93 Difference]: Finished difference Result 514 states and 780 transitions. [2022-11-25 17:08:51,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:51,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 57 [2022-11-25 17:08:51,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:51,393 INFO L225 Difference]: With dead ends: 514 [2022-11-25 17:08:51,394 INFO L226 Difference]: Without dead ends: 291 [2022-11-25 17:08:51,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 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-25 17:08:51,397 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 24 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:51,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 791 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:08:51,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-11-25 17:08:51,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2022-11-25 17:08:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 232 states have (on average 1.4137931034482758) internal successors, (328), 235 states have internal predecessors, (328), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-25 17:08:51,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 420 transitions. [2022-11-25 17:08:51,429 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 420 transitions. Word has length 57 [2022-11-25 17:08:51,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:51,432 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 420 transitions. [2022-11-25 17:08:51,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:08:51,433 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 420 transitions. [2022-11-25 17:08:51,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-25 17:08:51,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:51,435 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-25 17:08:51,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-25 17:08:51,436 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:51,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:51,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1670828143, now seen corresponding path program 1 times [2022-11-25 17:08:51,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:51,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21464530] [2022-11-25 17:08:51,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:51,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:51,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:51,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:08:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:08:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:08:51,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:08:51,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2022-11-25 17:08:51,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:51,607 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21464530] [2022-11-25 17:08:51,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21464530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:51,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:51,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:08:51,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275970475] [2022-11-25 17:08:51,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:51,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:08:51,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:51,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:08:51,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:51,611 INFO L87 Difference]: Start difference. First operand 288 states and 420 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:08:51,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:51,659 INFO L93 Difference]: Finished difference Result 525 states and 779 transitions. [2022-11-25 17:08:51,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:51,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 75 [2022-11-25 17:08:51,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:51,667 INFO L225 Difference]: With dead ends: 525 [2022-11-25 17:08:51,667 INFO L226 Difference]: Without dead ends: 290 [2022-11-25 17:08:51,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:51,672 INFO L413 NwaCegarLoop]: 266 mSDtfsCounter, 0 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:51,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1052 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:08:51,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-11-25 17:08:51,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2022-11-25 17:08:51,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 232 states have (on average 1.4008620689655173) internal successors, (325), 235 states have internal predecessors, (325), 46 states have call successors, (46), 9 states have call predecessors, (46), 9 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2022-11-25 17:08:51,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 417 transitions. [2022-11-25 17:08:51,696 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 417 transitions. Word has length 75 [2022-11-25 17:08:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:51,697 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 417 transitions. [2022-11-25 17:08:51,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:08:51,698 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 417 transitions. [2022-11-25 17:08:51,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-25 17:08:51,699 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:51,699 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:51,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-25 17:08:51,700 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:51,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:51,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1243330431, now seen corresponding path program 1 times [2022-11-25 17:08:51,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:51,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082379321] [2022-11-25 17:08:51,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:51,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:51,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:51,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:08:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:08:51,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:08:51,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:08:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:08:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:08:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2022-11-25 17:08:51,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:51,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082379321] [2022-11-25 17:08:51,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082379321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:51,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:51,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:08:51,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210488481] [2022-11-25 17:08:51,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:51,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:51,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:51,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:51,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:08:51,927 INFO L87 Difference]: Start difference. First operand 288 states and 417 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:08:51,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:51,993 INFO L93 Difference]: Finished difference Result 562 states and 835 transitions. [2022-11-25 17:08:51,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:51,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 104 [2022-11-25 17:08:51,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:51,996 INFO L225 Difference]: With dead ends: 562 [2022-11-25 17:08:51,997 INFO L226 Difference]: Without dead ends: 332 [2022-11-25 17:08:51,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-25 17:08:51,999 INFO L413 NwaCegarLoop]: 272 mSDtfsCounter, 25 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:51,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 791 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:08:52,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-11-25 17:08:52,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 329. [2022-11-25 17:08:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 269 states have (on average 1.3643122676579926) internal successors, (367), 272 states have internal predecessors, (367), 49 states have call successors, (49), 10 states have call predecessors, (49), 10 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2022-11-25 17:08:52,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 465 transitions. [2022-11-25 17:08:52,021 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 465 transitions. Word has length 104 [2022-11-25 17:08:52,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:52,022 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 465 transitions. [2022-11-25 17:08:52,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 3 states have internal predecessors, (37), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:08:52,026 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 465 transitions. [2022-11-25 17:08:52,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-25 17:08:52,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:52,035 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:52,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 17:08:52,036 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:52,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:52,037 INFO L85 PathProgramCache]: Analyzing trace with hash -712190712, now seen corresponding path program 1 times [2022-11-25 17:08:52,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:52,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673285081] [2022-11-25 17:08:52,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:52,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:52,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:52,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:08:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:08:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:08:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:08:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:08:52,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:08:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2022-11-25 17:08:52,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:52,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673285081] [2022-11-25 17:08:52,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673285081] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:52,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:52,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:08:52,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280540728] [2022-11-25 17:08:52,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:52,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:52,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:52,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:52,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:08:52,209 INFO L87 Difference]: Start difference. First operand 329 states and 465 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:08:52,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:52,269 INFO L93 Difference]: Finished difference Result 588 states and 855 transitions. [2022-11-25 17:08:52,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:08:52,270 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 105 [2022-11-25 17:08:52,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:52,273 INFO L225 Difference]: With dead ends: 588 [2022-11-25 17:08:52,273 INFO L226 Difference]: Without dead ends: 323 [2022-11-25 17:08:52,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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-25 17:08:52,275 INFO L413 NwaCegarLoop]: 258 mSDtfsCounter, 15 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:52,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 750 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:08:52,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-25 17:08:52,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2022-11-25 17:08:52,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 264 states have (on average 1.3446969696969697) internal successors, (355), 267 states have internal predecessors, (355), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-11-25 17:08:52,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 451 transitions. [2022-11-25 17:08:52,294 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 451 transitions. Word has length 105 [2022-11-25 17:08:52,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:52,295 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 451 transitions. [2022-11-25 17:08:52,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 3 states have internal predecessors, (35), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:08:52,295 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 451 transitions. [2022-11-25 17:08:52,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-25 17:08:52,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:52,297 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 6, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-25 17:08:52,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 17:08:52,298 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:52,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:52,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1828942627, now seen corresponding path program 1 times [2022-11-25 17:08:52,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:52,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405651075] [2022-11-25 17:08:52,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:52,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:52,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:52,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:52,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:08:52,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:08:52,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:08:52,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:08:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:08:52,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:08:52,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:08:52,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:08:52,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,468 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 198 trivial. 0 not checked. [2022-11-25 17:08:52,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:52,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405651075] [2022-11-25 17:08:52,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405651075] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:52,469 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:52,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:08:52,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207298212] [2022-11-25 17:08:52,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:52,470 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:08:52,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:52,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:08:52,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:52,471 INFO L87 Difference]: Start difference. First operand 323 states and 451 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 17:08:52,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:52,522 INFO L93 Difference]: Finished difference Result 563 states and 804 transitions. [2022-11-25 17:08:52,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:52,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) Word has length 124 [2022-11-25 17:08:52,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:52,526 INFO L225 Difference]: With dead ends: 563 [2022-11-25 17:08:52,526 INFO L226 Difference]: Without dead ends: 325 [2022-11-25 17:08:52,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:52,528 INFO L413 NwaCegarLoop]: 262 mSDtfsCounter, 0 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1037 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:52,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1037 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:08:52,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-11-25 17:08:52,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2022-11-25 17:08:52,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 323 states, 264 states have (on average 1.3333333333333333) internal successors, (352), 267 states have internal predecessors, (352), 48 states have call successors, (48), 10 states have call predecessors, (48), 10 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-11-25 17:08:52,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 448 transitions. [2022-11-25 17:08:52,547 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 448 transitions. Word has length 124 [2022-11-25 17:08:52,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:52,548 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 448 transitions. [2022-11-25 17:08:52,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (6), 2 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 17:08:52,548 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 448 transitions. [2022-11-25 17:08:52,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-25 17:08:52,551 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:52,551 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-25 17:08:52,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 17:08:52,551 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:52,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:52,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1531403375, now seen corresponding path program 1 times [2022-11-25 17:08:52,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:52,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544957590] [2022-11-25 17:08:52,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:52,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:52,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:52,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:52,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:08:52,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:08:52,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:08:52,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:08:52,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:08:52,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:08:52,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:08:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:08:52,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:08:52,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:08:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,705 INFO L134 CoverageAnalysis]: Checked inductivity of 399 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2022-11-25 17:08:52,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:52,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544957590] [2022-11-25 17:08:52,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544957590] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:52,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:52,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:08:52,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510172027] [2022-11-25 17:08:52,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:52,707 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:52,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:52,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:52,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:08:52,708 INFO L87 Difference]: Start difference. First operand 323 states and 448 transitions. Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 17:08:52,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:52,776 INFO L93 Difference]: Finished difference Result 526 states and 764 transitions. [2022-11-25 17:08:52,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:08:52,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 157 [2022-11-25 17:08:52,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:52,779 INFO L225 Difference]: With dead ends: 526 [2022-11-25 17:08:52,780 INFO L226 Difference]: Without dead ends: 321 [2022-11-25 17:08:52,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 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-25 17:08:52,781 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 13 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 718 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:52,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 718 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:08:52,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-11-25 17:08:52,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2022-11-25 17:08:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 263 states have (on average 1.3307984790874525) internal successors, (350), 266 states have internal predecessors, (350), 47 states have call successors, (47), 10 states have call predecessors, (47), 10 states have return successors, (47), 47 states have call predecessors, (47), 47 states have call successors, (47) [2022-11-25 17:08:52,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 444 transitions. [2022-11-25 17:08:52,798 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 444 transitions. Word has length 157 [2022-11-25 17:08:52,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:52,799 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 444 transitions. [2022-11-25 17:08:52,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.5) internal successors, (42), 3 states have internal predecessors, (42), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-11-25 17:08:52,799 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 444 transitions. [2022-11-25 17:08:52,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-11-25 17:08:52,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:52,802 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:08:52,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 17:08:52,803 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:52,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:52,803 INFO L85 PathProgramCache]: Analyzing trace with hash -124413893, now seen corresponding path program 1 times [2022-11-25 17:08:52,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:52,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661202252] [2022-11-25 17:08:52,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:52,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:52,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:52,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:08:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:08:52,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:08:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:08:52,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:08:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:08:52,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:08:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:08:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:08:52,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:08:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:08:52,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:52,966 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2022-11-25 17:08:52,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:52,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661202252] [2022-11-25 17:08:52,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661202252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:52,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:52,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:08:52,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663069421] [2022-11-25 17:08:52,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:52,968 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:52,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:52,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:52,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:08:52,969 INFO L87 Difference]: Start difference. First operand 321 states and 444 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 17:08:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:53,035 INFO L93 Difference]: Finished difference Result 466 states and 660 transitions. [2022-11-25 17:08:53,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:53,036 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 172 [2022-11-25 17:08:53,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:53,038 INFO L225 Difference]: With dead ends: 466 [2022-11-25 17:08:53,038 INFO L226 Difference]: Without dead ends: 304 [2022-11-25 17:08:53,039 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-25 17:08:53,040 INFO L413 NwaCegarLoop]: 245 mSDtfsCounter, 35 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:53,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 699 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:08:53,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-25 17:08:53,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2022-11-25 17:08:53,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 249 states have (on average 1.321285140562249) internal successors, (329), 252 states have internal predecessors, (329), 44 states have call successors, (44), 10 states have call predecessors, (44), 10 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2022-11-25 17:08:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 417 transitions. [2022-11-25 17:08:53,058 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 417 transitions. Word has length 172 [2022-11-25 17:08:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:53,058 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 417 transitions. [2022-11-25 17:08:53,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 17:08:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 417 transitions. [2022-11-25 17:08:53,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-11-25 17:08:53,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:53,062 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 9, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:08:53,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 17:08:53,062 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:53,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:53,063 INFO L85 PathProgramCache]: Analyzing trace with hash -225788768, now seen corresponding path program 1 times [2022-11-25 17:08:53,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:53,063 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075426339] [2022-11-25 17:08:53,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:53,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:08:53,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:08:53,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:08:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:08:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:08:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:08:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:08:53,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:08:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:08:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:08:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:08:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:08:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,210 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 414 trivial. 0 not checked. [2022-11-25 17:08:53,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:53,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075426339] [2022-11-25 17:08:53,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075426339] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:53,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:53,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:08:53,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109091181] [2022-11-25 17:08:53,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:53,212 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:53,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:53,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:53,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:08:53,213 INFO L87 Difference]: Start difference. First operand 304 states and 417 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 17:08:53,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:53,274 INFO L93 Difference]: Finished difference Result 449 states and 633 transitions. [2022-11-25 17:08:53,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:53,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) Word has length 174 [2022-11-25 17:08:53,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:53,277 INFO L225 Difference]: With dead ends: 449 [2022-11-25 17:08:53,278 INFO L226 Difference]: Without dead ends: 285 [2022-11-25 17:08:53,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-25 17:08:53,279 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 30 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 703 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:53,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 703 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:08:53,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-25 17:08:53,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2022-11-25 17:08:53,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 233 states have (on average 1.3133047210300428) internal successors, (306), 236 states have internal predecessors, (306), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-11-25 17:08:53,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 388 transitions. [2022-11-25 17:08:53,294 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 388 transitions. Word has length 174 [2022-11-25 17:08:53,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:53,295 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 388 transitions. [2022-11-25 17:08:53,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 3 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 3 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 17:08:53,295 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 388 transitions. [2022-11-25 17:08:53,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-11-25 17:08:53,298 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:53,298 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 6, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:08:53,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 17:08:53,299 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:53,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:53,299 INFO L85 PathProgramCache]: Analyzing trace with hash -771772203, now seen corresponding path program 1 times [2022-11-25 17:08:53,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:53,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157492808] [2022-11-25 17:08:53,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:53,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:53,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:53,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:08:53,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:08:53,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:08:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:08:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:08:53,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:08:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:08:53,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:08:53,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:08:53,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:08:53,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:08:53,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:08:53,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,470 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 399 trivial. 0 not checked. [2022-11-25 17:08:53,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:53,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157492808] [2022-11-25 17:08:53,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157492808] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:53,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:53,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:08:53,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140567082] [2022-11-25 17:08:53,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:53,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:08:53,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:53,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:08:53,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:53,473 INFO L87 Difference]: Start difference. First operand 285 states and 388 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-25 17:08:53,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:53,498 INFO L93 Difference]: Finished difference Result 429 states and 603 transitions. [2022-11-25 17:08:53,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:53,499 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) Word has length 175 [2022-11-25 17:08:53,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:53,501 INFO L225 Difference]: With dead ends: 429 [2022-11-25 17:08:53,501 INFO L226 Difference]: Without dead ends: 285 [2022-11-25 17:08:53,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:53,502 INFO L413 NwaCegarLoop]: 256 mSDtfsCounter, 0 mSDsluCounter, 760 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1016 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:53,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1016 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:08:53,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-25 17:08:53,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2022-11-25 17:08:53,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 233 states have (on average 1.2875536480686696) internal successors, (300), 236 states have internal predecessors, (300), 41 states have call successors, (41), 10 states have call predecessors, (41), 10 states have return successors, (41), 41 states have call predecessors, (41), 41 states have call successors, (41) [2022-11-25 17:08:53,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 382 transitions. [2022-11-25 17:08:53,516 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 382 transitions. Word has length 175 [2022-11-25 17:08:53,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:53,516 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 382 transitions. [2022-11-25 17:08:53,516 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-25 17:08:53,517 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 382 transitions. [2022-11-25 17:08:53,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-11-25 17:08:53,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:53,519 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-25 17:08:53,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 17:08:53,520 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:53,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:53,520 INFO L85 PathProgramCache]: Analyzing trace with hash 171596258, now seen corresponding path program 1 times [2022-11-25 17:08:53,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:53,521 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244402221] [2022-11-25 17:08:53,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:53,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:53,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:53,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:53,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:08:53,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:08:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:08:53,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:08:53,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:08:53,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:08:53,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:08:53,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:08:53,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:08:53,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:08:53,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:08:53,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,700 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-11-25 17:08:53,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:53,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244402221] [2022-11-25 17:08:53,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244402221] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:53,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733289598] [2022-11-25 17:08:53,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:53,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:53,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:08:53,703 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:08:53,726 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:08:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:53,904 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:08:53,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:54,005 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-11-25 17:08:54,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:08:54,194 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 149 proven. 0 refuted. 0 times theorem prover too weak. 379 trivial. 0 not checked. [2022-11-25 17:08:54,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733289598] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:54,194 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:08:54,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2022-11-25 17:08:54,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264590723] [2022-11-25 17:08:54,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:54,196 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:54,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:54,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:54,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:54,198 INFO L87 Difference]: Start difference. First operand 285 states and 382 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 17:08:54,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:54,259 INFO L93 Difference]: Finished difference Result 450 states and 625 transitions. [2022-11-25 17:08:54,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:08:54,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) Word has length 182 [2022-11-25 17:08:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:54,262 INFO L225 Difference]: With dead ends: 450 [2022-11-25 17:08:54,262 INFO L226 Difference]: Without dead ends: 264 [2022-11-25 17:08:54,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 388 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-25 17:08:54,264 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 30 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:54,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 481 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:08:54,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-11-25 17:08:54,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2022-11-25 17:08:54,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 215 states have (on average 1.2790697674418605) internal successors, (275), 218 states have internal predecessors, (275), 38 states have call successors, (38), 10 states have call predecessors, (38), 10 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-11-25 17:08:54,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 351 transitions. [2022-11-25 17:08:54,279 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 351 transitions. Word has length 182 [2022-11-25 17:08:54,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:54,280 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 351 transitions. [2022-11-25 17:08:54,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 1 states have call successors, (7) [2022-11-25 17:08:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 351 transitions. [2022-11-25 17:08:54,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-11-25 17:08:54,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:54,284 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 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-25 17:08:54,300 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:54,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-25 17:08:54,501 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:54,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:54,501 INFO L85 PathProgramCache]: Analyzing trace with hash 687203413, now seen corresponding path program 1 times [2022-11-25 17:08:54,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:54,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1080820660] [2022-11-25 17:08:54,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:54,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:54,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:08:54,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:08:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:08:54,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:08:54,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:08:54,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:08:54,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:08:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:08:54,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:08:54,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:08:54,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:08:54,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:08:54,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:08:54,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:08:54,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,679 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2022-11-25 17:08:54,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:54,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1080820660] [2022-11-25 17:08:54,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1080820660] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:54,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:54,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:08:54,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929529407] [2022-11-25 17:08:54,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:54,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:54,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:54,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:54,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:08:54,683 INFO L87 Difference]: Start difference. First operand 264 states and 351 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-25 17:08:54,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:54,724 INFO L93 Difference]: Finished difference Result 407 states and 567 transitions. [2022-11-25 17:08:54,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:54,725 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) Word has length 206 [2022-11-25 17:08:54,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:54,727 INFO L225 Difference]: With dead ends: 407 [2022-11-25 17:08:54,727 INFO L226 Difference]: Without dead ends: 270 [2022-11-25 17:08:54,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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-25 17:08:54,729 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 6 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:54,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 743 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:08:54,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-25 17:08:54,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2022-11-25 17:08:54,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 218 states have (on average 1.275229357798165) internal successors, (278), 221 states have internal predecessors, (278), 38 states have call successors, (38), 11 states have call predecessors, (38), 11 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-11-25 17:08:54,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 354 transitions. [2022-11-25 17:08:54,746 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 354 transitions. Word has length 206 [2022-11-25 17:08:54,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:54,747 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 354 transitions. [2022-11-25 17:08:54,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (10), 3 states have call predecessors, (10), 1 states have return successors, (8), 1 states have call predecessors, (8), 1 states have call successors, (8) [2022-11-25 17:08:54,747 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 354 transitions. [2022-11-25 17:08:54,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-11-25 17:08:54,750 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:54,751 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-25 17:08:54,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-25 17:08:54,751 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:54,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:54,752 INFO L85 PathProgramCache]: Analyzing trace with hash 209531083, now seen corresponding path program 1 times [2022-11-25 17:08:54,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:54,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213051203] [2022-11-25 17:08:54,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:54,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:54,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:54,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:08:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:08:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:08:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:08:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:08:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:08:54,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:08:54,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:08:54,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:08:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:08:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:08:54,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:08:54,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:08:54,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:08:54,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:08:54,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:54,996 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2022-11-25 17:08:54,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:54,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213051203] [2022-11-25 17:08:54,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213051203] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:54,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [525631360] [2022-11-25 17:08:54,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:54,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:54,998 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:08:55,004 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:08:55,010 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:08:55,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:08:55,219 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:55,240 INFO L134 CoverageAnalysis]: Checked inductivity of 554 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 552 trivial. 0 not checked. [2022-11-25 17:08:55,241 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:08:55,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [525631360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:55,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:08:55,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-25 17:08:55,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127459448] [2022-11-25 17:08:55,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:55,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:55,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:55,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:55,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:55,244 INFO L87 Difference]: Start difference. First operand 268 states and 354 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-11-25 17:08:55,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:55,289 INFO L93 Difference]: Finished difference Result 416 states and 574 transitions. [2022-11-25 17:08:55,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:55,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) Word has length 213 [2022-11-25 17:08:55,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:55,293 INFO L225 Difference]: With dead ends: 416 [2022-11-25 17:08:55,293 INFO L226 Difference]: Without dead ends: 275 [2022-11-25 17:08:55,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 248 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-25 17:08:55,295 INFO L413 NwaCegarLoop]: 252 mSDtfsCounter, 7 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:55,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 748 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:08:55,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-25 17:08:55,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2022-11-25 17:08:55,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 222 states have (on average 1.2702702702702702) internal successors, (282), 225 states have internal predecessors, (282), 38 states have call successors, (38), 12 states have call predecessors, (38), 12 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2022-11-25 17:08:55,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 358 transitions. [2022-11-25 17:08:55,312 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 358 transitions. Word has length 213 [2022-11-25 17:08:55,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:55,313 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 358 transitions. [2022-11-25 17:08:55,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (11), 3 states have call predecessors, (11), 1 states have return successors, (9), 1 states have call predecessors, (9), 1 states have call successors, (9) [2022-11-25 17:08:55,314 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 358 transitions. [2022-11-25 17:08:55,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-11-25 17:08:55,317 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:55,317 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-25 17:08:55,331 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:55,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:55,525 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:55,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:55,525 INFO L85 PathProgramCache]: Analyzing trace with hash 915774272, now seen corresponding path program 1 times [2022-11-25 17:08:55,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:55,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422411361] [2022-11-25 17:08:55,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:55,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:55,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:55,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:55,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:08:55,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:08:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:08:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:08:55,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:08:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:08:55,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:08:55,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:08:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:08:55,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:08:55,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:08:55,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:08:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:08:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:08:55,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:08:55,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:08:55,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-11-25 17:08:55,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:55,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422411361] [2022-11-25 17:08:55,804 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422411361] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:08:55,804 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871018853] [2022-11-25 17:08:55,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:55,805 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:55,805 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:08:55,806 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:08:55,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:08:56,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,038 INFO L263 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:08:56,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:08:56,065 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 556 trivial. 0 not checked. [2022-11-25 17:08:56,066 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:08:56,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871018853] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:56,066 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:08:56,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-25 17:08:56,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710524383] [2022-11-25 17:08:56,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:56,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:56,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:56,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:56,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:56,070 INFO L87 Difference]: Start difference. First operand 273 states and 358 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-25 17:08:56,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:56,114 INFO L93 Difference]: Finished difference Result 418 states and 572 transitions. [2022-11-25 17:08:56,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:08:56,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) Word has length 221 [2022-11-25 17:08:56,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:56,118 INFO L225 Difference]: With dead ends: 418 [2022-11-25 17:08:56,118 INFO L226 Difference]: Without dead ends: 272 [2022-11-25 17:08:56,119 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 258 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-25 17:08:56,120 INFO L413 NwaCegarLoop]: 248 mSDtfsCounter, 7 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:56,120 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 734 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:08:56,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-11-25 17:08:56,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2022-11-25 17:08:56,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 222 states have (on average 1.2567567567567568) internal successors, (279), 224 states have internal predecessors, (279), 37 states have call successors, (37), 12 states have call predecessors, (37), 12 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2022-11-25 17:08:56,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 353 transitions. [2022-11-25 17:08:56,136 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 353 transitions. Word has length 221 [2022-11-25 17:08:56,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:56,137 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 353 transitions. [2022-11-25 17:08:56,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (10), 1 states have call predecessors, (10), 1 states have call successors, (10) [2022-11-25 17:08:56,138 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 353 transitions. [2022-11-25 17:08:56,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-11-25 17:08:56,141 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:56,142 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-25 17:08:56,155 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:08:56,349 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:08:56,350 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:56,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:56,351 INFO L85 PathProgramCache]: Analyzing trace with hash 568293619, now seen corresponding path program 1 times [2022-11-25 17:08:56,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:56,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358741243] [2022-11-25 17:08:56,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:56,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:08:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:08:56,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:08:56,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:08:56,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:08:56,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:08:56,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:08:56,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:08:56,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:08:56,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:08:56,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:08:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:08:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:08:56,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:08:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:08:56,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:08:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-25 17:08:56,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:56,602 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2022-11-25 17:08:56,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:56,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358741243] [2022-11-25 17:08:56,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358741243] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:56,603 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:56,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:08:56,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217134769] [2022-11-25 17:08:56,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:56,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:56,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:56,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:56,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:08:56,606 INFO L87 Difference]: Start difference. First operand 272 states and 353 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-25 17:08:56,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:56,940 INFO L93 Difference]: Finished difference Result 451 states and 620 transitions. [2022-11-25 17:08:56,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:08:56,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 228 [2022-11-25 17:08:56,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:56,943 INFO L225 Difference]: With dead ends: 451 [2022-11-25 17:08:56,944 INFO L226 Difference]: Without dead ends: 306 [2022-11-25 17:08:56,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:08:56,946 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 177 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:56,946 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [201 Valid, 527 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:08:56,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-25 17:08:56,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 271. [2022-11-25 17:08:56,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 222 states have (on average 1.2522522522522523) internal successors, (278), 223 states have internal predecessors, (278), 36 states have call successors, (36), 12 states have call predecessors, (36), 12 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2022-11-25 17:08:56,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 350 transitions. [2022-11-25 17:08:56,976 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 350 transitions. Word has length 228 [2022-11-25 17:08:56,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:56,977 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 350 transitions. [2022-11-25 17:08:56,977 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2022-11-25 17:08:56,977 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 350 transitions. [2022-11-25 17:08:56,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2022-11-25 17:08:56,981 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:56,982 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 9, 9, 9, 6, 6, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-11-25 17:08:56,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-25 17:08:56,982 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:56,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:56,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1358671604, now seen corresponding path program 1 times [2022-11-25 17:08:56,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:56,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [791963883] [2022-11-25 17:08:56,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:56,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:57,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:08:57,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:08:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:08:57,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:08:57,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:08:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:08:57,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:08:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:08:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:08:57,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:08:57,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:08:57,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:08:57,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:08:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:08:57,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:08:57,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:08:57,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-25 17:08:57,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:57,389 INFO L134 CoverageAnalysis]: Checked inductivity of 565 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 565 trivial. 0 not checked. [2022-11-25 17:08:57,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:57,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [791963883] [2022-11-25 17:08:57,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [791963883] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:57,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:57,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:08:57,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387814475] [2022-11-25 17:08:57,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:57,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:08:57,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:57,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:08:57,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:57,393 INFO L87 Difference]: Start difference. First operand 271 states and 350 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-25 17:08:58,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:58,241 INFO L93 Difference]: Finished difference Result 621 states and 830 transitions. [2022-11-25 17:08:58,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:08:58,242 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 231 [2022-11-25 17:08:58,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:58,246 INFO L225 Difference]: With dead ends: 621 [2022-11-25 17:08:58,246 INFO L226 Difference]: Without dead ends: 477 [2022-11-25 17:08:58,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:08:58,248 INFO L413 NwaCegarLoop]: 236 mSDtfsCounter, 407 mSDsluCounter, 417 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:58,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 653 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 17:08:58,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-11-25 17:08:58,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 423. [2022-11-25 17:08:58,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 423 states, 344 states have (on average 1.2994186046511629) internal successors, (447), 346 states have internal predecessors, (447), 54 states have call successors, (54), 24 states have call predecessors, (54), 24 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2022-11-25 17:08:58,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 555 transitions. [2022-11-25 17:08:58,295 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 555 transitions. Word has length 231 [2022-11-25 17:08:58,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:58,296 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 555 transitions. [2022-11-25 17:08:58,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 4 states have internal predecessors, (71), 3 states have call successors, (12), 3 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-25 17:08:58,297 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 555 transitions. [2022-11-25 17:08:58,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2022-11-25 17:08:58,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:58,302 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:58,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-25 17:08:58,302 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:58,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:58,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1534595272, now seen corresponding path program 1 times [2022-11-25 17:08:58,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:58,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701976252] [2022-11-25 17:08:58,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:58,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:58,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:58,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:08:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:08:58,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:08:58,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:08:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:08:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:08:58,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:08:58,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:08:58,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:08:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:08:58,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:08:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:08:58,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:08:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:08:58,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:08:58,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:08:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-25 17:08:58,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-11-25 17:08:58,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-11-25 17:08:58,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-11-25 17:08:58,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:58,583 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2022-11-25 17:08:58,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:58,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701976252] [2022-11-25 17:08:58,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701976252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:58,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:58,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:08:58,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082333218] [2022-11-25 17:08:58,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:58,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:58,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:58,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:58,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:08:58,587 INFO L87 Difference]: Start difference. First operand 423 states and 555 transitions. Second operand has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-25 17:08:59,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:08:59,195 INFO L93 Difference]: Finished difference Result 893 states and 1225 transitions. [2022-11-25 17:08:59,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:08:59,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 258 [2022-11-25 17:08:59,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:08:59,200 INFO L225 Difference]: With dead ends: 893 [2022-11-25 17:08:59,200 INFO L226 Difference]: Without dead ends: 665 [2022-11-25 17:08:59,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:08:59,202 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 219 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 494 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:08:59,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 494 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:08:59,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-11-25 17:08:59,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 503. [2022-11-25 17:08:59,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 503 states, 414 states have (on average 1.3091787439613527) internal successors, (542), 417 states have internal predecessors, (542), 59 states have call successors, (59), 29 states have call predecessors, (59), 29 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2022-11-25 17:08:59,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 660 transitions. [2022-11-25 17:08:59,271 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 660 transitions. Word has length 258 [2022-11-25 17:08:59,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:08:59,272 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 660 transitions. [2022-11-25 17:08:59,272 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.0) internal successors, (80), 3 states have internal predecessors, (80), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-25 17:08:59,272 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 660 transitions. [2022-11-25 17:08:59,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-11-25 17:08:59,277 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:08:59,277 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:08:59,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-25 17:08:59,278 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:08:59,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:08:59,278 INFO L85 PathProgramCache]: Analyzing trace with hash -141182582, now seen corresponding path program 1 times [2022-11-25 17:08:59,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:08:59,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663841515] [2022-11-25 17:08:59,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:08:59,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:08:59,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:08:59,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:08:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:08:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:08:59,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:08:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:08:59,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:08:59,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:08:59,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:08:59,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:08:59,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:08:59,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:08:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:08:59,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:08:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:08:59,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:08:59,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:08:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:08:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-25 17:08:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-11-25 17:08:59,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-11-25 17:08:59,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-11-25 17:08:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:08:59,538 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2022-11-25 17:08:59,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:08:59,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663841515] [2022-11-25 17:08:59,539 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663841515] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:08:59,539 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:08:59,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:08:59,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085465471] [2022-11-25 17:08:59,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:08:59,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:08:59,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:08:59,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:08:59,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:08:59,542 INFO L87 Difference]: Start difference. First operand 503 states and 660 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-25 17:09:00,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:00,094 INFO L93 Difference]: Finished difference Result 1067 states and 1456 transitions. [2022-11-25 17:09:00,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:09:00,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 259 [2022-11-25 17:09:00,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:00,100 INFO L225 Difference]: With dead ends: 1067 [2022-11-25 17:09:00,100 INFO L226 Difference]: Without dead ends: 788 [2022-11-25 17:09:00,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-25 17:09:00,102 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 220 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:00,103 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 520 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:09:00,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-11-25 17:09:00,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 613. [2022-11-25 17:09:00,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 613 states, 512 states have (on average 1.3203125) internal successors, (676), 517 states have internal predecessors, (676), 65 states have call successors, (65), 35 states have call predecessors, (65), 35 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2022-11-25 17:09:00,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 806 transitions. [2022-11-25 17:09:00,175 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 806 transitions. Word has length 259 [2022-11-25 17:09:00,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:00,176 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 806 transitions. [2022-11-25 17:09:00,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 3 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-25 17:09:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 806 transitions. [2022-11-25 17:09:00,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-11-25 17:09:00,181 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:00,182 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:00,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-25 17:09:00,183 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:00,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:00,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1355646765, now seen corresponding path program 1 times [2022-11-25 17:09:00,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:00,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794061602] [2022-11-25 17:09:00,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:00,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:00,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:09:00,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:09:00,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:09:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:09:00,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:09:00,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:09:00,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:09:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:09:00,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:09:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:09:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:09:00,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:09:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:09:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:09:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:09:00,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:09:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-25 17:09:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-11-25 17:09:00,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-25 17:09:00,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-25 17:09:00,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:00,415 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2022-11-25 17:09:00,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:00,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794061602] [2022-11-25 17:09:00,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794061602] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:09:00,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:09:00,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:09:00,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520936888] [2022-11-25 17:09:00,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:09:00,419 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:09:00,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:00,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:09:00,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:09:00,421 INFO L87 Difference]: Start difference. First operand 613 states and 806 transitions. Second operand has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 17:09:01,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:01,043 INFO L93 Difference]: Finished difference Result 1283 states and 1750 transitions. [2022-11-25 17:09:01,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:09:01,043 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 260 [2022-11-25 17:09:01,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:01,048 INFO L225 Difference]: With dead ends: 1283 [2022-11-25 17:09:01,048 INFO L226 Difference]: Without dead ends: 926 [2022-11-25 17:09:01,049 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 46 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-25 17:09:01,051 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 220 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 545 SdHoareTripleChecker+Invalid, 267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:01,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [241 Valid, 545 Invalid, 267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:09:01,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2022-11-25 17:09:01,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 723. [2022-11-25 17:09:01,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 614 states have (on average 1.3355048859934853) internal successors, (820), 623 states have internal predecessors, (820), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2022-11-25 17:09:01,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 958 transitions. [2022-11-25 17:09:01,148 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 958 transitions. Word has length 260 [2022-11-25 17:09:01,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:01,150 INFO L495 AbstractCegarLoop]: Abstraction has 723 states and 958 transitions. [2022-11-25 17:09:01,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.5) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 17:09:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 958 transitions. [2022-11-25 17:09:01,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-11-25 17:09:01,155 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:01,156 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:01,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-25 17:09:01,156 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:01,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:01,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1080887151, now seen corresponding path program 1 times [2022-11-25 17:09:01,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:01,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816199331] [2022-11-25 17:09:01,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:01,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:01,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:09:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:09:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:09:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:09:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:09:01,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:09:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:09:01,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:09:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:09:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:09:01,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:01,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:09:01,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:09:01,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:09:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:01,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:09:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:09:01,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:09:01,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-25 17:09:01,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-11-25 17:09:01,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-25 17:09:01,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-25 17:09:01,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,570 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 30 proven. 6 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2022-11-25 17:09:01,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:01,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816199331] [2022-11-25 17:09:01,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816199331] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:09:01,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [371279859] [2022-11-25 17:09:01,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:01,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:01,572 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:01,575 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:01,605 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:09:01,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:01,850 INFO L263 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:09:01,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:01,905 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 579 trivial. 0 not checked. [2022-11-25 17:09:01,906 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:09:01,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [371279859] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:09:01,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:09:01,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-11-25 17:09:01,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530103081] [2022-11-25 17:09:01,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:09:01,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:09:01,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:01,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:09:01,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:09:01,909 INFO L87 Difference]: Start difference. First operand 723 states and 958 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 17:09:02,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:02,105 INFO L93 Difference]: Finished difference Result 1194 states and 1622 transitions. [2022-11-25 17:09:02,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:09:02,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 260 [2022-11-25 17:09:02,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:02,110 INFO L225 Difference]: With dead ends: 1194 [2022-11-25 17:09:02,111 INFO L226 Difference]: Without dead ends: 723 [2022-11-25 17:09:02,112 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:09:02,113 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 51 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:02,113 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 651 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:09:02,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-11-25 17:09:02,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2022-11-25 17:09:02,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 723 states, 614 states have (on average 1.3257328990228012) internal successors, (814), 623 states have internal predecessors, (814), 69 states have call successors, (69), 39 states have call predecessors, (69), 39 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2022-11-25 17:09:02,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 952 transitions. [2022-11-25 17:09:02,234 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 952 transitions. Word has length 260 [2022-11-25 17:09:02,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:02,235 INFO L495 AbstractCegarLoop]: Abstraction has 723 states and 952 transitions. [2022-11-25 17:09:02,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 17:09:02,235 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 952 transitions. [2022-11-25 17:09:02,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2022-11-25 17:09:02,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:02,240 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:02,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:02,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-11-25 17:09:02,447 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:02,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:02,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1702413312, now seen corresponding path program 1 times [2022-11-25 17:09:02,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:02,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832879529] [2022-11-25 17:09:02,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:02,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:02,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:09:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:09:02,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:09:02,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:09:02,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:09:02,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:09:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:09:02,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:09:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:09:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:09:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:02,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:09:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:09:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:09:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:02,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:09:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:09:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:09:02,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-25 17:09:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-11-25 17:09:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-11-25 17:09:02,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-11-25 17:09:02,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 12 proven. 10 refuted. 0 times theorem prover too weak. 617 trivial. 0 not checked. [2022-11-25 17:09:02,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:02,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832879529] [2022-11-25 17:09:02,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832879529] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:09:02,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [56402845] [2022-11-25 17:09:02,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:02,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:02,810 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:02,811 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:02,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:09:03,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:03,081 INFO L263 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:09:03,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:03,136 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2022-11-25 17:09:03,137 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:09:03,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [56402845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:09:03,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:09:03,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-11-25 17:09:03,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15023219] [2022-11-25 17:09:03,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:09:03,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:09:03,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:03,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:09:03,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:09:03,141 INFO L87 Difference]: Start difference. First operand 723 states and 952 transitions. Second operand has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 17:09:03,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:03,333 INFO L93 Difference]: Finished difference Result 1194 states and 1608 transitions. [2022-11-25 17:09:03,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:09:03,334 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 261 [2022-11-25 17:09:03,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:03,339 INFO L225 Difference]: With dead ends: 1194 [2022-11-25 17:09:03,339 INFO L226 Difference]: Without dead ends: 735 [2022-11-25 17:09:03,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:09:03,342 INFO L413 NwaCegarLoop]: 232 mSDtfsCounter, 15 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:03,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 674 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:09:03,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-11-25 17:09:03,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2022-11-25 17:09:03,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 735 states, 624 states have (on average 1.3269230769230769) internal successors, (828), 633 states have internal predecessors, (828), 69 states have call successors, (69), 41 states have call predecessors, (69), 41 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2022-11-25 17:09:03,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 966 transitions. [2022-11-25 17:09:03,473 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 966 transitions. Word has length 261 [2022-11-25 17:09:03,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:03,477 INFO L495 AbstractCegarLoop]: Abstraction has 735 states and 966 transitions. [2022-11-25 17:09:03,479 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.0) internal successors, (92), 4 states have internal predecessors, (92), 2 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 17:09:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 966 transitions. [2022-11-25 17:09:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-11-25 17:09:03,484 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:03,484 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:03,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:03,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-25 17:09:03,692 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:03,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:03,693 INFO L85 PathProgramCache]: Analyzing trace with hash -955415893, now seen corresponding path program 1 times [2022-11-25 17:09:03,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:03,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404601266] [2022-11-25 17:09:03,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:03,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:03,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:03,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:09:03,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:03,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:09:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:03,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:09:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:03,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:09:03,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:03,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:09:03,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:03,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:09:03,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:03,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:09:03,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:03,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:09:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:03,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:09:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:03,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:09:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:03,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:03,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:03,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:09:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:03,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:09:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:03,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:09:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:03,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:03,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:03,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:09:03,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:09:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:09:04,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-25 17:09:04,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-11-25 17:09:04,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-11-25 17:09:04,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-11-25 17:09:04,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,023 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2022-11-25 17:09:04,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:04,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404601266] [2022-11-25 17:09:04,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404601266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:09:04,024 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:09:04,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:09:04,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111839005] [2022-11-25 17:09:04,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:09:04,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:09:04,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:04,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:09:04,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:09:04,027 INFO L87 Difference]: Start difference. First operand 735 states and 966 transitions. Second operand has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 17:09:04,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:04,425 INFO L93 Difference]: Finished difference Result 1208 states and 1622 transitions. [2022-11-25 17:09:04,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:09:04,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 262 [2022-11-25 17:09:04,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:04,430 INFO L225 Difference]: With dead ends: 1208 [2022-11-25 17:09:04,431 INFO L226 Difference]: Without dead ends: 715 [2022-11-25 17:09:04,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:09:04,433 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 59 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:04,433 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 475 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:09:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-11-25 17:09:04,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2022-11-25 17:09:04,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 715 states, 605 states have (on average 1.3107438016528925) internal successors, (793), 613 states have internal predecessors, (793), 69 states have call successors, (69), 41 states have call predecessors, (69), 40 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2022-11-25 17:09:04,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 930 transitions. [2022-11-25 17:09:04,508 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 930 transitions. Word has length 262 [2022-11-25 17:09:04,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:04,508 INFO L495 AbstractCegarLoop]: Abstraction has 715 states and 930 transitions. [2022-11-25 17:09:04,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.5) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 17:09:04,509 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 930 transitions. [2022-11-25 17:09:04,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-11-25 17:09:04,514 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:04,515 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:04,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-25 17:09:04,515 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:04,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:04,516 INFO L85 PathProgramCache]: Analyzing trace with hash 1386884296, now seen corresponding path program 1 times [2022-11-25 17:09:04,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:04,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232127231] [2022-11-25 17:09:04,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:04,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:09:04,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:09:04,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:09:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:09:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:09:04,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:09:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:09:04,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:09:04,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:09:04,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:09:04,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:04,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:09:04,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:09:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:09:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:04,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:09:04,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:05,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:09:05,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:05,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-25 17:09:05,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:05,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:09:05,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:05,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-25 17:09:05,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:05,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-25 17:09:05,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:05,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-25 17:09:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:05,049 INFO L134 CoverageAnalysis]: Checked inductivity of 639 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 639 trivial. 0 not checked. [2022-11-25 17:09:05,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:05,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232127231] [2022-11-25 17:09:05,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232127231] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:09:05,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:09:05,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:09:05,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333716300] [2022-11-25 17:09:05,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:09:05,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:09:05,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:05,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:09:05,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:09:05,053 INFO L87 Difference]: Start difference. First operand 715 states and 930 transitions. Second operand has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-11-25 17:09:05,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:05,882 INFO L93 Difference]: Finished difference Result 1036 states and 1422 transitions. [2022-11-25 17:09:05,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:09:05,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 263 [2022-11-25 17:09:05,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:05,889 INFO L225 Difference]: With dead ends: 1036 [2022-11-25 17:09:05,889 INFO L226 Difference]: Without dead ends: 1034 [2022-11-25 17:09:05,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:09:05,892 INFO L413 NwaCegarLoop]: 313 mSDtfsCounter, 239 mSDsluCounter, 1174 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:05,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 1487 Invalid, 556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:09:05,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-11-25 17:09:06,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 721. [2022-11-25 17:09:06,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 721 states, 609 states have (on average 1.3087027914614122) internal successors, (797), 618 states have internal predecessors, (797), 70 states have call successors, (70), 42 states have call predecessors, (70), 41 states have return successors, (69), 67 states have call predecessors, (69), 69 states have call successors, (69) [2022-11-25 17:09:06,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 936 transitions. [2022-11-25 17:09:06,007 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 936 transitions. Word has length 263 [2022-11-25 17:09:06,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:06,008 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 936 transitions. [2022-11-25 17:09:06,008 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 14.5) internal successors, (87), 5 states have internal predecessors, (87), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-11-25 17:09:06,009 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 936 transitions. [2022-11-25 17:09:06,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-11-25 17:09:06,011 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:06,012 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:06,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-25 17:09:06,012 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:06,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:06,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1763607020, now seen corresponding path program 1 times [2022-11-25 17:09:06,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:06,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712895456] [2022-11-25 17:09:06,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:06,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:06,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:09:06,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:09:06,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:09:06,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:09:06,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:09:06,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:09:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:09:06,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:09:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:09:06,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:09:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:06,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:09:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:09:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:09:06,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:06,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:09:06,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:09:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-25 17:09:06,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:09:06,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-25 17:09:06,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-25 17:09:06,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-25 17:09:06,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-11-25 17:09:06,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,575 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 142 proven. 27 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2022-11-25 17:09:06,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:06,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712895456] [2022-11-25 17:09:06,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712895456] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:09:06,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830075150] [2022-11-25 17:09:06,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:06,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:06,579 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:06,580 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:06,606 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 17:09:06,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:06,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-25 17:09:06,829 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:07,172 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 251 proven. 33 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-11-25 17:09:07,173 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:09:07,716 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 146 proven. 23 refuted. 0 times theorem prover too weak. 515 trivial. 0 not checked. [2022-11-25 17:09:07,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830075150] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:09:07,717 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:09:07,717 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2022-11-25 17:09:07,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147305742] [2022-11-25 17:09:07,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:09:07,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-25 17:09:07,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:07,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-25 17:09:07,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-11-25 17:09:07,721 INFO L87 Difference]: Start difference. First operand 721 states and 936 transitions. Second operand has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 14 states have internal predecessors, (145), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2022-11-25 17:09:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:11,234 INFO L93 Difference]: Finished difference Result 2138 states and 2980 transitions. [2022-11-25 17:09:11,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-25 17:09:11,235 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 14 states have internal predecessors, (145), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) Word has length 271 [2022-11-25 17:09:11,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:11,244 INFO L225 Difference]: With dead ends: 2138 [2022-11-25 17:09:11,244 INFO L226 Difference]: Without dead ends: 1679 [2022-11-25 17:09:11,247 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 583 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2022-11-25 17:09:11,247 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 517 mSDsluCounter, 2908 mSDsCounter, 0 mSdLazyCounter, 2833 mSolverCounterSat, 140 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 3185 SdHoareTripleChecker+Invalid, 2973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 140 IncrementalHoareTripleChecker+Valid, 2833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:11,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 3185 Invalid, 2973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [140 Valid, 2833 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-11-25 17:09:11,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2022-11-25 17:09:11,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 989. [2022-11-25 17:09:11,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 989 states, 837 states have (on average 1.2915173237753883) internal successors, (1081), 847 states have internal predecessors, (1081), 94 states have call successors, (94), 55 states have call predecessors, (94), 57 states have return successors, (98), 93 states have call predecessors, (98), 93 states have call successors, (98) [2022-11-25 17:09:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1273 transitions. [2022-11-25 17:09:11,394 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1273 transitions. Word has length 271 [2022-11-25 17:09:11,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:11,394 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1273 transitions. [2022-11-25 17:09:11,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 7.631578947368421) internal successors, (145), 14 states have internal predecessors, (145), 5 states have call successors, (28), 5 states have call predecessors, (28), 9 states have return successors, (27), 8 states have call predecessors, (27), 5 states have call successors, (27) [2022-11-25 17:09:11,395 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1273 transitions. [2022-11-25 17:09:11,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-11-25 17:09:11,398 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:11,399 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:11,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-11-25 17:09:11,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:11,608 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:11,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash -801993003, now seen corresponding path program 1 times [2022-11-25 17:09:11,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:11,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1552597318] [2022-11-25 17:09:11,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:11,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:11,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:09:11,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:09:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:09:11,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:09:11,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:09:11,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:09:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:09:11,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:09:11,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:09:11,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:09:11,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:11,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:09:11,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:09:11,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:09:11,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:11,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:09:11,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:09:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-25 17:09:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:09:11,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-25 17:09:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-25 17:09:11,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-25 17:09:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-11-25 17:09:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:11,865 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 668 trivial. 0 not checked. [2022-11-25 17:09:11,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:11,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1552597318] [2022-11-25 17:09:11,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1552597318] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:09:11,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397607146] [2022-11-25 17:09:11,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:11,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:11,867 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:11,868 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:11,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 17:09:12,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:12,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:09:12,158 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:12,181 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 77 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2022-11-25 17:09:12,181 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:09:12,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397607146] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:09:12,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:09:12,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-25 17:09:12,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471835326] [2022-11-25 17:09:12,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:09:12,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:09:12,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:12,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:09:12,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:09:12,186 INFO L87 Difference]: Start difference. First operand 989 states and 1273 transitions. Second operand has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-25 17:09:12,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:12,409 INFO L93 Difference]: Finished difference Result 1841 states and 2410 transitions. [2022-11-25 17:09:12,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:09:12,410 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 271 [2022-11-25 17:09:12,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:12,415 INFO L225 Difference]: With dead ends: 1841 [2022-11-25 17:09:12,416 INFO L226 Difference]: Without dead ends: 973 [2022-11-25 17:09:12,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 317 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-25 17:09:12,419 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 11 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:12,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 671 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:09:12,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2022-11-25 17:09:12,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2022-11-25 17:09:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 973 states, 826 states have (on average 1.2796610169491525) internal successors, (1057), 836 states have internal predecessors, (1057), 90 states have call successors, (90), 55 states have call predecessors, (90), 56 states have return successors, (93), 88 states have call predecessors, (93), 89 states have call successors, (93) [2022-11-25 17:09:12,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1240 transitions. [2022-11-25 17:09:12,568 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1240 transitions. Word has length 271 [2022-11-25 17:09:12,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:12,569 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1240 transitions. [2022-11-25 17:09:12,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-25 17:09:12,569 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1240 transitions. [2022-11-25 17:09:12,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-11-25 17:09:12,572 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:12,573 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 9, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:12,586 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:12,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:12,781 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:12,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:12,781 INFO L85 PathProgramCache]: Analyzing trace with hash -1829250860, now seen corresponding path program 1 times [2022-11-25 17:09:12,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:12,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091797805] [2022-11-25 17:09:12,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:12,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:12,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:09:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:12,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:09:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:12,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:09:12,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:12,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:09:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:12,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:09:12,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:12,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:09:12,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:12,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:09:12,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:12,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:09:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:12,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:09:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:12,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:09:12,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:12,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:12,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:09:12,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:12,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:09:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:12,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:09:12,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:12,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-25 17:09:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:12,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-25 17:09:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:12,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-25 17:09:12,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:12,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-25 17:09:13,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:13,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-11-25 17:09:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:13,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-11-25 17:09:13,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:13,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-25 17:09:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:13,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-11-25 17:09:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:13,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-11-25 17:09:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:13,019 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 121 proven. 19 refuted. 0 times theorem prover too weak. 550 trivial. 0 not checked. [2022-11-25 17:09:13,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:13,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091797805] [2022-11-25 17:09:13,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091797805] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:09:13,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247120834] [2022-11-25 17:09:13,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:13,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:13,021 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:13,023 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:13,051 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 17:09:13,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:13,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:09:13,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:13,334 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 222 proven. 0 refuted. 0 times theorem prover too weak. 468 trivial. 0 not checked. [2022-11-25 17:09:13,334 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:09:13,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247120834] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:09:13,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:09:13,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-25 17:09:13,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099055392] [2022-11-25 17:09:13,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:09:13,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:09:13,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:13,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:09:13,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:09:13,338 INFO L87 Difference]: Start difference. First operand 973 states and 1240 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-25 17:09:13,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:13,548 INFO L93 Difference]: Finished difference Result 1689 states and 2194 transitions. [2022-11-25 17:09:13,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:09:13,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 274 [2022-11-25 17:09:13,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:13,554 INFO L225 Difference]: With dead ends: 1689 [2022-11-25 17:09:13,554 INFO L226 Difference]: Without dead ends: 828 [2022-11-25 17:09:13,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 320 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-25 17:09:13,558 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 8 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:13,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 674 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:09:13,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2022-11-25 17:09:13,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828. [2022-11-25 17:09:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 699 states have (on average 1.2789699570815452) internal successors, (894), 709 states have internal predecessors, (894), 81 states have call successors, (81), 48 states have call predecessors, (81), 47 states have return successors, (80), 77 states have call predecessors, (80), 80 states have call successors, (80) [2022-11-25 17:09:13,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1055 transitions. [2022-11-25 17:09:13,670 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1055 transitions. Word has length 274 [2022-11-25 17:09:13,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:13,671 INFO L495 AbstractCegarLoop]: Abstraction has 828 states and 1055 transitions. [2022-11-25 17:09:13,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-25 17:09:13,672 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1055 transitions. [2022-11-25 17:09:13,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-11-25 17:09:13,674 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:13,675 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 8, 8, 8, 7, 6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:13,687 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:13,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:13,882 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:13,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:13,883 INFO L85 PathProgramCache]: Analyzing trace with hash 211214063, now seen corresponding path program 1 times [2022-11-25 17:09:13,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:13,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50072948] [2022-11-25 17:09:13,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:13,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:13,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:14,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:09:14,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:14,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:09:14,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:14,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:09:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:14,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:09:14,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:14,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:09:14,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:14,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:09:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:14,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:09:14,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:14,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:09:14,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:14,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:09:14,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:14,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:09:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:14,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:14,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:09:14,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:14,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:09:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:14,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:09:14,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:14,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:14,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:14,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:09:14,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:14,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:09:14,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:14,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-25 17:09:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:14,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:09:14,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:15,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-25 17:09:15,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:15,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-25 17:09:15,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:15,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-25 17:09:15,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:15,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-11-25 17:09:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:15,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-11-25 17:09:15,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:15,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-11-25 17:09:15,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:15,053 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 16 proven. 146 refuted. 0 times theorem prover too weak. 567 trivial. 0 not checked. [2022-11-25 17:09:15,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:15,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50072948] [2022-11-25 17:09:15,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50072948] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:09:15,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790386305] [2022-11-25 17:09:15,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:15,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:15,055 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:15,056 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:15,090 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 17:09:15,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:15,327 INFO L263 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 17:09:15,334 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:15,585 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 148 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2022-11-25 17:09:15,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:09:15,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790386305] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:09:15,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:09:15,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2022-11-25 17:09:15,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777839420] [2022-11-25 17:09:15,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:09:15,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:09:15,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:15,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:09:15,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2022-11-25 17:09:15,588 INFO L87 Difference]: Start difference. First operand 828 states and 1055 transitions. Second operand has 8 states, 8 states have (on average 13.125) internal successors, (105), 7 states have internal predecessors, (105), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-25 17:09:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:16,183 INFO L93 Difference]: Finished difference Result 1714 states and 2246 transitions. [2022-11-25 17:09:16,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:09:16,184 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 7 states have internal predecessors, (105), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 286 [2022-11-25 17:09:16,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:16,192 INFO L225 Difference]: With dead ends: 1714 [2022-11-25 17:09:16,192 INFO L226 Difference]: Without dead ends: 1248 [2022-11-25 17:09:16,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 355 GetRequests, 332 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=532, Unknown=0, NotChecked=0, Total=600 [2022-11-25 17:09:16,195 INFO L413 NwaCegarLoop]: 356 mSDtfsCounter, 378 mSDsluCounter, 1543 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 382 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:16,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [382 Valid, 1899 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:09:16,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2022-11-25 17:09:16,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 990. [2022-11-25 17:09:16,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 990 states, 833 states have (on average 1.2725090036014406) internal successors, (1060), 844 states have internal predecessors, (1060), 99 states have call successors, (99), 58 states have call predecessors, (99), 57 states have return successors, (98), 94 states have call predecessors, (98), 98 states have call successors, (98) [2022-11-25 17:09:16,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1257 transitions. [2022-11-25 17:09:16,358 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1257 transitions. Word has length 286 [2022-11-25 17:09:16,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:16,359 INFO L495 AbstractCegarLoop]: Abstraction has 990 states and 1257 transitions. [2022-11-25 17:09:16,359 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.125) internal successors, (105), 7 states have internal predecessors, (105), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-25 17:09:16,359 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1257 transitions. [2022-11-25 17:09:16,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-11-25 17:09:16,362 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:16,363 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:16,374 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:16,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:16,571 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:16,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:16,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1543527212, now seen corresponding path program 1 times [2022-11-25 17:09:16,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:16,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831879181] [2022-11-25 17:09:16,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:16,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:16,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:09:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:09:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:09:16,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:09:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:09:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:09:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:09:16,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:09:16,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:09:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:09:16,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:09:16,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:09:16,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:09:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:09:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:09:16,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-25 17:09:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:09:16,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-25 17:09:16,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-25 17:09:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-11-25 17:09:16,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-25 17:09:16,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-11-25 17:09:16,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-11-25 17:09:16,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:16,955 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2022-11-25 17:09:16,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:16,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831879181] [2022-11-25 17:09:16,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831879181] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:09:16,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:09:16,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 17:09:16,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818328343] [2022-11-25 17:09:16,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:09:16,958 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 17:09:16,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:16,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 17:09:16,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:09:16,960 INFO L87 Difference]: Start difference. First operand 990 states and 1257 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-11-25 17:09:17,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:17,907 INFO L93 Difference]: Finished difference Result 2828 states and 3907 transitions. [2022-11-25 17:09:17,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 17:09:17,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) Word has length 292 [2022-11-25 17:09:17,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:17,922 INFO L225 Difference]: With dead ends: 2828 [2022-11-25 17:09:17,923 INFO L226 Difference]: Without dead ends: 2185 [2022-11-25 17:09:17,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-25 17:09:17,926 INFO L413 NwaCegarLoop]: 484 mSDtfsCounter, 499 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:17,927 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1629 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:09:17,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-11-25 17:09:18,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 1045. [2022-11-25 17:09:18,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 876 states have (on average 1.2831050228310503) internal successors, (1124), 887 states have internal predecessors, (1124), 111 states have call successors, (111), 58 states have call predecessors, (111), 57 states have return successors, (110), 106 states have call predecessors, (110), 110 states have call successors, (110) [2022-11-25 17:09:18,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1345 transitions. [2022-11-25 17:09:18,103 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1345 transitions. Word has length 292 [2022-11-25 17:09:18,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:18,104 INFO L495 AbstractCegarLoop]: Abstraction has 1045 states and 1345 transitions. [2022-11-25 17:09:18,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 6 states have internal predecessors, (96), 5 states have call successors, (18), 3 states have call predecessors, (18), 1 states have return successors, (17), 4 states have call predecessors, (17), 4 states have call successors, (17) [2022-11-25 17:09:18,105 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1345 transitions. [2022-11-25 17:09:18,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-11-25 17:09:18,108 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:18,108 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:18,109 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-25 17:09:18,109 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:18,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:18,110 INFO L85 PathProgramCache]: Analyzing trace with hash -286887768, now seen corresponding path program 1 times [2022-11-25 17:09:18,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:18,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721101986] [2022-11-25 17:09:18,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:18,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:09:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:09:18,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:09:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:09:18,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:09:18,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:09:18,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:09:18,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:09:18,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:09:18,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:09:18,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:18,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:09:18,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:09:18,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:09:18,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:18,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:09:18,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:09:18,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-25 17:09:18,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:09:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-25 17:09:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-25 17:09:18,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-11-25 17:09:18,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-25 17:09:18,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-11-25 17:09:18,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-11-25 17:09:18,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:18,816 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-11-25 17:09:18,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:18,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721101986] [2022-11-25 17:09:18,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721101986] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:09:18,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [121215565] [2022-11-25 17:09:18,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:18,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:18,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:18,819 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:18,838 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-25 17:09:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:19,104 INFO L263 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 17:09:19,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:19,364 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 189 proven. 0 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2022-11-25 17:09:19,364 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:09:19,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [121215565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:09:19,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:09:19,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 17 [2022-11-25 17:09:19,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515577257] [2022-11-25 17:09:19,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:09:19,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 17:09:19,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:19,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 17:09:19,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-11-25 17:09:19,368 INFO L87 Difference]: Start difference. First operand 1045 states and 1345 transitions. Second operand has 10 states, 10 states have (on average 11.3) internal successors, (113), 9 states have internal predecessors, (113), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2022-11-25 17:09:21,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:21,051 INFO L93 Difference]: Finished difference Result 2805 states and 3763 transitions. [2022-11-25 17:09:21,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-25 17:09:21,052 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 9 states have internal predecessors, (113), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) Word has length 292 [2022-11-25 17:09:21,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:21,065 INFO L225 Difference]: With dead ends: 2805 [2022-11-25 17:09:21,065 INFO L226 Difference]: Without dead ends: 2108 [2022-11-25 17:09:21,068 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 370 GetRequests, 338 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 235 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=168, Invalid=954, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 17:09:21,069 INFO L413 NwaCegarLoop]: 435 mSDtfsCounter, 1260 mSDsluCounter, 2461 mSDsCounter, 0 mSdLazyCounter, 1024 mSolverCounterSat, 300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1274 SdHoareTripleChecker+Valid, 2896 SdHoareTripleChecker+Invalid, 1324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 300 IncrementalHoareTripleChecker+Valid, 1024 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:21,069 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 2896 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-11-25 17:09:21,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2022-11-25 17:09:21,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 1221. [2022-11-25 17:09:21,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 1020 states have (on average 1.2754901960784313) internal successors, (1301), 1033 states have internal predecessors, (1301), 133 states have call successors, (133), 68 states have call predecessors, (133), 67 states have return successors, (132), 126 states have call predecessors, (132), 132 states have call successors, (132) [2022-11-25 17:09:21,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1566 transitions. [2022-11-25 17:09:21,291 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1566 transitions. Word has length 292 [2022-11-25 17:09:21,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:21,292 INFO L495 AbstractCegarLoop]: Abstraction has 1221 states and 1566 transitions. [2022-11-25 17:09:21,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.3) internal successors, (113), 9 states have internal predecessors, (113), 4 states have call successors, (18), 4 states have call predecessors, (18), 5 states have return successors, (17), 5 states have call predecessors, (17), 4 states have call successors, (17) [2022-11-25 17:09:21,293 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1566 transitions. [2022-11-25 17:09:21,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-11-25 17:09:21,296 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:21,297 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 8, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:21,304 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:21,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-11-25 17:09:21,504 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:21,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:21,505 INFO L85 PathProgramCache]: Analyzing trace with hash 600167080, now seen corresponding path program 1 times [2022-11-25 17:09:21,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:21,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904546985] [2022-11-25 17:09:21,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:21,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:09:22,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:09:22,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:09:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:09:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:09:22,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:09:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:09:22,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:09:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:09:22,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:09:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:09:22,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:09:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:09:22,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:22,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:09:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:09:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-25 17:09:22,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:09:22,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-25 17:09:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-25 17:09:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-11-25 17:09:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-25 17:09:22,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-11-25 17:09:22,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-11-25 17:09:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,182 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2022-11-25 17:09:22,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:22,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904546985] [2022-11-25 17:09:22,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904546985] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:09:22,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1433946714] [2022-11-25 17:09:22,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:22,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:22,184 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:22,185 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:22,222 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-25 17:09:22,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:22,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 17:09:22,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:22,621 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 583 trivial. 0 not checked. [2022-11-25 17:09:22,621 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:09:22,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1433946714] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:09:22,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:09:22,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 15 [2022-11-25 17:09:22,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166179404] [2022-11-25 17:09:22,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:09:22,623 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:09:22,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:22,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:09:22,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-11-25 17:09:22,624 INFO L87 Difference]: Start difference. First operand 1221 states and 1566 transitions. Second operand has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-25 17:09:23,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:23,326 INFO L93 Difference]: Finished difference Result 2477 states and 3294 transitions. [2022-11-25 17:09:23,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:09:23,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 292 [2022-11-25 17:09:23,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:23,336 INFO L225 Difference]: With dead ends: 2477 [2022-11-25 17:09:23,336 INFO L226 Difference]: Without dead ends: 1601 [2022-11-25 17:09:23,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-11-25 17:09:23,340 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 399 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 414 SdHoareTripleChecker+Valid, 2200 SdHoareTripleChecker+Invalid, 642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:23,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [414 Valid, 2200 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:09:23,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-11-25 17:09:23,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1199. [2022-11-25 17:09:23,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1199 states, 1004 states have (on average 1.2709163346613546) internal successors, (1276), 1017 states have internal predecessors, (1276), 127 states have call successors, (127), 68 states have call predecessors, (127), 67 states have return successors, (126), 120 states have call predecessors, (126), 126 states have call successors, (126) [2022-11-25 17:09:23,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1529 transitions. [2022-11-25 17:09:23,595 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1529 transitions. Word has length 292 [2022-11-25 17:09:23,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:23,596 INFO L495 AbstractCegarLoop]: Abstraction has 1199 states and 1529 transitions. [2022-11-25 17:09:23,596 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.875) internal successors, (111), 7 states have internal predecessors, (111), 3 states have call successors, (18), 3 states have call predecessors, (18), 4 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-25 17:09:23,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1529 transitions. [2022-11-25 17:09:23,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2022-11-25 17:09:23,600 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:23,600 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 10, 10, 9, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:09:23,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-25 17:09:23,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-11-25 17:09:23,807 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:23,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:23,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1957012249, now seen corresponding path program 1 times [2022-11-25 17:09:23,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:23,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39653249] [2022-11-25 17:09:23,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:23,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:23,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:09:23,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:09:23,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:09:23,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:09:23,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:09:23,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:09:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:09:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:09:23,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:09:23,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:09:23,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:09:23,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:09:23,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:09:23,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:09:23,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:09:23,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-25 17:09:23,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:09:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-25 17:09:23,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-25 17:09:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-25 17:09:23,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-11-25 17:09:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-11-25 17:09:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:23,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-11-25 17:09:24,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:24,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-11-25 17:09:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:24,006 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 704 trivial. 0 not checked. [2022-11-25 17:09:24,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:24,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39653249] [2022-11-25 17:09:24,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39653249] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:09:24,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:09:24,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:09:24,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407711764] [2022-11-25 17:09:24,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:09:24,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:09:24,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:24,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:09:24,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:09:24,009 INFO L87 Difference]: Start difference. First operand 1199 states and 1529 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-11-25 17:09:24,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:09:24,837 INFO L93 Difference]: Finished difference Result 1977 states and 2543 transitions. [2022-11-25 17:09:24,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:09:24,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 300 [2022-11-25 17:09:24,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:09:24,843 INFO L225 Difference]: With dead ends: 1977 [2022-11-25 17:09:24,843 INFO L226 Difference]: Without dead ends: 1135 [2022-11-25 17:09:24,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:09:24,846 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 480 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 17:09:24,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 782 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 17:09:24,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2022-11-25 17:09:25,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 898. [2022-11-25 17:09:25,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 898 states, 767 states have (on average 1.2464146023468057) internal successors, (956), 770 states have internal predecessors, (956), 85 states have call successors, (85), 45 states have call predecessors, (85), 45 states have return successors, (85), 82 states have call predecessors, (85), 85 states have call successors, (85) [2022-11-25 17:09:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1126 transitions. [2022-11-25 17:09:25,022 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1126 transitions. Word has length 300 [2022-11-25 17:09:25,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:09:25,023 INFO L495 AbstractCegarLoop]: Abstraction has 898 states and 1126 transitions. [2022-11-25 17:09:25,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (16), 3 states have call predecessors, (16), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-11-25 17:09:25,024 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1126 transitions. [2022-11-25 17:09:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2022-11-25 17:09:25,028 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:09:25,029 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 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] [2022-11-25 17:09:25,029 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-25 17:09:25,029 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:09:25,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:09:25,030 INFO L85 PathProgramCache]: Analyzing trace with hash 336941807, now seen corresponding path program 1 times [2022-11-25 17:09:25,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:09:25,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474588533] [2022-11-25 17:09:25,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:25,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:09:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:09:26,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:09:26,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:09:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:09:26,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:09:26,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:09:26,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:09:26,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:09:26,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:09:26,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:09:26,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:26,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:09:26,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:09:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:09:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:09:26,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:09:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:09:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-25 17:09:26,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:09:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-25 17:09:26,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-25 17:09:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-25 17:09:26,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-11-25 17:09:26,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-11-25 17:09:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-11-25 17:09:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2022-11-25 17:09:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-11-25 17:09:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-11-25 17:09:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-11-25 17:09:26,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-11-25 17:09:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 16 proven. 26 refuted. 0 times theorem prover too weak. 833 trivial. 0 not checked. [2022-11-25 17:09:26,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:09:26,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474588533] [2022-11-25 17:09:26,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474588533] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:09:26,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [684792810] [2022-11-25 17:09:26,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:09:26,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:09:26,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:09:26,395 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:09:26,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-25 17:09:26,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:09:26,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 1261 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-25 17:09:26,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:09:27,348 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 224 proven. 75 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2022-11-25 17:09:27,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:09:28,377 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 34 proven. 71 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2022-11-25 17:09:28,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [684792810] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:09:28,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:09:28,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 34 [2022-11-25 17:09:28,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350919671] [2022-11-25 17:09:28,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:09:28,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-25 17:09:28,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:09:28,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-25 17:09:28,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2022-11-25 17:09:28,383 INFO L87 Difference]: Start difference. First operand 898 states and 1126 transitions. Second operand has 34 states, 34 states have (on average 7.294117647058823) internal successors, (248), 29 states have internal predecessors, (248), 9 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (53), 13 states have call predecessors, (53), 9 states have call successors, (53) [2022-11-25 17:11:01,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:11:01,103 INFO L93 Difference]: Finished difference Result 15080 states and 20690 transitions. [2022-11-25 17:11:01,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 682 states. [2022-11-25 17:11:01,104 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 7.294117647058823) internal successors, (248), 29 states have internal predecessors, (248), 9 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (53), 13 states have call predecessors, (53), 9 states have call successors, (53) Word has length 340 [2022-11-25 17:11:01,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:11:01,193 INFO L225 Difference]: With dead ends: 15080 [2022-11-25 17:11:01,193 INFO L226 Difference]: Without dead ends: 14483 [2022-11-25 17:11:01,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1450 GetRequests, 738 SyntacticMatches, 1 SemanticMatches, 711 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228850 ImplicationChecksByTransitivity, 58.7s TimeCoverageRelationStatistics Valid=27145, Invalid=480511, Unknown=0, NotChecked=0, Total=507656 [2022-11-25 17:11:01,304 INFO L413 NwaCegarLoop]: 943 mSDtfsCounter, 8254 mSDsluCounter, 18694 mSDsCounter, 0 mSdLazyCounter, 29382 mSolverCounterSat, 9372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8254 SdHoareTripleChecker+Valid, 19637 SdHoareTripleChecker+Invalid, 38754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.4s SdHoareTripleChecker+Time, 9372 IncrementalHoareTripleChecker+Valid, 29382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 29.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:11:01,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8254 Valid, 19637 Invalid, 38754 Unknown, 0 Unchecked, 0.4s Time], IncrementalHoareTripleChecker [9372 Valid, 29382 Invalid, 0 Unknown, 0 Unchecked, 29.3s Time] [2022-11-25 17:11:01,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14483 states. [2022-11-25 17:11:02,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14483 to 3550. [2022-11-25 17:11:02,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3550 states, 2872 states have (on average 1.2573119777158774) internal successors, (3611), 2905 states have internal predecessors, (3611), 456 states have call successors, (456), 203 states have call predecessors, (456), 221 states have return successors, (483), 441 states have call predecessors, (483), 456 states have call successors, (483) [2022-11-25 17:11:02,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 4550 transitions. [2022-11-25 17:11:02,596 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 4550 transitions. Word has length 340 [2022-11-25 17:11:02,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:11:02,597 INFO L495 AbstractCegarLoop]: Abstraction has 3550 states and 4550 transitions. [2022-11-25 17:11:02,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 7.294117647058823) internal successors, (248), 29 states have internal predecessors, (248), 9 states have call successors, (53), 9 states have call predecessors, (53), 14 states have return successors, (53), 13 states have call predecessors, (53), 9 states have call successors, (53) [2022-11-25 17:11:02,598 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 4550 transitions. [2022-11-25 17:11:02,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2022-11-25 17:11:02,607 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:11:02,608 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:11:02,620 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-11-25 17:11:02,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-25 17:11:02,815 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:11:02,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:11:02,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1208992398, now seen corresponding path program 1 times [2022-11-25 17:11:02,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:11:02,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [30645054] [2022-11-25 17:11:02,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:11:02,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:11:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:04,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:11:04,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:04,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:11:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:04,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:11:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:04,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:11:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:04,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:11:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:04,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:11:04,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:04,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:11:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:04,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:11:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:04,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:11:04,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:04,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:11:04,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:04,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:11:04,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:04,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:11:04,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:04,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:11:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:04,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:11:04,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:04,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:11:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:04,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:11:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:04,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:11:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:04,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:11:04,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:05,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:11:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:05,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-11-25 17:11:05,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:05,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-25 17:11:05,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:05,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-11-25 17:11:05,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:05,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-11-25 17:11:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:05,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-11-25 17:11:05,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:05,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-11-25 17:11:05,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:05,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-11-25 17:11:05,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:05,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-11-25 17:11:05,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:05,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-11-25 17:11:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:05,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-11-25 17:11:05,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:05,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-11-25 17:11:05,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:05,097 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 825 trivial. 0 not checked. [2022-11-25 17:11:05,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:11:05,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [30645054] [2022-11-25 17:11:05,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [30645054] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:11:05,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240856789] [2022-11-25 17:11:05,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:11:05,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:11:05,099 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:11:05,103 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:11:05,126 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-25 17:11:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:05,470 INFO L263 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-25 17:11:05,484 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:11:06,286 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 190 proven. 102 refuted. 0 times theorem prover too weak. 580 trivial. 0 not checked. [2022-11-25 17:11:06,286 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:11:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 33 proven. 69 refuted. 0 times theorem prover too weak. 770 trivial. 0 not checked. [2022-11-25 17:11:07,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240856789] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:11:07,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:11:07,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 41 [2022-11-25 17:11:07,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838029386] [2022-11-25 17:11:07,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:11:07,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-25 17:11:07,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:11:07,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-25 17:11:07,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1537, Unknown=0, NotChecked=0, Total=1640 [2022-11-25 17:11:07,400 INFO L87 Difference]: Start difference. First operand 3550 states and 4550 transitions. Second operand has 41 states, 41 states have (on average 6.073170731707317) internal successors, (249), 35 states have internal predecessors, (249), 10 states have call successors, (54), 9 states have call predecessors, (54), 14 states have return successors, (54), 15 states have call predecessors, (54), 10 states have call successors, (54) [2022-11-25 17:11:46,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:11:46,851 INFO L93 Difference]: Finished difference Result 11327 states and 14716 transitions. [2022-11-25 17:11:46,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 298 states. [2022-11-25 17:11:46,852 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 6.073170731707317) internal successors, (249), 35 states have internal predecessors, (249), 10 states have call successors, (54), 9 states have call predecessors, (54), 14 states have return successors, (54), 15 states have call predecessors, (54), 10 states have call successors, (54) Word has length 341 [2022-11-25 17:11:46,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:11:46,891 INFO L225 Difference]: With dead ends: 11327 [2022-11-25 17:11:46,892 INFO L226 Difference]: Without dead ends: 8263 [2022-11-25 17:11:46,906 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1070 GetRequests, 736 SyntacticMatches, 1 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42686 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=6927, Invalid=104963, Unknown=0, NotChecked=0, Total=111890 [2022-11-25 17:11:46,907 INFO L413 NwaCegarLoop]: 986 mSDtfsCounter, 5876 mSDsluCounter, 20591 mSDsCounter, 0 mSdLazyCounter, 24389 mSolverCounterSat, 2943 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5877 SdHoareTripleChecker+Valid, 21577 SdHoareTripleChecker+Invalid, 27332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 2943 IncrementalHoareTripleChecker+Valid, 24389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:11:46,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5877 Valid, 21577 Invalid, 27332 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [2943 Valid, 24389 Invalid, 0 Unknown, 0 Unchecked, 19.1s Time] [2022-11-25 17:11:46,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8263 states. [2022-11-25 17:11:47,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8263 to 2862. [2022-11-25 17:11:47,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2862 states, 2359 states have (on average 1.2403560830860534) internal successors, (2926), 2385 states have internal predecessors, (2926), 311 states have call successors, (311), 176 states have call predecessors, (311), 191 states have return successors, (332), 300 states have call predecessors, (332), 311 states have call successors, (332) [2022-11-25 17:11:47,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 3569 transitions. [2022-11-25 17:11:47,707 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 3569 transitions. Word has length 341 [2022-11-25 17:11:47,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:11:47,708 INFO L495 AbstractCegarLoop]: Abstraction has 2862 states and 3569 transitions. [2022-11-25 17:11:47,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 6.073170731707317) internal successors, (249), 35 states have internal predecessors, (249), 10 states have call successors, (54), 9 states have call predecessors, (54), 14 states have return successors, (54), 15 states have call predecessors, (54), 10 states have call successors, (54) [2022-11-25 17:11:47,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 3569 transitions. [2022-11-25 17:11:47,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2022-11-25 17:11:47,717 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:11:47,718 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 9, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:11:47,725 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-25 17:11:47,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:11:47,925 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:11:47,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:11:47,926 INFO L85 PathProgramCache]: Analyzing trace with hash 6096405, now seen corresponding path program 1 times [2022-11-25 17:11:47,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:11:47,926 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416515697] [2022-11-25 17:11:47,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:11:47,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:11:47,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:11:48,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:11:48,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:11:48,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:11:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:11:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:11:48,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:11:48,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:11:48,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:11:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:11:48,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:11:48,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:11:48,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:11:48,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:11:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:11:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:11:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:11:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:11:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-25 17:11:48,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-25 17:11:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-11-25 17:11:48,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-11-25 17:11:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-25 17:11:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-11-25 17:11:48,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-11-25 17:11:48,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-11-25 17:11:48,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-11-25 17:11:48,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-11-25 17:11:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-11-25 17:11:48,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-11-25 17:11:48,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 872 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 828 trivial. 0 not checked. [2022-11-25 17:11:48,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:11:48,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416515697] [2022-11-25 17:11:48,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416515697] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:11:48,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:11:48,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 17:11:48,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881549089] [2022-11-25 17:11:48,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:11:48,172 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 17:11:48,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:11:48,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 17:11:48,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:11:48,173 INFO L87 Difference]: Start difference. First operand 2862 states and 3569 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-25 17:11:49,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:11:49,361 INFO L93 Difference]: Finished difference Result 5813 states and 7243 transitions. [2022-11-25 17:11:49,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 17:11:49,362 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) Word has length 342 [2022-11-25 17:11:49,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:11:49,375 INFO L225 Difference]: With dead ends: 5813 [2022-11-25 17:11:49,376 INFO L226 Difference]: Without dead ends: 2820 [2022-11-25 17:11:49,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:11:49,384 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 111 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:11:49,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 606 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:11:49,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2022-11-25 17:11:50,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2820. [2022-11-25 17:11:50,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2820 states, 2332 states have (on average 1.2096912521440824) internal successors, (2821), 2349 states have internal predecessors, (2821), 311 states have call successors, (311), 176 states have call predecessors, (311), 176 states have return successors, (311), 294 states have call predecessors, (311), 311 states have call successors, (311) [2022-11-25 17:11:50,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 3443 transitions. [2022-11-25 17:11:50,487 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 3443 transitions. Word has length 342 [2022-11-25 17:11:50,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:11:50,488 INFO L495 AbstractCegarLoop]: Abstraction has 2820 states and 3443 transitions. [2022-11-25 17:11:50,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 4 states have internal predecessors, (110), 2 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (17), 2 states have call predecessors, (17), 1 states have call successors, (17) [2022-11-25 17:11:50,489 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 3443 transitions. [2022-11-25 17:11:50,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2022-11-25 17:11:50,499 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:11:50,500 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:11:50,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-25 17:11:50,500 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:11:50,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:11:50,501 INFO L85 PathProgramCache]: Analyzing trace with hash -917418757, now seen corresponding path program 1 times [2022-11-25 17:11:50,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:11:50,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610599841] [2022-11-25 17:11:50,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:11:50,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:11:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:11:51,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:11:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:11:51,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:11:51,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:11:51,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:11:51,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:11:51,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:11:51,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:11:51,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:11:51,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:11:51,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:11:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:11:51,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:11:51,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:11:51,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:11:51,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:11:51,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:11:51,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-25 17:11:51,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-25 17:11:51,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-11-25 17:11:51,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-11-25 17:11:51,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-25 17:11:51,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-11-25 17:11:51,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-11-25 17:11:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-11-25 17:11:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-11-25 17:11:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-11-25 17:11:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-11-25 17:11:51,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-11-25 17:11:51,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-11-25 17:11:51,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,476 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 48 proven. 49 refuted. 0 times theorem prover too weak. 832 trivial. 0 not checked. [2022-11-25 17:11:51,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:11:51,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610599841] [2022-11-25 17:11:51,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610599841] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:11:51,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103591729] [2022-11-25 17:11:51,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:11:51,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:11:51,478 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:11:51,479 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:11:51,498 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-25 17:11:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:11:51,808 INFO L263 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-25 17:11:51,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:11:52,250 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 258 proven. 89 refuted. 0 times theorem prover too weak. 582 trivial. 0 not checked. [2022-11-25 17:11:52,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:11:53,152 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 56 proven. 52 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2022-11-25 17:11:53,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103591729] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:11:53,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:11:53,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 23 [2022-11-25 17:11:53,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239715413] [2022-11-25 17:11:53,154 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:11:53,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-25 17:11:53,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:11:53,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-25 17:11:53,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-11-25 17:11:53,157 INFO L87 Difference]: Start difference. First operand 2820 states and 3443 transitions. Second operand has 23 states, 23 states have (on average 8.91304347826087) internal successors, (205), 19 states have internal predecessors, (205), 5 states have call successors, (43), 9 states have call predecessors, (43), 14 states have return successors, (39), 7 states have call predecessors, (39), 4 states have call successors, (39) [2022-11-25 17:12:03,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:12:03,123 INFO L93 Difference]: Finished difference Result 12193 states and 15464 transitions. [2022-11-25 17:12:03,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-11-25 17:12:03,124 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 8.91304347826087) internal successors, (205), 19 states have internal predecessors, (205), 5 states have call successors, (43), 9 states have call predecessors, (43), 14 states have return successors, (39), 7 states have call predecessors, (39), 4 states have call successors, (39) Word has length 352 [2022-11-25 17:12:03,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:12:03,173 INFO L225 Difference]: With dead ends: 12193 [2022-11-25 17:12:03,173 INFO L226 Difference]: Without dead ends: 10348 [2022-11-25 17:12:03,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 859 GetRequests, 786 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=801, Invalid=4169, Unknown=0, NotChecked=0, Total=4970 [2022-11-25 17:12:03,182 INFO L413 NwaCegarLoop]: 795 mSDtfsCounter, 1758 mSDsluCounter, 7689 mSDsCounter, 0 mSdLazyCounter, 3791 mSolverCounterSat, 828 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1778 SdHoareTripleChecker+Valid, 8484 SdHoareTripleChecker+Invalid, 4619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 828 IncrementalHoareTripleChecker+Valid, 3791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:12:03,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1778 Valid, 8484 Invalid, 4619 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [828 Valid, 3791 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-11-25 17:12:03,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10348 states. [2022-11-25 17:12:05,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10348 to 5037. [2022-11-25 17:12:05,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5037 states, 4087 states have (on average 1.2008808416931736) internal successors, (4908), 4125 states have internal predecessors, (4908), 624 states have call successors, (624), 325 states have call predecessors, (624), 325 states have return successors, (624), 586 states have call predecessors, (624), 624 states have call successors, (624) [2022-11-25 17:12:05,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5037 states to 5037 states and 6156 transitions. [2022-11-25 17:12:05,377 INFO L78 Accepts]: Start accepts. Automaton has 5037 states and 6156 transitions. Word has length 352 [2022-11-25 17:12:05,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:12:05,379 INFO L495 AbstractCegarLoop]: Abstraction has 5037 states and 6156 transitions. [2022-11-25 17:12:05,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 8.91304347826087) internal successors, (205), 19 states have internal predecessors, (205), 5 states have call successors, (43), 9 states have call predecessors, (43), 14 states have return successors, (39), 7 states have call predecessors, (39), 4 states have call successors, (39) [2022-11-25 17:12:05,379 INFO L276 IsEmpty]: Start isEmpty. Operand 5037 states and 6156 transitions. [2022-11-25 17:12:05,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2022-11-25 17:12:05,404 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:12:05,405 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:12:05,414 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-25 17:12:05,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-11-25 17:12:05,614 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:12:05,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:05,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1818725745, now seen corresponding path program 1 times [2022-11-25 17:12:05,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:05,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372538390] [2022-11-25 17:12:05,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:05,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:05,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:12:07,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:12:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:12:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:12:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:12:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:12:07,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:12:07,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:12:07,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:12:07,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:12:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:12:07,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:12:07,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:12:07,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:12:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:12:07,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:12:07,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:12:07,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:12:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-25 17:12:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-25 17:12:07,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-11-25 17:12:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-11-25 17:12:07,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-25 17:12:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-11-25 17:12:07,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-11-25 17:12:07,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-11-25 17:12:07,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-11-25 17:12:07,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-11-25 17:12:07,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-11-25 17:12:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-11-25 17:12:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-11-25 17:12:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,413 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 882 trivial. 0 not checked. [2022-11-25 17:12:07,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:07,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372538390] [2022-11-25 17:12:07,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372538390] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:12:07,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992022486] [2022-11-25 17:12:07,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:07,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:12:07,415 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:12:07,416 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:12:07,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-25 17:12:07,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:07,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-25 17:12:07,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:12:08,702 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 319 proven. 118 refuted. 0 times theorem prover too weak. 492 trivial. 0 not checked. [2022-11-25 17:12:08,702 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:12:09,886 INFO L134 CoverageAnalysis]: Checked inductivity of 929 backedges. 42 proven. 204 refuted. 0 times theorem prover too weak. 683 trivial. 0 not checked. [2022-11-25 17:12:09,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992022486] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:12:09,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:12:09,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15, 19] total 49 [2022-11-25 17:12:09,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780308873] [2022-11-25 17:12:09,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:12:09,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-25 17:12:09,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:09,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-25 17:12:09,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2221, Unknown=0, NotChecked=0, Total=2352 [2022-11-25 17:12:09,892 INFO L87 Difference]: Start difference. First operand 5037 states and 6156 transitions. Second operand has 49 states, 48 states have (on average 6.166666666666667) internal successors, (296), 42 states have internal predecessors, (296), 13 states have call successors, (64), 10 states have call predecessors, (64), 12 states have return successors, (65), 17 states have call predecessors, (65), 12 states have call successors, (65) [2022-11-25 17:12:50,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:12:50,338 INFO L93 Difference]: Finished difference Result 27541 states and 37011 transitions. [2022-11-25 17:12:50,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2022-11-25 17:12:50,339 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 6.166666666666667) internal successors, (296), 42 states have internal predecessors, (296), 13 states have call successors, (64), 10 states have call predecessors, (64), 12 states have return successors, (65), 17 states have call predecessors, (65), 12 states have call successors, (65) Word has length 352 [2022-11-25 17:12:50,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:12:50,425 INFO L225 Difference]: With dead ends: 27541 [2022-11-25 17:12:50,425 INFO L226 Difference]: Without dead ends: 23223 [2022-11-25 17:12:50,446 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1013 GetRequests, 756 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22799 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=4015, Invalid=62807, Unknown=0, NotChecked=0, Total=66822 [2022-11-25 17:12:50,447 INFO L413 NwaCegarLoop]: 643 mSDtfsCounter, 3876 mSDsluCounter, 18223 mSDsCounter, 0 mSdLazyCounter, 21240 mSolverCounterSat, 1697 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3888 SdHoareTripleChecker+Valid, 18866 SdHoareTripleChecker+Invalid, 22937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.3s SdHoareTripleChecker+Time, 1697 IncrementalHoareTripleChecker+Valid, 21240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:12:50,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3888 Valid, 18866 Invalid, 22937 Unknown, 0 Unchecked, 0.3s Time], IncrementalHoareTripleChecker [1697 Valid, 21240 Invalid, 0 Unknown, 0 Unchecked, 16.4s Time] [2022-11-25 17:12:50,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23223 states. [2022-11-25 17:12:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23223 to 5495. [2022-11-25 17:12:52,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5495 states, 4483 states have (on average 1.194735668079411) internal successors, (5356), 4521 states have internal predecessors, (5356), 657 states have call successors, (657), 352 states have call predecessors, (657), 354 states have return successors, (661), 621 states have call predecessors, (661), 657 states have call successors, (661) [2022-11-25 17:12:52,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5495 states to 5495 states and 6674 transitions. [2022-11-25 17:12:52,590 INFO L78 Accepts]: Start accepts. Automaton has 5495 states and 6674 transitions. Word has length 352 [2022-11-25 17:12:52,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:12:52,591 INFO L495 AbstractCegarLoop]: Abstraction has 5495 states and 6674 transitions. [2022-11-25 17:12:52,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 6.166666666666667) internal successors, (296), 42 states have internal predecessors, (296), 13 states have call successors, (64), 10 states have call predecessors, (64), 12 states have return successors, (65), 17 states have call predecessors, (65), 12 states have call successors, (65) [2022-11-25 17:12:52,591 INFO L276 IsEmpty]: Start isEmpty. Operand 5495 states and 6674 transitions. [2022-11-25 17:12:52,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2022-11-25 17:12:52,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:12:52,609 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 9, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:12:52,623 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-25 17:12:52,817 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-11-25 17:12:52,817 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:12:52,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:52,818 INFO L85 PathProgramCache]: Analyzing trace with hash -1706367875, now seen corresponding path program 1 times [2022-11-25 17:12:52,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:52,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595407235] [2022-11-25 17:12:52,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:52,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:52,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:12:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:52,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:12:52,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:52,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-25 17:12:52,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:52,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-25 17:12:52,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:52,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-25 17:12:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:52,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:12:52,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:52,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:12:52,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:52,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:12:52,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:52,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 17:12:53,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:12:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:12:53,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:12:53,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-25 17:12:53,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:12:53,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:12:53,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:12:53,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-25 17:12:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-25 17:12:53,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-11-25 17:12:53,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-11-25 17:12:53,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-11-25 17:12:53,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-11-25 17:12:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-11-25 17:12:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-11-25 17:12:53,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-11-25 17:12:53,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-11-25 17:12:53,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-11-25 17:12:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-11-25 17:12:53,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-11-25 17:12:53,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-11-25 17:12:53,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-11-25 17:12:53,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,095 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 9 proven. 136 refuted. 0 times theorem prover too weak. 799 trivial. 0 not checked. [2022-11-25 17:12:53,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:53,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595407235] [2022-11-25 17:12:53,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595407235] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:12:53,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1440715575] [2022-11-25 17:12:53,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:53,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:12:53,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:12:53,098 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:12:53,110 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-25 17:12:53,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:53,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:12:53,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:12:53,487 INFO L134 CoverageAnalysis]: Checked inductivity of 944 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 855 trivial. 0 not checked. [2022-11-25 17:12:53,488 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:12:53,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1440715575] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:53,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:12:53,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-25 17:12:53,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233693171] [2022-11-25 17:12:53,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:53,490 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:12:53,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:53,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:12:53,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 17:12:53,494 INFO L87 Difference]: Start difference. First operand 5495 states and 6674 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-25 17:12:55,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:12:55,356 INFO L93 Difference]: Finished difference Result 10533 states and 12827 transitions. [2022-11-25 17:12:55,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 17:12:55,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 355 [2022-11-25 17:12:55,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:12:55,372 INFO L225 Difference]: With dead ends: 10533 [2022-11-25 17:12:55,373 INFO L226 Difference]: Without dead ends: 5039 [2022-11-25 17:12:55,384 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 421 GetRequests, 417 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-25 17:12:55,385 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 28 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:12:55,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 637 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:12:55,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5039 states. [2022-11-25 17:12:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5039 to 5039. [2022-11-25 17:12:57,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5039 states, 4088 states have (on average 1.1981409001956946) internal successors, (4898), 4126 states have internal predecessors, (4898), 624 states have call successors, (624), 326 states have call predecessors, (624), 326 states have return successors, (624), 586 states have call predecessors, (624), 624 states have call successors, (624) [2022-11-25 17:12:57,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5039 states to 5039 states and 6146 transitions. [2022-11-25 17:12:57,126 INFO L78 Accepts]: Start accepts. Automaton has 5039 states and 6146 transitions. Word has length 355 [2022-11-25 17:12:57,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:12:57,127 INFO L495 AbstractCegarLoop]: Abstraction has 5039 states and 6146 transitions. [2022-11-25 17:12:57,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-25 17:12:57,127 INFO L276 IsEmpty]: Start isEmpty. Operand 5039 states and 6146 transitions. [2022-11-25 17:12:57,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2022-11-25 17:12:57,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:12:57,144 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1] [2022-11-25 17:12:57,153 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-25 17:12:57,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:12:57,352 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:12:57,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:57,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1005231542, now seen corresponding path program 1 times [2022-11-25 17:12:57,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:57,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389104882] [2022-11-25 17:12:57,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:57,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:57,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:12:57,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:12:57,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:12:57,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:12:57,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:12:57,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:12:57,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:12:57,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:12:57,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:12:57,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:12:57,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:12:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:12:57,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:12:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:12:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:12:57,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:12:57,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:12:57,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-11-25 17:12:57,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-25 17:12:57,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-25 17:12:57,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-11-25 17:12:57,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-11-25 17:12:57,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-25 17:12:57,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-11-25 17:12:57,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-11-25 17:12:57,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-11-25 17:12:57,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-11-25 17:12:57,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2022-11-25 17:12:57,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2022-11-25 17:12:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-11-25 17:12:57,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2022-11-25 17:12:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-11-25 17:12:57,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:12:57,757 INFO L134 CoverageAnalysis]: Checked inductivity of 999 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 992 trivial. 0 not checked. [2022-11-25 17:12:57,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:12:57,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389104882] [2022-11-25 17:12:57,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389104882] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:12:57,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:12:57,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:12:57,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680318621] [2022-11-25 17:12:57,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:12:57,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:12:57,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:12:57,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:12:57,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:12:57,761 INFO L87 Difference]: Start difference. First operand 5039 states and 6146 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-25 17:12:58,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:12:58,967 INFO L93 Difference]: Finished difference Result 6723 states and 8219 transitions. [2022-11-25 17:12:58,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:12:58,968 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 362 [2022-11-25 17:12:58,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:12:58,979 INFO L225 Difference]: With dead ends: 6723 [2022-11-25 17:12:58,979 INFO L226 Difference]: Without dead ends: 2436 [2022-11-25 17:12:58,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:12:58,989 INFO L413 NwaCegarLoop]: 177 mSDtfsCounter, 55 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:12:58,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 457 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 17:12:58,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2022-11-25 17:12:59,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2436. [2022-11-25 17:12:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2436 states, 1987 states have (on average 1.1816809260191243) internal successors, (2348), 2004 states have internal predecessors, (2348), 291 states have call successors, (291), 157 states have call predecessors, (291), 157 states have return successors, (291), 274 states have call predecessors, (291), 291 states have call successors, (291) [2022-11-25 17:12:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2436 states and 2930 transitions. [2022-11-25 17:12:59,794 INFO L78 Accepts]: Start accepts. Automaton has 2436 states and 2930 transitions. Word has length 362 [2022-11-25 17:12:59,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:12:59,795 INFO L495 AbstractCegarLoop]: Abstraction has 2436 states and 2930 transitions. [2022-11-25 17:12:59,795 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (20), 3 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-25 17:12:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 2930 transitions. [2022-11-25 17:12:59,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2022-11-25 17:12:59,804 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:12:59,804 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 12, 12, 9, 8, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:12:59,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-25 17:12:59,805 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:12:59,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:12:59,805 INFO L85 PathProgramCache]: Analyzing trace with hash -294846551, now seen corresponding path program 1 times [2022-11-25 17:12:59,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:12:59,806 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339268768] [2022-11-25 17:12:59,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:12:59,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:12:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:13:01,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:13:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:13:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:13:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:13:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:13:01,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:13:01,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:13:01,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:13:01,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:13:01,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:13:01,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:13:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:13:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:13:01,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:13:01,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:13:01,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:13:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:13:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-25 17:13:01,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-11-25 17:13:01,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-25 17:13:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-11-25 17:13:01,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-11-25 17:13:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-11-25 17:13:01,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-11-25 17:13:01,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-11-25 17:13:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2022-11-25 17:13:01,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2022-11-25 17:13:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2022-11-25 17:13:01,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-11-25 17:13:01,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-11-25 17:13:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-11-25 17:13:01,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,487 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 22 proven. 25 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2022-11-25 17:13:01,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:13:01,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339268768] [2022-11-25 17:13:01,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339268768] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:13:01,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596804522] [2022-11-25 17:13:01,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:13:01,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:13:01,489 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:13:01,490 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:13:01,517 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-25 17:13:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:01,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 1313 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-25 17:13:01,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:13:04,086 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 445 proven. 205 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-11-25 17:13:04,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:13:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 993 backedges. 101 proven. 189 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2022-11-25 17:13:05,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1596804522] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:13:05,985 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:13:05,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 21] total 64 [2022-11-25 17:13:05,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70102587] [2022-11-25 17:13:05,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:13:05,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-25 17:13:05,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:13:05,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-25 17:13:05,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3798, Unknown=0, NotChecked=0, Total=4032 [2022-11-25 17:13:05,989 INFO L87 Difference]: Start difference. First operand 2436 states and 2930 transitions. Second operand has 64 states, 64 states have (on average 5.765625) internal successors, (369), 55 states have internal predecessors, (369), 19 states have call successors, (67), 13 states have call predecessors, (67), 19 states have return successors, (69), 24 states have call predecessors, (69), 19 states have call successors, (69) [2022-11-25 17:13:34,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:13:34,471 INFO L93 Difference]: Finished difference Result 9294 states and 12083 transitions. [2022-11-25 17:13:34,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2022-11-25 17:13:34,471 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 5.765625) internal successors, (369), 55 states have internal predecessors, (369), 19 states have call successors, (67), 13 states have call predecessors, (67), 19 states have return successors, (69), 24 states have call predecessors, (69), 19 states have call successors, (69) Word has length 363 [2022-11-25 17:13:34,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:13:34,496 INFO L225 Difference]: With dead ends: 9294 [2022-11-25 17:13:34,497 INFO L226 Difference]: Without dead ends: 7373 [2022-11-25 17:13:34,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 964 GetRequests, 763 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11420 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=2730, Invalid=38276, Unknown=0, NotChecked=0, Total=41006 [2022-11-25 17:13:34,507 INFO L413 NwaCegarLoop]: 649 mSDtfsCounter, 2440 mSDsluCounter, 23828 mSDsCounter, 0 mSdLazyCounter, 24030 mSolverCounterSat, 1207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2453 SdHoareTripleChecker+Valid, 24477 SdHoareTripleChecker+Invalid, 25237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1207 IncrementalHoareTripleChecker+Valid, 24030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:13:34,508 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2453 Valid, 24477 Invalid, 25237 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1207 Valid, 24030 Invalid, 0 Unknown, 0 Unchecked, 16.2s Time] [2022-11-25 17:13:34,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7373 states. [2022-11-25 17:13:35,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7373 to 2442. [2022-11-25 17:13:35,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2442 states, 1992 states have (on average 1.178714859437751) internal successors, (2348), 2009 states have internal predecessors, (2348), 291 states have call successors, (291), 158 states have call predecessors, (291), 158 states have return successors, (291), 274 states have call predecessors, (291), 291 states have call successors, (291) [2022-11-25 17:13:35,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 2930 transitions. [2022-11-25 17:13:35,589 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 2930 transitions. Word has length 363 [2022-11-25 17:13:35,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:13:35,590 INFO L495 AbstractCegarLoop]: Abstraction has 2442 states and 2930 transitions. [2022-11-25 17:13:35,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 5.765625) internal successors, (369), 55 states have internal predecessors, (369), 19 states have call successors, (67), 13 states have call predecessors, (67), 19 states have return successors, (69), 24 states have call predecessors, (69), 19 states have call successors, (69) [2022-11-25 17:13:35,590 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 2930 transitions. [2022-11-25 17:13:35,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2022-11-25 17:13:35,598 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:13:35,598 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 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-25 17:13:35,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-25 17:13:35,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-11-25 17:13:35,807 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:13:35,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:13:35,808 INFO L85 PathProgramCache]: Analyzing trace with hash 325853320, now seen corresponding path program 1 times [2022-11-25 17:13:35,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:13:35,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144679363] [2022-11-25 17:13:35,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:13:35,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:13:35,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:13:36,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:13:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:13:36,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:13:36,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:13:36,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:13:36,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:13:36,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:13:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:13:36,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:13:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:13:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:13:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:13:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:13:36,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:13:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:13:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:13:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:13:36,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-25 17:13:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-11-25 17:13:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-25 17:13:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-11-25 17:13:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-11-25 17:13:36,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-11-25 17:13:36,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-11-25 17:13:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2022-11-25 17:13:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-11-25 17:13:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-11-25 17:13:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-11-25 17:13:36,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-11-25 17:13:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2022-11-25 17:13:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2022-11-25 17:13:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-11-25 17:13:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:36,163 INFO L134 CoverageAnalysis]: Checked inductivity of 1063 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 1055 trivial. 0 not checked. [2022-11-25 17:13:36,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:13:36,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144679363] [2022-11-25 17:13:36,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144679363] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:13:36,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:13:36,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-25 17:13:36,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422894123] [2022-11-25 17:13:36,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:13:36,166 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:13:36,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:13:36,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:13:36,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:13:36,167 INFO L87 Difference]: Start difference. First operand 2442 states and 2930 transitions. Second operand has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-25 17:13:37,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:13:37,127 INFO L93 Difference]: Finished difference Result 4359 states and 5266 transitions. [2022-11-25 17:13:37,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:13:37,128 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 374 [2022-11-25 17:13:37,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:13:37,137 INFO L225 Difference]: With dead ends: 4359 [2022-11-25 17:13:37,137 INFO L226 Difference]: Without dead ends: 2350 [2022-11-25 17:13:37,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:13:37,142 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 55 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:13:37,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 454 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:13:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2022-11-25 17:13:37,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2350. [2022-11-25 17:13:37,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2350 states, 1916 states have (on average 1.1764091858037578) internal successors, (2254), 1932 states have internal predecessors, (2254), 281 states have call successors, (281), 152 states have call predecessors, (281), 152 states have return successors, (281), 265 states have call predecessors, (281), 281 states have call successors, (281) [2022-11-25 17:13:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 2816 transitions. [2022-11-25 17:13:37,877 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 2816 transitions. Word has length 374 [2022-11-25 17:13:37,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:13:37,877 INFO L495 AbstractCegarLoop]: Abstraction has 2350 states and 2816 transitions. [2022-11-25 17:13:37,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.5) internal successors, (118), 3 states have internal predecessors, (118), 2 states have call successors, (23), 3 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-25 17:13:37,878 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 2816 transitions. [2022-11-25 17:13:37,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2022-11-25 17:13:37,883 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:13:37,884 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 10, 10, 10, 9, 8, 8, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 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, 2, 2, 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, 1, 1, 1, 1, 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-25 17:13:37,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-25 17:13:37,884 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:13:37,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:13:37,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1942345502, now seen corresponding path program 1 times [2022-11-25 17:13:37,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:13:37,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599836195] [2022-11-25 17:13:37,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:13:37,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:13:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:13:38,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:13:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:13:38,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:13:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:13:38,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:13:38,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:13:38,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:13:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:13:38,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:13:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:13:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:13:38,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:13:38,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:13:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:13:38,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:13:38,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:13:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:13:38,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:13:38,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-11-25 17:13:38,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-25 17:13:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-11-25 17:13:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-11-25 17:13:38,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-11-25 17:13:38,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-11-25 17:13:38,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-11-25 17:13:38,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-11-25 17:13:38,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2022-11-25 17:13:38,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-11-25 17:13:38,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-11-25 17:13:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2022-11-25 17:13:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2022-11-25 17:13:38,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2022-11-25 17:13:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2022-11-25 17:13:38,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,226 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 35 proven. 2 refuted. 0 times theorem prover too weak. 1021 trivial. 0 not checked. [2022-11-25 17:13:38,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:13:38,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599836195] [2022-11-25 17:13:38,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599836195] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:13:38,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102294756] [2022-11-25 17:13:38,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:13:38,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:13:38,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:13:38,229 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:13:38,243 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-25 17:13:38,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:38,523 INFO L263 TraceCheckSpWp]: Trace formula consists of 1363 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-25 17:13:38,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:13:39,215 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 127 proven. 305 refuted. 0 times theorem prover too weak. 626 trivial. 0 not checked. [2022-11-25 17:13:39,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:13:39,701 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 17 proven. 31 refuted. 0 times theorem prover too weak. 1010 trivial. 0 not checked. [2022-11-25 17:13:39,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102294756] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:13:39,701 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:13:39,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 20 [2022-11-25 17:13:39,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443392027] [2022-11-25 17:13:39,702 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:13:39,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-25 17:13:39,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:13:39,704 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-25 17:13:39,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2022-11-25 17:13:39,705 INFO L87 Difference]: Start difference. First operand 2350 states and 2816 transitions. Second operand has 20 states, 20 states have (on average 14.5) internal successors, (290), 17 states have internal predecessors, (290), 7 states have call successors, (71), 7 states have call predecessors, (71), 9 states have return successors, (70), 9 states have call predecessors, (70), 7 states have call successors, (70) [2022-11-25 17:13:50,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:13:50,958 INFO L93 Difference]: Finished difference Result 10257 states and 13098 transitions. [2022-11-25 17:13:50,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-11-25 17:13:50,959 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 14.5) internal successors, (290), 17 states have internal predecessors, (290), 7 states have call successors, (71), 7 states have call predecessors, (71), 9 states have return successors, (70), 9 states have call predecessors, (70), 7 states have call successors, (70) Word has length 379 [2022-11-25 17:13:50,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:13:50,986 INFO L225 Difference]: With dead ends: 10257 [2022-11-25 17:13:50,986 INFO L226 Difference]: Without dead ends: 8576 [2022-11-25 17:13:50,994 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 973 GetRequests, 845 SyntacticMatches, 9 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4985 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1415, Invalid=13105, Unknown=0, NotChecked=0, Total=14520 [2022-11-25 17:13:50,995 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 2649 mSDsluCounter, 5517 mSDsCounter, 0 mSdLazyCounter, 5827 mSolverCounterSat, 1056 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2659 SdHoareTripleChecker+Valid, 6011 SdHoareTripleChecker+Invalid, 6883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1056 IncrementalHoareTripleChecker+Valid, 5827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-25 17:13:50,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2659 Valid, 6011 Invalid, 6883 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1056 Valid, 5827 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-25 17:13:51,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8576 states. [2022-11-25 17:13:52,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8576 to 3984. [2022-11-25 17:13:52,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3984 states, 3244 states have (on average 1.1790998766954377) internal successors, (3825), 3272 states have internal predecessors, (3825), 485 states have call successors, (485), 254 states have call predecessors, (485), 254 states have return successors, (485), 457 states have call predecessors, (485), 485 states have call successors, (485) [2022-11-25 17:13:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 4795 transitions. [2022-11-25 17:13:52,683 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 4795 transitions. Word has length 379 [2022-11-25 17:13:52,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:13:52,684 INFO L495 AbstractCegarLoop]: Abstraction has 3984 states and 4795 transitions. [2022-11-25 17:13:52,684 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 14.5) internal successors, (290), 17 states have internal predecessors, (290), 7 states have call successors, (71), 7 states have call predecessors, (71), 9 states have return successors, (70), 9 states have call predecessors, (70), 7 states have call successors, (70) [2022-11-25 17:13:52,684 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 4795 transitions. [2022-11-25 17:13:52,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2022-11-25 17:13:52,689 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:13:52,690 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 12, 12, 9, 9, 8, 8, 8, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 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-25 17:13:52,697 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-25 17:13:52,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-11-25 17:13:52,893 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:13:52,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:13:52,894 INFO L85 PathProgramCache]: Analyzing trace with hash -996014735, now seen corresponding path program 1 times [2022-11-25 17:13:52,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:13:52,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92131385] [2022-11-25 17:13:52,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:13:52,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:13:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:13:54,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:13:54,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:13:54,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:13:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:13:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:13:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:13:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:13:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:13:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:13:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:13:54,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:13:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:13:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:13:54,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:13:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:13:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:13:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:13:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-25 17:13:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-11-25 17:13:54,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-25 17:13:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-11-25 17:13:54,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-11-25 17:13:54,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-11-25 17:13:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-11-25 17:13:54,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-11-25 17:13:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-11-25 17:13:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2022-11-25 17:13:54,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-11-25 17:13:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2022-11-25 17:13:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-11-25 17:13:54,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-11-25 17:13:54,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2022-11-25 17:13:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-11-25 17:13:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,316 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 18 proven. 23 refuted. 0 times theorem prover too weak. 1057 trivial. 0 not checked. [2022-11-25 17:13:54,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:13:54,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92131385] [2022-11-25 17:13:54,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92131385] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:13:54,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790840164] [2022-11-25 17:13:54,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:13:54,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:13:54,318 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:13:54,319 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:13:54,354 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-25 17:13:54,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:54,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 1361 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-25 17:13:54,668 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:13:54,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1098 backedges. 471 proven. 0 refuted. 0 times theorem prover too weak. 627 trivial. 0 not checked. [2022-11-25 17:13:54,988 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:13:54,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790840164] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:13:54,988 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 17:13:54,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 25 [2022-11-25 17:13:54,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332289350] [2022-11-25 17:13:54,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:13:54,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 17:13:54,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:13:54,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 17:13:54,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2022-11-25 17:13:54,991 INFO L87 Difference]: Start difference. First operand 3984 states and 4795 transitions. Second operand has 10 states, 10 states have (on average 16.2) internal successors, (162), 9 states have internal predecessors, (162), 4 states have call successors, (26), 4 states have call predecessors, (26), 5 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-25 17:13:57,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:13:57,921 INFO L93 Difference]: Finished difference Result 8324 states and 10188 transitions. [2022-11-25 17:13:57,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-25 17:13:57,921 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.2) internal successors, (162), 9 states have internal predecessors, (162), 4 states have call successors, (26), 4 states have call predecessors, (26), 5 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) Word has length 380 [2022-11-25 17:13:57,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:13:57,936 INFO L225 Difference]: With dead ends: 8324 [2022-11-25 17:13:57,937 INFO L226 Difference]: Without dead ends: 4985 [2022-11-25 17:13:57,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=241, Invalid=1829, Unknown=0, NotChecked=0, Total=2070 [2022-11-25 17:13:57,945 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 691 mSDsluCounter, 1972 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 2273 SdHoareTripleChecker+Invalid, 745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 17:13:57,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 2273 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 17:13:57,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4985 states. [2022-11-25 17:13:59,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4985 to 3579. [2022-11-25 17:13:59,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3579 states, 2924 states have (on average 1.179890560875513) internal successors, (3450), 2948 states have internal predecessors, (3450), 427 states have call successors, (427), 227 states have call predecessors, (427), 227 states have return successors, (427), 403 states have call predecessors, (427), 427 states have call successors, (427) [2022-11-25 17:13:59,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3579 states to 3579 states and 4304 transitions. [2022-11-25 17:13:59,163 INFO L78 Accepts]: Start accepts. Automaton has 3579 states and 4304 transitions. Word has length 380 [2022-11-25 17:13:59,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:13:59,163 INFO L495 AbstractCegarLoop]: Abstraction has 3579 states and 4304 transitions. [2022-11-25 17:13:59,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.2) internal successors, (162), 9 states have internal predecessors, (162), 4 states have call successors, (26), 4 states have call predecessors, (26), 5 states have return successors, (26), 5 states have call predecessors, (26), 4 states have call successors, (26) [2022-11-25 17:13:59,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3579 states and 4304 transitions. [2022-11-25 17:13:59,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2022-11-25 17:13:59,170 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:13:59,170 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 10, 9, 7, 7, 7, 6, 6, 6, 6, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 2, 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, 1, 1, 1, 1, 1, 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-25 17:13:59,177 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-25 17:13:59,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-11-25 17:13:59,371 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:13:59,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:13:59,371 INFO L85 PathProgramCache]: Analyzing trace with hash -48212473, now seen corresponding path program 1 times [2022-11-25 17:13:59,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:13:59,371 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966774154] [2022-11-25 17:13:59,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:13:59,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:13:59,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:59,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-25 17:13:59,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:59,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 17:13:59,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:59,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-25 17:13:59,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:59,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-25 17:13:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:59,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-25 17:13:59,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:59,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-25 17:13:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:59,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-25 17:13:59,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:59,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-25 17:13:59,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:13:59,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 17:13:59,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-25 17:14:00,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:14:00,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-25 17:14:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-25 17:14:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-25 17:14:00,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 17:14:00,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-25 17:14:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-25 17:14:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-25 17:14:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-25 17:14:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-25 17:14:00,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-11-25 17:14:00,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-11-25 17:14:00,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-25 17:14:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-11-25 17:14:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-25 17:14:00,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-11-25 17:14:00,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-11-25 17:14:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2022-11-25 17:14:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-11-25 17:14:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-11-25 17:14:00,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-11-25 17:14:00,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2022-11-25 17:14:00,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2022-11-25 17:14:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2022-11-25 17:14:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,286 INFO L134 CoverageAnalysis]: Checked inductivity of 1141 backedges. 137 proven. 132 refuted. 0 times theorem prover too weak. 872 trivial. 0 not checked. [2022-11-25 17:14:00,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:14:00,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966774154] [2022-11-25 17:14:00,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966774154] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 17:14:00,287 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847046132] [2022-11-25 17:14:00,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:00,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:14:00,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:14:00,289 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:14:00,292 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-25 17:14:00,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:14:00,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 1363 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-25 17:14:00,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:14:02,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1141 backedges. 612 proven. 249 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2022-11-25 17:14:02,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:14:11,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1141 backedges. 155 proven. 160 refuted. 0 times theorem prover too weak. 826 trivial. 0 not checked. [2022-11-25 17:14:11,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847046132] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:14:11,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 17:14:11,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 27, 21] total 51 [2022-11-25 17:14:11,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909670238] [2022-11-25 17:14:11,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 17:14:11,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-25 17:14:11,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:14:11,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-25 17:14:11,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2318, Unknown=1, NotChecked=0, Total=2550 [2022-11-25 17:14:11,258 INFO L87 Difference]: Start difference. First operand 3579 states and 4304 transitions. Second operand has 51 states, 51 states have (on average 7.333333333333333) internal successors, (374), 43 states have internal predecessors, (374), 14 states have call successors, (62), 11 states have call predecessors, (62), 24 states have return successors, (65), 21 states have call predecessors, (65), 14 states have call successors, (65) [2022-11-25 17:14:21,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:14:21,651 INFO L93 Difference]: Finished difference Result 7858 states and 9801 transitions. [2022-11-25 17:14:21,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-25 17:14:21,651 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 7.333333333333333) internal successors, (374), 43 states have internal predecessors, (374), 14 states have call successors, (62), 11 states have call predecessors, (62), 24 states have return successors, (65), 21 states have call predecessors, (65), 14 states have call successors, (65) Word has length 384 [2022-11-25 17:14:21,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:14:21,670 INFO L225 Difference]: With dead ends: 7858 [2022-11-25 17:14:21,670 INFO L226 Difference]: Without dead ends: 4684 [2022-11-25 17:14:21,679 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 890 GetRequests, 802 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1804 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=841, Invalid=6640, Unknown=1, NotChecked=0, Total=7482 [2022-11-25 17:14:21,681 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 801 mSDsluCounter, 5936 mSDsCounter, 0 mSdLazyCounter, 4415 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 6197 SdHoareTripleChecker+Invalid, 4650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 4415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:14:21,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 6197 Invalid, 4650 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [235 Valid, 4415 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-11-25 17:14:21,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4684 states. [2022-11-25 17:14:22,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4684 to 3586. [2022-11-25 17:14:22,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3586 states, 2930 states have (on average 1.1784982935153583) internal successors, (3453), 2954 states have internal predecessors, (3453), 427 states have call successors, (427), 228 states have call predecessors, (427), 228 states have return successors, (427), 403 states have call predecessors, (427), 427 states have call successors, (427) [2022-11-25 17:14:22,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 4307 transitions. [2022-11-25 17:14:22,956 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 4307 transitions. Word has length 384 [2022-11-25 17:14:22,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:14:22,956 INFO L495 AbstractCegarLoop]: Abstraction has 3586 states and 4307 transitions. [2022-11-25 17:14:22,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 7.333333333333333) internal successors, (374), 43 states have internal predecessors, (374), 14 states have call successors, (62), 11 states have call predecessors, (62), 24 states have return successors, (65), 21 states have call predecessors, (65), 14 states have call successors, (65) [2022-11-25 17:14:22,956 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 4307 transitions. [2022-11-25 17:14:22,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2022-11-25 17:14:22,961 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:14:22,961 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 12, 12, 10, 10, 10, 10, 9, 8, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-25 17:14:22,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-25 17:14:23,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-11-25 17:14:23,167 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:14:23,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:14:23,168 INFO L85 PathProgramCache]: Analyzing trace with hash 552300336, now seen corresponding path program 1 times [2022-11-25 17:14:23,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:14:23,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068160605] [2022-11-25 17:14:23,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:14:23,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:14:23,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:14:23,214 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:14:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:14:23,447 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:14:23,447 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:14:23,448 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 17:14:23,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-25 17:14:23,457 INFO L445 BasicCegarLoop]: Path program histogram: [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] [2022-11-25 17:14:23,463 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:14:23,778 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:14:23 BoogieIcfgContainer [2022-11-25 17:14:23,778 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:14:23,779 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:14:23,779 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:14:23,779 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:14:23,780 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:08:47" (3/4) ... [2022-11-25 17:14:23,782 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 17:14:24,105 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:14:24,106 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:14:24,106 INFO L158 Benchmark]: Toolchain (without parser) took 337954.57ms. Allocated memory was 130.0MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 87.1MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 1.0GB. Max. memory is 16.1GB. [2022-11-25 17:14:24,106 INFO L158 Benchmark]: CDTParser took 0.37ms. Allocated memory is still 96.5MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:14:24,107 INFO L158 Benchmark]: CACSL2BoogieTranslator took 607.52ms. Allocated memory is still 130.0MB. Free memory was 87.1MB in the beginning and 98.2MB in the end (delta: -11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 17:14:24,107 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.63ms. Allocated memory is still 130.0MB. Free memory was 98.2MB in the beginning and 95.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:14:24,108 INFO L158 Benchmark]: Boogie Preprocessor took 48.56ms. Allocated memory is still 130.0MB. Free memory was 95.3MB in the beginning and 93.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:14:24,108 INFO L158 Benchmark]: RCFGBuilder took 1012.47ms. Allocated memory is still 130.0MB. Free memory was 92.8MB in the beginning and 62.9MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-25 17:14:24,109 INFO L158 Benchmark]: TraceAbstraction took 335862.12ms. Allocated memory was 130.0MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 62.5MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 951.7MB. Max. memory is 16.1GB. [2022-11-25 17:14:24,110 INFO L158 Benchmark]: Witness Printer took 326.97ms. Allocated memory is still 2.3GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 43.9MB). Peak memory consumption was 44.0MB. Max. memory is 16.1GB. [2022-11-25 17:14:24,120 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.37ms. Allocated memory is still 96.5MB. Free memory is still 70.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 607.52ms. Allocated memory is still 130.0MB. Free memory was 87.1MB in the beginning and 98.2MB in the end (delta: -11.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.63ms. Allocated memory is still 130.0MB. Free memory was 98.2MB in the beginning and 95.3MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.56ms. Allocated memory is still 130.0MB. Free memory was 95.3MB in the beginning and 93.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1012.47ms. Allocated memory is still 130.0MB. Free memory was 92.8MB in the beginning and 62.9MB in the end (delta: 29.8MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 335862.12ms. Allocated memory was 130.0MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 62.5MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 951.7MB. Max. memory is 16.1GB. * Witness Printer took 326.97ms. Allocated memory is still 2.3GB. Free memory was 1.2GB in the beginning and 1.2GB in the end (delta: 43.9MB). Peak memory consumption was 44.0MB. 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: 535]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] msg_t nomsg = (msg_t )-1; [L24] port_t g1v ; [L25] int8_t g1v_old ; [L26] int8_t g1v_new ; [L27] port_t g2v ; [L28] int8_t g2v_old ; [L29] int8_t g2v_new ; [L30] port_t g3v ; [L31] int8_t g3v_old ; [L32] int8_t g3v_new ; [L36] _Bool gate1Failed ; [L37] _Bool gate2Failed ; [L38] _Bool gate3Failed ; [L39] msg_t VALUE1 ; [L40] msg_t VALUE2 ; [L41] msg_t VALUE3 ; [L43] _Bool gate1Failed_History_0 ; [L44] _Bool gate1Failed_History_1 ; [L45] _Bool gate1Failed_History_2 ; [L46] _Bool gate2Failed_History_0 ; [L47] _Bool gate2Failed_History_1 ; [L48] _Bool gate2Failed_History_2 ; [L49] _Bool gate3Failed_History_0 ; [L50] _Bool gate3Failed_History_1 ; [L51] _Bool gate3Failed_History_2 ; [L52] int8_t votedValue_History_0 ; [L53] int8_t votedValue_History_1 ; [L54] int8_t votedValue_History_2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=0, gate1Failed_History_2=0, gate2Failed=0, gate2Failed_History_0=0, gate2Failed_History_1=0, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=0, votedValue_History_1=0, votedValue_History_2=0] [L476] int c1 ; [L477] int i2 ; [L480] c1 = 0 [L481] gate1Failed = __VERIFIER_nondet_bool() [L482] gate2Failed = __VERIFIER_nondet_bool() [L483] gate3Failed = __VERIFIER_nondet_bool() [L484] VALUE1 = __VERIFIER_nondet_char() [L485] VALUE2 = __VERIFIER_nondet_char() [L486] VALUE3 = __VERIFIER_nondet_char() [L487] gate1Failed_History_0 = __VERIFIER_nondet_bool() [L488] gate1Failed_History_1 = __VERIFIER_nondet_bool() [L489] gate1Failed_History_2 = __VERIFIER_nondet_bool() [L490] gate2Failed_History_0 = __VERIFIER_nondet_bool() [L491] gate2Failed_History_1 = __VERIFIER_nondet_bool() [L492] gate2Failed_History_2 = __VERIFIER_nondet_bool() [L493] gate3Failed_History_0 = __VERIFIER_nondet_bool() [L494] gate3Failed_History_1 = __VERIFIER_nondet_bool() [L495] gate3Failed_History_2 = __VERIFIER_nondet_bool() [L496] votedValue_History_0 = __VERIFIER_nondet_char() [L497] votedValue_History_1 = __VERIFIER_nondet_char() [L498] votedValue_History_2 = __VERIFIER_nondet_char() [L499] CALL, EXPR init() [L203] int tmp ; [L204] int tmp___0 ; [L205] int tmp___1 ; [L206] int tmp___2 ; VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] CALL, EXPR add_history_type(0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND TRUE history_id == 0 VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] CALL, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L127] COND TRUE historyIndex == 0 [L128] return (gate1Failed_History_0); VAL [\old(history_id)=0, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] RET, EXPR read_history_bool(0, 0) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(0, 0)=0, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L73] tmp = (int )read_history_bool(0, 0) [L74] COND FALSE !(! (tmp == (int )ini_bool)) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=0, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=0, ini_bool=0, ini_int=-2, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] RET, EXPR add_history_type(0) VAL [add_history_type(0)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L209] tmp = add_history_type(0) [L210] COND FALSE !(! tmp) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] CALL, EXPR add_history_type(1) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND TRUE history_id == 1 VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] CALL, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L137] COND TRUE historyIndex == 0 [L138] return (gate2Failed_History_0); VAL [\old(history_id)=1, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] RET, EXPR read_history_bool(1, 0) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(1, 0)=0, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L79] tmp___0 = (int )read_history_bool(1, 0) [L80] COND FALSE !(! (tmp___0 == (int )ini_bool)) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=1, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=1, ini_bool=0, ini_int=-2, nomsg=-1, tmp___0=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] RET, EXPR add_history_type(1) VAL [add_history_type(1)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L213] tmp___0 = add_history_type(1) [L214] COND FALSE !(! tmp___0) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] CALL, EXPR add_history_type(2) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND TRUE history_id == 2 VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] CALL, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L147] COND TRUE historyIndex == 0 [L148] return (gate3Failed_History_0); VAL [\old(history_id)=2, \old(historyIndex)=0, \result=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] RET, EXPR read_history_bool(2, 0) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, read_history_bool(2, 0)=0, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L85] tmp___1 = (int )read_history_bool(2, 0) [L86] COND FALSE !(! (tmp___1 == (int )ini_bool)) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=2, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=2, ini_bool=0, ini_int=-2, nomsg=-1, tmp___1=0, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] RET, EXPR add_history_type(2) VAL [add_history_type(2)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L217] tmp___1 = add_history_type(2) [L218] COND FALSE !(! tmp___1) VAL [g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] CALL, EXPR add_history_type(3) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L59] _Bool ini_bool ; [L60] int8_t ini_int ; [L61] int var ; [L62] int tmp ; [L63] int tmp___0 ; [L64] int tmp___1 ; [L65] int tmp___2 ; [L68] ini_bool = (_Bool)0 [L69] ini_int = (int8_t )-2 [L70] var = 0 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND TRUE var < 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L72] COND FALSE !(history_id == 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L78] COND FALSE !(history_id == 1) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L84] COND FALSE !(history_id == 2) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L90] COND TRUE history_id == 3 VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-2, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] RET, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, read_history_int8(3, 0)=-2, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L91] tmp___2 = (int )read_history_int8(3, 0) [L92] COND FALSE !(! (tmp___2 == (int )ini_int)) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=2, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L96] var ++ VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L71] COND FALSE !(var < 3) VAL [\old(history_id)=3, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L98] return (1); VAL [\old(history_id)=3, \result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, history_id=3, ini_bool=0, ini_int=-2, nomsg=-1, tmp___2=-2, VALUE1=0, VALUE2=0, VALUE3=0, var=3, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] RET, EXPR add_history_type(3) VAL [add_history_type(3)=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L221] tmp___2 = add_history_type(3) [L222] COND FALSE !(! tmp___2) [L225] return (1); VAL [\result=1, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, nomsg=-1, tmp=1, tmp___0=1, tmp___1=1, tmp___2=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L499] RET, EXPR init() [L499] i2 = init() [L500] COND FALSE !(!(i2)) VAL [c1=0, g1v=0, g1v_new=0, g1v_old=0, g2v=0, g2v_new=0, g2v_old=0, g3v=0, g3v_new=0, g3v_old=0, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L501] g1v_old = nomsg [L502] g1v_new = nomsg [L503] g2v_old = nomsg [L504] g2v_new = nomsg [L505] g3v_old = nomsg [L506] g3v_new = nomsg [L507] i2 = 0 VAL [c1=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed_History_0=0, gate2Failed_History_0=0, gate3Failed_History_0=0, i2=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L508] COND TRUE i2 < 10 [L510] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=7, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=4, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=6, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=0, gate1Failed_History_1=7, gate1Failed_History_2=2, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=7, \old(gate1Failed_History_2)=2, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=4, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=6, \old(history_id)=0, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, history_id=0, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L344] RET write_history_bool(0, gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L345] COND TRUE \read(gate1Failed) [L346] g1v_new = nomsg != nomsg && g1v_new == nomsg ? nomsg : g1v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L510] RET gate1_each_pals_period() [L511] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=4, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=6, \old(history_id)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=4, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=6, \old(history_id)=1, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=0, gate2Failed_History_1=4, gate2Failed_History_2=5, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=0, \old(gate2Failed_History_1)=4, \old(gate2Failed_History_2)=5, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=6, \old(history_id)=1, buf=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, history_id=1, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L375] RET write_history_bool(1, gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L376] COND TRUE \read(gate2Failed) [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L511] RET gate2_each_pals_period() [L512] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=6, \old(history_id)=2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=6, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L186] COND FALSE !(history_id == 1) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=6, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=3, gate3Failed_History_2=6, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=3, \old(gate3Failed_History_2)=6, \old(history_id)=2, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=2, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L406] RET write_history_bool(2, gate3Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L407] COND FALSE !(\read(gate3Failed)) [L411] tmp = __VERIFIER_nondet_char() [L412] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, next_state=0, nomsg=-1, tmp=0, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L413] COND TRUE (int )next_state == 0 [L414] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L424] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L425] g3v_new = next_state != nomsg && g3v_new == nomsg ? next_state : g3v_new VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=0, VALUE2=0, VALUE3=0, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L512] RET gate3_each_pals_period() [L513] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] voted_value = VALUE1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, voted_value=-1, votedValue_History_0=-2, votedValue_History_1=0, votedValue_History_2=0] [L470] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [\old(buf)=-1, \old(history_id)=3, buf=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=0, g3v_old=-1, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L470] RET write_history_int8(3, voted_value) [L513] RET voter() [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L520] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L249] COND FALSE !(! gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L252] COND FALSE !(! gate2Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L255] COND TRUE ! gate3Failed [L256] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L260] COND FALSE !(!((_Bool )tmp)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L127] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, read_history_bool(0, 1)=0, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND TRUE ! tmp___3 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, tmp=1, tmp___3=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] CALL, EXPR read_history_bool(1, 1) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L137] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L140] COND TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [\old(history_id)=1, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] RET, EXPR read_history_bool(1, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, read_history_bool(1, 1)=0, tmp=1, tmp___3=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L263] tmp___4 = read_history_bool(1, 1) [L264] COND TRUE ! tmp___4 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, tmp=1, tmp___3=0, tmp___4=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] CALL, EXPR read_history_bool(2, 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L147] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L150] COND TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [\old(history_id)=2, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] RET, EXPR read_history_bool(2, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, read_history_bool(2, 1)=0, tmp=1, tmp___3=0, tmp___4=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L265] tmp___5 = read_history_bool(2, 1) [L266] COND TRUE ! tmp___5 [L267] temp_count = 0 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=0, tmp=1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L268] tmp___0 = read_history_int8(3, 0) [L269] COND TRUE (int )VALUE1 == (int )tmp___0 [L270] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=1, tmp=1, tmp___0=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L272] tmp___1 = read_history_int8(3, 0) [L273] COND TRUE (int )VALUE2 == (int )tmp___1 [L274] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=2, tmp=1, tmp___0=-1, tmp___1=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L276] tmp___2 = read_history_int8(3, 0) [L277] COND TRUE (int )VALUE3 == (int )tmp___2 [L278] temp_count ++ VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L280] COND FALSE !((int )VALUE1 != (int )VALUE2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L294] COND FALSE !(! (temp_count > 1)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] CALL, EXPR read_history_int8(3, 1) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L110] COND TRUE historyIndex == 1 [L111] return (votedValue_History_1); VAL [\old(history_id)=3, \old(historyIndex)=1, \result=-2, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] RET, EXPR read_history_int8(3, 1) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, read_history_int8(3, 1)=-2, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND FALSE !((int )tmp___10 > -2) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, read_history_int8(3, 0)=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L320] tmp___11 = read_history_int8(3, 0) [L321] COND FALSE !((int )tmp___11 != (int )nomsg) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___11=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L333] return (1); VAL [\result=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, temp_count=3, tmp=1, tmp___0=-1, tmp___1=-1, tmp___10=-2, tmp___11=-1, tmp___2=-1, tmp___3=0, tmp___4=0, tmp___5=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L520] RET, EXPR check() [L520] c1 = check() [L521] CALL assert(c1) VAL [\old(arg)=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L533] COND FALSE !(! arg) VAL [\old(arg)=1, arg=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L521] RET assert(c1) VAL [c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, i2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L522] i2 ++ VAL [c1=1, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=1, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, i2=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L508] COND TRUE i2 < 10 [L510] CALL gate1_each_pals_period() [L338] int8_t next_state ; [L339] msg_t tmp ; [L340] int tmp___0 ; [L343] gate1Failed = __VERIFIER_nondet_bool() [L344] CALL write_history_bool(0, gate1Failed) VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=1, gate1Failed_History_1=0, gate1Failed_History_2=7, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND TRUE history_id == 0 [L182] gate1Failed_History_2 = gate1Failed_History_1 [L183] gate1Failed_History_1 = gate1Failed_History_0 [L184] gate1Failed_History_0 = buf VAL [\old(buf)=0, \old(gate1Failed_History_0)=1, \old(gate1Failed_History_1)=0, \old(gate1Failed_History_2)=7, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=0, buf=0, g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L344] RET write_history_bool(0, gate1Failed) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L345] COND FALSE !(\read(gate1Failed)) [L349] tmp = __VERIFIER_nondet_char() [L350] next_state = tmp VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, next_state=0, nomsg=-1, tmp=0, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L351] COND TRUE (int )next_state == 0 [L352] tmp___0 = 1 VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L362] COND FALSE !(!((_Bool )tmp___0)) VAL [g1v=0, g1v_new=-1, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L363] g1v_new = next_state != nomsg && g1v_new == nomsg ? next_state : g1v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, next_state=0, nomsg=-1, tmp=0, tmp___0=1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L510] RET gate1_each_pals_period() [L511] CALL gate2_each_pals_period() [L369] int8_t next_state ; [L370] msg_t tmp ; [L371] int tmp___0 ; [L374] gate2Failed = __VERIFIER_nondet_bool() [L375] CALL write_history_bool(1, gate2Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=0, gate2Failed_History_2=4, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] COND TRUE history_id == 1 [L187] gate2Failed_History_2 = gate2Failed_History_1 [L188] gate2Failed_History_1 = gate2Failed_History_0 [L189] gate2Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=0, \old(gate2Failed_History_2)=4, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=1, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L375] RET write_history_bool(1, gate2Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L376] COND TRUE \read(gate2Failed) [L377] g2v_new = nomsg != nomsg && g2v_new == nomsg ? nomsg : g2v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=0, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L511] RET gate2_each_pals_period() [L512] CALL gate3_each_pals_period() [L400] int8_t next_state ; [L401] msg_t tmp ; [L402] int tmp___0 ; [L405] gate3Failed = __VERIFIER_nondet_bool() [L406] CALL write_history_bool(2, gate3Failed) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=2, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L181] COND FALSE !(history_id == 0) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L186] COND FALSE !(history_id == 1) VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=0, gate3Failed_History_1=0, gate3Failed_History_2=3, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L191] COND TRUE history_id == 2 [L192] gate3Failed_History_2 = gate3Failed_History_1 [L193] gate3Failed_History_1 = gate3Failed_History_0 [L194] gate3Failed_History_0 = buf VAL [\old(buf)=1, \old(gate1Failed_History_0)=0, \old(gate1Failed_History_1)=1, \old(gate1Failed_History_2)=0, \old(gate2Failed_History_0)=1, \old(gate2Failed_History_1)=1, \old(gate2Failed_History_2)=0, \old(gate3Failed_History_0)=0, \old(gate3Failed_History_1)=0, \old(gate3Failed_History_2)=3, \old(history_id)=2, buf=1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L406] RET write_history_bool(2, gate3Failed) VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L407] COND TRUE \read(gate3Failed) [L408] g3v_new = nomsg != nomsg && g3v_new == nomsg ? nomsg : g3v_new VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=0, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L512] RET gate3_each_pals_period() [L513] CALL voter() [L431] int8_t voted_value ; [L434] voted_value = nomsg [L435] VALUE1 = g1v_old [L436] g1v_old = nomsg [L437] VALUE2 = g2v_old [L438] g2v_old = nomsg [L439] VALUE3 = g3v_old [L440] g3v_old = nomsg VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L441] COND TRUE (int )VALUE1 == (int )VALUE2 [L442] voted_value = VALUE1 VAL [g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, voted_value=-1, votedValue_History_0=-1, votedValue_History_1=-2, votedValue_History_2=0] [L470] CALL write_history_int8(3, voted_value) [L166] COND TRUE history_id == 3 [L167] votedValue_History_2 = votedValue_History_1 [L168] votedValue_History_1 = votedValue_History_0 [L169] votedValue_History_0 = buf VAL [\old(buf)=-1, \old(history_id)=3, buf=-1, g1v=0, g1v_new=0, g1v_old=-1, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L470] RET write_history_int8(3, voted_value) [L513] RET voter() [L514] g1v_old = g1v_new [L515] g1v_new = nomsg [L516] g2v_old = g2v_new [L517] g2v_new = nomsg [L518] g3v_old = g3v_new [L519] g3v_new = nomsg [L520] CALL, EXPR check() [L230] int tmp ; [L231] int temp_count ; [L232] int8_t tmp___0 ; [L233] int8_t tmp___1 ; [L234] int8_t tmp___2 ; [L235] _Bool tmp___3 ; [L236] _Bool tmp___4 ; [L237] _Bool tmp___5 ; [L238] int8_t tmp___6 ; [L239] _Bool tmp___7 ; [L240] _Bool tmp___8 ; [L241] _Bool tmp___9 ; [L242] int8_t tmp___10 ; [L243] int8_t tmp___11 ; [L244] int8_t tmp___12 ; [L245] int8_t tmp___13 ; [L246] int8_t tmp___14 ; VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L249] COND TRUE ! gate1Failed [L250] tmp = 1 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L260] COND FALSE !(!((_Bool )tmp)) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L127] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=-511, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(0, 1)=-511, tmp=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L261] tmp___3 = read_history_bool(0, 1) [L262] COND FALSE !(! tmp___3) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] CALL, EXPR read_history_int8(3, 1) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=3, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L110] COND TRUE historyIndex == 1 [L111] return (votedValue_History_1); VAL [\old(history_id)=3, \old(historyIndex)=1, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] RET, EXPR read_history_int8(3, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 1)=-1, tmp=1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L300] tmp___10 = read_history_int8(3, 1) [L301] COND TRUE (int )tmp___10 > -2 VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] CALL, EXPR read_history_int8(3, 0) VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L106] COND TRUE history_id == 3 VAL [\old(history_id)=3, \old(historyIndex)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L107] COND TRUE historyIndex == 0 [L108] return (votedValue_History_0); VAL [\old(history_id)=3, \old(historyIndex)=0, \result=-1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=3, historyIndex=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] RET, EXPR read_history_int8(3, 0) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_int8(3, 0)=-1, tmp=1, tmp___10=-1, tmp___3=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L302] tmp___6 = read_history_int8(3, 0) [L303] COND TRUE (int )tmp___6 == (int )nomsg VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] CALL, EXPR read_history_bool(0, 1) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND TRUE history_id == 0 VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L127] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=0, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L130] COND TRUE historyIndex == 1 [L131] return (gate1Failed_History_1); VAL [\old(history_id)=0, \old(historyIndex)=1, \result=-511, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=0, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] RET, EXPR read_history_bool(0, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(0, 1)=-511, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L304] tmp___7 = read_history_bool(0, 1) [L305] COND TRUE \read(tmp___7) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] CALL, EXPR read_history_bool(1, 1) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND TRUE history_id == 1 VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L137] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=1, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L140] COND TRUE historyIndex == 1 [L141] return (gate2Failed_History_1); VAL [\old(history_id)=1, \old(historyIndex)=1, \result=-255, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=1, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] RET, EXPR read_history_bool(1, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(1, 1)=-255, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L306] tmp___8 = read_history_bool(1, 1) [L307] COND TRUE \read(tmp___8) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] CALL, EXPR read_history_bool(2, 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L126] COND FALSE !(history_id == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L136] COND FALSE !(history_id == 1) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L146] COND TRUE history_id == 2 VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L147] COND FALSE !(historyIndex == 0) VAL [\old(history_id)=2, \old(historyIndex)=1, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L150] COND TRUE historyIndex == 1 [L151] return (gate3Failed_History_1); VAL [\old(history_id)=2, \old(historyIndex)=1, \result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, history_id=2, historyIndex=1, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] RET, EXPR read_history_bool(2, 1) VAL [g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, read_history_bool(2, 1)=0, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L308] tmp___9 = read_history_bool(2, 1) [L309] COND TRUE ! tmp___9 [L310] return (0); VAL [\result=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, tmp=1, tmp___10=-1, tmp___3=1, tmp___6=-1, tmp___7=1, tmp___8=1, tmp___9=0, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L520] RET, EXPR check() [L520] c1 = check() [L521] CALL assert(c1) VAL [\old(arg)=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L533] COND TRUE ! arg VAL [\old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] [L535] reach_error() VAL [\old(arg)=0, arg=0, g1v=0, g1v_new=-1, g1v_old=0, g2v=0, g2v_new=-1, g2v_old=-1, g3v=0, g3v_new=-1, g3v_old=-1, gate1Failed=0, gate1Failed_History_0=0, gate1Failed_History_1=1, gate1Failed_History_2=0, gate2Failed=1, gate2Failed_History_0=1, gate2Failed_History_1=1, gate2Failed_History_2=0, gate3Failed=1, gate3Failed_History_0=1, gate3Failed_History_1=0, gate3Failed_History_2=0, nomsg=-1, VALUE1=-1, VALUE2=-1, VALUE3=0, votedValue_History_0=-1, votedValue_History_1=-1, votedValue_History_2=-2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 175 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 335.4s, OverallIterations: 50, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 256.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 32637 SdHoareTripleChecker+Valid, 105.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 32207 mSDsluCounter, 145736 SdHoareTripleChecker+Invalid, 92.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 129822 mSDsCounter, 18653 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122563 IncrementalHoareTripleChecker+Invalid, 141216 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18653 mSolverCounterUnsat, 15914 mSDtfsCounter, 122563 mSolverCounterSat, 1.8s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13053 GetRequests, 10965 SyntacticMatches, 24 SemanticMatches, 2064 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314499 ImplicationChecksByTransitivity, 123.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5495occurred in iteration=42, InterpolantAutomatonStates: 1825, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 18.6s AutomataMinimizationTime, 49 MinimizatonAttempts, 56109 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.4s SsaConstructionTime, 4.5s SatisfiabilityAnalysisTime, 46.7s InterpolantComputationTime, 17572 NumberOfCodeBlocks, 17572 NumberOfCodeBlocksAsserted, 71 NumberOfCheckSat, 20081 ConstructedInterpolants, 2 QuantifiedInterpolants, 49416 SizeOfPredicates, 79 NumberOfNonLiveVariables, 21496 ConjunctsInSsa, 417 ConjunctsInUnsatCore, 80 InterpolantComputations, 40 PerfectInterpolantSequences, 49283/51947 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-25 17:14:24,178 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_8156bb75-b902-4692-8811-6c69a6ebe05c/bin/uautomizer-ZsLfNo2U6R/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