./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 e04fb08f 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_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/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_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8 --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-e04fb08 [2022-11-16 11:05:59,627 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:05:59,629 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:05:59,655 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:05:59,655 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:05:59,657 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:05:59,662 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:05:59,672 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:05:59,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:05:59,684 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:05:59,686 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:05:59,688 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:05:59,689 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:05:59,693 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:05:59,695 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:05:59,697 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:05:59,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:05:59,702 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:05:59,704 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:05:59,708 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:05:59,712 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:05:59,714 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:05:59,719 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:05:59,720 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:05:59,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:05:59,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:05:59,728 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:05:59,729 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:05:59,730 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:05:59,731 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:05:59,731 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:05:59,732 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:05:59,733 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:05:59,734 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:05:59,743 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:05:59,744 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:05:59,745 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:05:59,745 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:05:59,746 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:05:59,747 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:05:59,748 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:05:59,749 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-16 11:05:59,802 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:05:59,803 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:05:59,804 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:05:59,804 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:05:59,806 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:05:59,806 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:05:59,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:05:59,808 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:05:59,808 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:05:59,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:05:59,810 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:05:59,810 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:05:59,810 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:05:59,811 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:05:59,811 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:05:59,811 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:05:59,811 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:05:59,812 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:05:59,812 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:05:59,812 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:05:59,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:05:59,813 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:05:59,813 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:05:59,813 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:05:59,814 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:05:59,814 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:05:59,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:05:59,816 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:05:59,816 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:05:59,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:05:59,817 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:05:59,817 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:05:59,817 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:05:59,818 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/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_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8 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-16 11:06:00,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:06:00,222 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:06:00,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:06:00,227 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:06:00,229 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:06:00,230 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2022-11-16 11:06:00,334 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/data/952729859/bce5aafd4184460aa348005d76cfb6e6/FLAGbd0e6d1ea [2022-11-16 11:06:01,083 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:06:01,083 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2022-11-16 11:06:01,102 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/data/952729859/bce5aafd4184460aa348005d76cfb6e6/FLAGbd0e6d1ea [2022-11-16 11:06:01,327 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/data/952729859/bce5aafd4184460aa348005d76cfb6e6 [2022-11-16 11:06:01,332 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:06:01,337 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:06:01,340 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:06:01,340 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:06:01,344 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:06:01,345 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:06:01" (1/1) ... [2022-11-16 11:06:01,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cbf7128 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:01, skipping insertion in model container [2022-11-16 11:06:01,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:06:01" (1/1) ... [2022-11-16 11:06:01,358 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:06:01,422 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:06:01,883 WARN L229 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_ad050862-673a-4958-a4bf-bd3ec563dae3/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2022-11-16 11:06:01,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:06:01,901 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:06:02,022 WARN L229 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_ad050862-673a-4958-a4bf-bd3ec563dae3/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c[11956,11969] [2022-11-16 11:06:02,023 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:06:02,051 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:06:02,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:02 WrapperNode [2022-11-16 11:06:02,052 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:06:02,053 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:06:02,053 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:06:02,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:06:02,064 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:02" (1/1) ... [2022-11-16 11:06:02,077 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:02" (1/1) ... [2022-11-16 11:06:02,121 INFO L138 Inliner]: procedures = 27, calls = 46, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 389 [2022-11-16 11:06:02,122 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:06:02,123 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:06:02,123 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:06:02,123 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:06:02,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:02" (1/1) ... [2022-11-16 11:06:02,135 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:02" (1/1) ... [2022-11-16 11:06:02,140 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:02" (1/1) ... [2022-11-16 11:06:02,140 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:02" (1/1) ... [2022-11-16 11:06:02,151 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:02" (1/1) ... [2022-11-16 11:06:02,160 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:02" (1/1) ... [2022-11-16 11:06:02,163 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:02" (1/1) ... [2022-11-16 11:06:02,165 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:02" (1/1) ... [2022-11-16 11:06:02,171 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:06:02,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:06:02,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:06:02,172 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:06:02,173 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:02" (1/1) ... [2022-11-16 11:06:02,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:06:02,199 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:06:02,215 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:06:02,225 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:06:02,279 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:06:02,279 INFO L130 BoogieDeclarations]: Found specification of procedure write_history_bool [2022-11-16 11:06:02,279 INFO L138 BoogieDeclarations]: Found implementation of procedure write_history_bool [2022-11-16 11:06:02,279 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-11-16 11:06:02,280 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-11-16 11:06:02,280 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_int8 [2022-11-16 11:06:02,282 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_int8 [2022-11-16 11:06:02,283 INFO L130 BoogieDeclarations]: Found specification of procedure read_history_bool [2022-11-16 11:06:02,284 INFO L138 BoogieDeclarations]: Found implementation of procedure read_history_bool [2022-11-16 11:06:02,285 INFO L130 BoogieDeclarations]: Found specification of procedure add_history_type [2022-11-16 11:06:02,285 INFO L138 BoogieDeclarations]: Found implementation of procedure add_history_type [2022-11-16 11:06:02,285 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:06:02,285 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:06:02,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:06:02,478 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:06:02,481 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:06:03,269 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:06:03,280 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:06:03,280 INFO L300 CfgBuilder]: Removed 2 assume(true) statements. [2022-11-16 11:06:03,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:06:03 BoogieIcfgContainer [2022-11-16 11:06:03,284 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:06:03,288 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:06:03,288 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:06:03,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:06:03,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:06:01" (1/3) ... [2022-11-16 11:06:03,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a2ad82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:06:03, skipping insertion in model container [2022-11-16 11:06:03,300 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:06:02" (2/3) ... [2022-11-16 11:06:03,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33a2ad82 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:06:03, skipping insertion in model container [2022-11-16 11:06:03,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:06:03" (3/3) ... [2022-11-16 11:06:03,303 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_Triplicated.1.ufo.BOUNDED-10.pals.c [2022-11-16 11:06:03,329 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:06:03,329 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:06:03,423 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:06:03,431 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;@3d2c8256, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:06:03,432 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:06:03,442 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-16 11:06:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 11:06:03,453 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:03,454 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:06:03,455 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:03,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:03,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1581125196, now seen corresponding path program 1 times [2022-11-16 11:06:03,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:03,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913155898] [2022-11-16 11:06:03,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:03,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:03,875 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-16 11:06:03,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:03,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913155898] [2022-11-16 11:06:03,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913155898] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:03,878 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:03,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:06:03,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347685783] [2022-11-16 11:06:03,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:03,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:03,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:03,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:03,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:06:03,942 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-16 11:06:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:04,116 INFO L93 Difference]: Finished difference Result 355 states and 607 transitions. [2022-11-16 11:06:04,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:04,125 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-16 11:06:04,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:04,146 INFO L225 Difference]: With dead ends: 355 [2022-11-16 11:06:04,152 INFO L226 Difference]: Without dead ends: 179 [2022-11-16 11:06:04,161 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-16 11:06:04,169 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-16 11:06:04,171 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-16 11:06:04,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-11-16 11:06:04,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2022-11-16 11:06:04,273 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-16 11:06:04,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 277 transitions. [2022-11-16 11:06:04,285 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 277 transitions. Word has length 15 [2022-11-16 11:06:04,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:04,285 INFO L495 AbstractCegarLoop]: Abstraction has 177 states and 277 transitions. [2022-11-16 11:06:04,285 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-16 11:06:04,286 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 277 transitions. [2022-11-16 11:06:04,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:06:04,288 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:04,307 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:06:04,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:06:04,308 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:04,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:04,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1712914003, now seen corresponding path program 1 times [2022-11-16 11:06:04,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:04,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729374999] [2022-11-16 11:06:04,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:04,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:04,437 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-16 11:06:04,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:04,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729374999] [2022-11-16 11:06:04,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729374999] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:04,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:04,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:06:04,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519580402] [2022-11-16 11:06:04,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:04,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:04,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:04,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:04,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:06:04,443 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-16 11:06:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:04,536 INFO L93 Difference]: Finished difference Result 367 states and 577 transitions. [2022-11-16 11:06:04,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:04,537 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-16 11:06:04,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:04,541 INFO L225 Difference]: With dead ends: 367 [2022-11-16 11:06:04,541 INFO L226 Difference]: Without dead ends: 193 [2022-11-16 11:06:04,543 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-16 11:06:04,545 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.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:06:04,546 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.0s Time] [2022-11-16 11:06:04,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2022-11-16 11:06:04,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 190. [2022-11-16 11:06:04,576 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-16 11:06:04,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 293 transitions. [2022-11-16 11:06:04,592 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 293 transitions. Word has length 16 [2022-11-16 11:06:04,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:04,593 INFO L495 AbstractCegarLoop]: Abstraction has 190 states and 293 transitions. [2022-11-16 11:06:04,593 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-16 11:06:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 293 transitions. [2022-11-16 11:06:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 11:06:04,596 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:04,596 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-16 11:06:04,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:06:04,597 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:04,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:04,598 INFO L85 PathProgramCache]: Analyzing trace with hash -218612603, now seen corresponding path program 1 times [2022-11-16 11:06:04,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:04,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528097449] [2022-11-16 11:06:04,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:04,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:04,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:04,796 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-16 11:06:04,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:04,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528097449] [2022-11-16 11:06:04,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528097449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:04,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:04,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:06:04,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920813936] [2022-11-16 11:06:04,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:04,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 11:06:04,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:04,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:06:04,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:06:04,801 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-16 11:06:04,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:04,845 INFO L93 Difference]: Finished difference Result 399 states and 623 transitions. [2022-11-16 11:06:04,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:06:04,846 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-16 11:06:04,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:04,849 INFO L225 Difference]: With dead ends: 399 [2022-11-16 11:06:04,850 INFO L226 Difference]: Without dead ends: 219 [2022-11-16 11:06:04,851 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-16 11:06:04,853 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-16 11:06:04,854 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-16 11:06:04,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-11-16 11:06:04,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 192. [2022-11-16 11:06:04,879 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-16 11:06:04,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 295 transitions. [2022-11-16 11:06:04,883 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 295 transitions. Word has length 23 [2022-11-16 11:06:04,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:04,883 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 295 transitions. [2022-11-16 11:06:04,883 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-16 11:06:04,884 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 295 transitions. [2022-11-16 11:06:04,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-16 11:06:04,886 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:04,886 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-16 11:06:04,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:06:04,887 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:04,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:04,888 INFO L85 PathProgramCache]: Analyzing trace with hash 805469494, now seen corresponding path program 1 times [2022-11-16 11:06:04,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:04,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559378849] [2022-11-16 11:06:04,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:04,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:04,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:04,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:04,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:04,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:05,003 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-16 11:06:05,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:05,004 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559378849] [2022-11-16 11:06:05,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559378849] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:05,005 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:05,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:06:05,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5163081] [2022-11-16 11:06:05,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:05,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:05,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:05,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:05,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:06:05,008 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-16 11:06:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:05,084 INFO L93 Difference]: Finished difference Result 430 states and 678 transitions. [2022-11-16 11:06:05,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:05,085 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-16 11:06:05,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:05,088 INFO L225 Difference]: With dead ends: 430 [2022-11-16 11:06:05,089 INFO L226 Difference]: Without dead ends: 289 [2022-11-16 11:06:05,090 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-16 11:06:05,092 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-16 11:06:05,093 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-16 11:06:05,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-16 11:06:05,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 192. [2022-11-16 11:06:05,117 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-16 11:06:05,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 291 transitions. [2022-11-16 11:06:05,121 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 291 transitions. Word has length 31 [2022-11-16 11:06:05,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:05,122 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 291 transitions. [2022-11-16 11:06:05,122 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-16 11:06:05,122 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 291 transitions. [2022-11-16 11:06:05,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 11:06:05,124 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:05,124 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-16 11:06:05,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 11:06:05,125 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:05,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:05,126 INFO L85 PathProgramCache]: Analyzing trace with hash -956786536, now seen corresponding path program 1 times [2022-11-16 11:06:05,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:05,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104624929] [2022-11-16 11:06:05,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:05,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:05,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:05,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:05,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:05,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:05,312 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-16 11:06:05,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:05,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104624929] [2022-11-16 11:06:05,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104624929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:05,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:05,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:06:05,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391785772] [2022-11-16 11:06:05,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:05,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:06:05,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:05,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:06:05,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:06:05,316 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-16 11:06:05,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:05,399 INFO L93 Difference]: Finished difference Result 374 states and 571 transitions. [2022-11-16 11:06:05,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:05,400 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-16 11:06:05,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:05,407 INFO L225 Difference]: With dead ends: 374 [2022-11-16 11:06:05,407 INFO L226 Difference]: Without dead ends: 194 [2022-11-16 11:06:05,414 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-16 11:06:05,415 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-16 11:06:05,416 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-16 11:06:05,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-11-16 11:06:05,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2022-11-16 11:06:05,441 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-16 11:06:05,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 290 transitions. [2022-11-16 11:06:05,459 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 290 transitions. Word has length 32 [2022-11-16 11:06:05,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:05,460 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 290 transitions. [2022-11-16 11:06:05,460 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-16 11:06:05,460 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 290 transitions. [2022-11-16 11:06:05,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 11:06:05,462 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:05,462 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-16 11:06:05,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:06:05,463 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:05,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:05,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1412048612, now seen corresponding path program 1 times [2022-11-16 11:06:05,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:05,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039082949] [2022-11-16 11:06:05,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:05,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:05,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:05,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:05,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:05,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:05,574 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-16 11:06:05,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:05,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039082949] [2022-11-16 11:06:05,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039082949] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:06:05,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171973588] [2022-11-16 11:06:05,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:05,576 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:05,576 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:06:05,580 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:06:05,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:06:05,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:05,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:06:05,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:06:05,874 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-16 11:06:05,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:06:05,934 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-16 11:06:05,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171973588] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:06:05,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:06:05,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-11-16 11:06:05,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868347805] [2022-11-16 11:06:05,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:06:05,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:06:05,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:05,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:06:05,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:06:05,938 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-16 11:06:06,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:06,017 INFO L93 Difference]: Finished difference Result 432 states and 667 transitions. [2022-11-16 11:06:06,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:06,019 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-16 11:06:06,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:06,023 INFO L225 Difference]: With dead ends: 432 [2022-11-16 11:06:06,023 INFO L226 Difference]: Without dead ends: 251 [2022-11-16 11:06:06,030 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-16 11:06:06,037 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 66 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:06:06,041 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 1043 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:06:06,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-11-16 11:06:06,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 245. [2022-11-16 11:06:06,068 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-16 11:06:06,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 369 transitions. [2022-11-16 11:06:06,072 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 369 transitions. Word has length 35 [2022-11-16 11:06:06,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:06,073 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 369 transitions. [2022-11-16 11:06:06,073 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-16 11:06:06,073 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 369 transitions. [2022-11-16 11:06:06,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 11:06:06,075 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:06,076 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-16 11:06:06,090 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-16 11:06:06,283 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 11:06:06,284 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:06,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:06,284 INFO L85 PathProgramCache]: Analyzing trace with hash 1166895868, now seen corresponding path program 2 times [2022-11-16 11:06:06,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:06,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910859628] [2022-11-16 11:06:06,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:06,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:06,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:06,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:06,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:06,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:06,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:06,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:06,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:06,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:06,442 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-16 11:06:06,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:06,446 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910859628] [2022-11-16 11:06:06,446 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910859628] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:06,446 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:06,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:06:06,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98639235] [2022-11-16 11:06:06,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:06,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:06,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:06,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:06,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:06:06,451 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-16 11:06:06,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:06,548 INFO L93 Difference]: Finished difference Result 470 states and 728 transitions. [2022-11-16 11:06:06,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:06,549 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-16 11:06:06,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:06,552 INFO L225 Difference]: With dead ends: 470 [2022-11-16 11:06:06,552 INFO L226 Difference]: Without dead ends: 254 [2022-11-16 11:06:06,554 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-16 11:06:06,555 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:06:06,555 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.1s Time] [2022-11-16 11:06:06,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-11-16 11:06:06,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2022-11-16 11:06:06,582 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-16 11:06:06,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 377 transitions. [2022-11-16 11:06:06,586 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 377 transitions. Word has length 57 [2022-11-16 11:06:06,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:06,587 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 377 transitions. [2022-11-16 11:06:06,587 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-16 11:06:06,587 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 377 transitions. [2022-11-16 11:06:06,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 11:06:06,589 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:06,589 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-16 11:06:06,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:06:06,590 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:06,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:06,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1021652299, now seen corresponding path program 1 times [2022-11-16 11:06:06,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:06,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915263867] [2022-11-16 11:06:06,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:06,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:06,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:06,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:06,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:06,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:06,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:06,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:06,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:06,739 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-16 11:06:06,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:06,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915263867] [2022-11-16 11:06:06,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915263867] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:06,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:06,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:06:06,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122477057] [2022-11-16 11:06:06,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:06,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:06,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:06,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:06,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:06:06,743 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-16 11:06:06,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:06,813 INFO L93 Difference]: Finished difference Result 514 states and 780 transitions. [2022-11-16 11:06:06,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:06,815 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-16 11:06:06,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:06,821 INFO L225 Difference]: With dead ends: 514 [2022-11-16 11:06:06,821 INFO L226 Difference]: Without dead ends: 291 [2022-11-16 11:06:06,823 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-16 11:06:06,824 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-16 11:06:06,826 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-16 11:06:06,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-11-16 11:06:06,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 288. [2022-11-16 11:06:06,866 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-16 11:06:06,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 420 transitions. [2022-11-16 11:06:06,871 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 420 transitions. Word has length 57 [2022-11-16 11:06:06,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:06,875 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 420 transitions. [2022-11-16 11:06:06,875 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-16 11:06:06,875 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 420 transitions. [2022-11-16 11:06:06,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-16 11:06:06,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:06,879 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-16 11:06:06,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 11:06:06,879 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:06,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:06,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1670828143, now seen corresponding path program 1 times [2022-11-16 11:06:06,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:06,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124851376] [2022-11-16 11:06:06,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:06,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:06,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:06,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:06,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:07,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:07,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:07,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,063 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-16 11:06:07,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:07,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124851376] [2022-11-16 11:06:07,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124851376] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:07,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:07,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:06:07,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430358123] [2022-11-16 11:06:07,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:07,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:06:07,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:07,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:06:07,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:06:07,068 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-16 11:06:07,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:07,109 INFO L93 Difference]: Finished difference Result 525 states and 779 transitions. [2022-11-16 11:06:07,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:07,110 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-16 11:06:07,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:07,113 INFO L225 Difference]: With dead ends: 525 [2022-11-16 11:06:07,113 INFO L226 Difference]: Without dead ends: 290 [2022-11-16 11:06:07,114 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-16 11:06:07,117 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-16 11:06:07,117 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-16 11:06:07,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2022-11-16 11:06:07,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2022-11-16 11:06:07,132 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-16 11:06:07,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 417 transitions. [2022-11-16 11:06:07,135 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 417 transitions. Word has length 75 [2022-11-16 11:06:07,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:07,136 INFO L495 AbstractCegarLoop]: Abstraction has 288 states and 417 transitions. [2022-11-16 11:06:07,136 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-16 11:06:07,136 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 417 transitions. [2022-11-16 11:06:07,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-11-16 11:06:07,137 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:07,138 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-16 11:06:07,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 11:06:07,138 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:07,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:07,139 INFO L85 PathProgramCache]: Analyzing trace with hash -1243330431, now seen corresponding path program 1 times [2022-11-16 11:06:07,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:07,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503029794] [2022-11-16 11:06:07,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:07,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:07,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:07,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:07,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:07,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:07,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:07,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,353 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-16 11:06:07,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:07,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503029794] [2022-11-16 11:06:07,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503029794] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:07,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:07,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:06:07,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187666595] [2022-11-16 11:06:07,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:07,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:07,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:07,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:07,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:06:07,356 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-16 11:06:07,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:07,426 INFO L93 Difference]: Finished difference Result 562 states and 835 transitions. [2022-11-16 11:06:07,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:07,427 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-16 11:06:07,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:07,430 INFO L225 Difference]: With dead ends: 562 [2022-11-16 11:06:07,431 INFO L226 Difference]: Without dead ends: 332 [2022-11-16 11:06:07,432 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-16 11:06:07,433 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-16 11:06:07,433 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-16 11:06:07,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2022-11-16 11:06:07,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 329. [2022-11-16 11:06:07,452 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-16 11:06:07,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 465 transitions. [2022-11-16 11:06:07,456 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 465 transitions. Word has length 104 [2022-11-16 11:06:07,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:07,456 INFO L495 AbstractCegarLoop]: Abstraction has 329 states and 465 transitions. [2022-11-16 11:06:07,457 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-16 11:06:07,457 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 465 transitions. [2022-11-16 11:06:07,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-16 11:06:07,458 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:07,459 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-16 11:06:07,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:06:07,459 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:07,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:07,460 INFO L85 PathProgramCache]: Analyzing trace with hash -712190712, now seen corresponding path program 1 times [2022-11-16 11:06:07,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:07,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606274010] [2022-11-16 11:06:07,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:07,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:07,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:07,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:07,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:07,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:07,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,643 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-16 11:06:07,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:07,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606274010] [2022-11-16 11:06:07,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606274010] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:07,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:07,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:06:07,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832011912] [2022-11-16 11:06:07,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:07,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:07,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:07,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:07,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:06:07,647 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-16 11:06:07,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:07,719 INFO L93 Difference]: Finished difference Result 588 states and 855 transitions. [2022-11-16 11:06:07,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:06:07,720 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-16 11:06:07,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:07,725 INFO L225 Difference]: With dead ends: 588 [2022-11-16 11:06:07,725 INFO L226 Difference]: Without dead ends: 323 [2022-11-16 11:06:07,727 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-16 11:06:07,727 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-16 11:06:07,728 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-16 11:06:07,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-11-16 11:06:07,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2022-11-16 11:06:07,756 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-16 11:06:07,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 451 transitions. [2022-11-16 11:06:07,760 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 451 transitions. Word has length 105 [2022-11-16 11:06:07,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:07,760 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 451 transitions. [2022-11-16 11:06:07,761 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-16 11:06:07,761 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 451 transitions. [2022-11-16 11:06:07,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-16 11:06:07,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:07,763 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-16 11:06:07,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 11:06:07,764 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:07,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:07,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1828942627, now seen corresponding path program 1 times [2022-11-16 11:06:07,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:07,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496324978] [2022-11-16 11:06:07,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:07,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:07,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:07,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:07,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:07,983 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-16 11:06:07,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:07,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496324978] [2022-11-16 11:06:07,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496324978] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:07,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:07,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:06:07,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290764734] [2022-11-16 11:06:07,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:07,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:06:07,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:07,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:06:07,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:06:07,986 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-16 11:06:08,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:08,030 INFO L93 Difference]: Finished difference Result 563 states and 804 transitions. [2022-11-16 11:06:08,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:08,031 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-16 11:06:08,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:08,034 INFO L225 Difference]: With dead ends: 563 [2022-11-16 11:06:08,034 INFO L226 Difference]: Without dead ends: 325 [2022-11-16 11:06:08,035 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-16 11:06:08,036 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-16 11:06:08,037 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-16 11:06:08,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2022-11-16 11:06:08,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2022-11-16 11:06:08,057 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-16 11:06:08,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 448 transitions. [2022-11-16 11:06:08,060 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 448 transitions. Word has length 124 [2022-11-16 11:06:08,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:08,062 INFO L495 AbstractCegarLoop]: Abstraction has 323 states and 448 transitions. [2022-11-16 11:06:08,063 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-16 11:06:08,063 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 448 transitions. [2022-11-16 11:06:08,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-16 11:06:08,070 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:08,071 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-16 11:06:08,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:06:08,071 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:08,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:08,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1531403375, now seen corresponding path program 1 times [2022-11-16 11:06:08,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:08,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968811128] [2022-11-16 11:06:08,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:08,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:08,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:08,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,287 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-16 11:06:08,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:08,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968811128] [2022-11-16 11:06:08,288 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968811128] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:08,288 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:08,288 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:06:08,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478467972] [2022-11-16 11:06:08,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:08,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:08,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:08,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:08,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:06:08,292 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-16 11:06:08,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:08,390 INFO L93 Difference]: Finished difference Result 526 states and 764 transitions. [2022-11-16 11:06:08,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:06:08,391 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-16 11:06:08,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:08,395 INFO L225 Difference]: With dead ends: 526 [2022-11-16 11:06:08,395 INFO L226 Difference]: Without dead ends: 321 [2022-11-16 11:06:08,396 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-16 11:06:08,398 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:06:08,399 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.1s Time] [2022-11-16 11:06:08,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-11-16 11:06:08,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2022-11-16 11:06:08,421 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-16 11:06:08,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 444 transitions. [2022-11-16 11:06:08,425 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 444 transitions. Word has length 157 [2022-11-16 11:06:08,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:08,426 INFO L495 AbstractCegarLoop]: Abstraction has 321 states and 444 transitions. [2022-11-16 11:06:08,426 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-16 11:06:08,426 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 444 transitions. [2022-11-16 11:06:08,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-11-16 11:06:08,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:08,430 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-16 11:06:08,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 11:06:08,430 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:08,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:08,431 INFO L85 PathProgramCache]: Analyzing trace with hash -124413893, now seen corresponding path program 1 times [2022-11-16 11:06:08,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:08,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175018027] [2022-11-16 11:06:08,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:08,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:08,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:08,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:08,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:08,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:08,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:08,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:08,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:08,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:08,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:08,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:08,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:08,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,662 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-16 11:06:08,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:08,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175018027] [2022-11-16 11:06:08,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175018027] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:08,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:08,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:06:08,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797728043] [2022-11-16 11:06:08,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:08,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:08,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:08,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:08,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:06:08,666 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-16 11:06:08,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:08,747 INFO L93 Difference]: Finished difference Result 466 states and 660 transitions. [2022-11-16 11:06:08,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:08,749 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-16 11:06:08,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:08,752 INFO L225 Difference]: With dead ends: 466 [2022-11-16 11:06:08,752 INFO L226 Difference]: Without dead ends: 304 [2022-11-16 11:06:08,753 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-16 11:06:08,754 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-16 11:06:08,754 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-16 11:06:08,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-11-16 11:06:08,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2022-11-16 11:06:08,772 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-16 11:06:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 417 transitions. [2022-11-16 11:06:08,776 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 417 transitions. Word has length 172 [2022-11-16 11:06:08,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:08,777 INFO L495 AbstractCegarLoop]: Abstraction has 304 states and 417 transitions. [2022-11-16 11:06:08,777 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-16 11:06:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 417 transitions. [2022-11-16 11:06:08,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2022-11-16 11:06:08,780 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:08,781 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-16 11:06:08,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 11:06:08,781 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:08,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:08,782 INFO L85 PathProgramCache]: Analyzing trace with hash -225788768, now seen corresponding path program 1 times [2022-11-16 11:06:08,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:08,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052205738] [2022-11-16 11:06:08,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:08,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:08,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:08,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:08,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:08,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:08,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:08,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:08,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:08,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:08,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,019 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-16 11:06:09,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:09,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052205738] [2022-11-16 11:06:09,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052205738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:09,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:09,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:06:09,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118139070] [2022-11-16 11:06:09,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:09,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:09,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:09,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:09,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:06:09,023 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-16 11:06:09,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:09,123 INFO L93 Difference]: Finished difference Result 449 states and 633 transitions. [2022-11-16 11:06:09,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:09,124 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-16 11:06:09,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:09,128 INFO L225 Difference]: With dead ends: 449 [2022-11-16 11:06:09,129 INFO L226 Difference]: Without dead ends: 285 [2022-11-16 11:06:09,133 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-16 11:06:09,135 INFO L413 NwaCegarLoop]: 250 mSDtfsCounter, 30 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:06:09,136 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.1s Time] [2022-11-16 11:06:09,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-16 11:06:09,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2022-11-16 11:06:09,152 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-16 11:06:09,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 388 transitions. [2022-11-16 11:06:09,155 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 388 transitions. Word has length 174 [2022-11-16 11:06:09,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:09,156 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 388 transitions. [2022-11-16 11:06:09,157 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-16 11:06:09,157 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 388 transitions. [2022-11-16 11:06:09,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-11-16 11:06:09,160 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:09,160 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-16 11:06:09,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 11:06:09,161 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:09,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:09,162 INFO L85 PathProgramCache]: Analyzing trace with hash -771772203, now seen corresponding path program 1 times [2022-11-16 11:06:09,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:09,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697998487] [2022-11-16 11:06:09,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:09,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:09,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:09,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:09,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:09,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:09,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:09,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:09,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:09,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:09,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:09,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,423 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-16 11:06:09,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:09,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697998487] [2022-11-16 11:06:09,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697998487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:09,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:09,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:06:09,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465498204] [2022-11-16 11:06:09,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:09,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:06:09,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:09,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:06:09,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:06:09,427 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-16 11:06:09,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:09,459 INFO L93 Difference]: Finished difference Result 429 states and 603 transitions. [2022-11-16 11:06:09,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:09,461 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-16 11:06:09,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:09,463 INFO L225 Difference]: With dead ends: 429 [2022-11-16 11:06:09,464 INFO L226 Difference]: Without dead ends: 285 [2022-11-16 11:06:09,465 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-16 11:06:09,465 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-16 11:06:09,466 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-16 11:06:09,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-16 11:06:09,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2022-11-16 11:06:09,482 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-16 11:06:09,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 382 transitions. [2022-11-16 11:06:09,485 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 382 transitions. Word has length 175 [2022-11-16 11:06:09,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:09,487 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 382 transitions. [2022-11-16 11:06:09,487 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-16 11:06:09,487 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 382 transitions. [2022-11-16 11:06:09,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-11-16 11:06:09,492 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:09,492 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-16 11:06:09,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 11:06:09,493 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:09,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:09,493 INFO L85 PathProgramCache]: Analyzing trace with hash 171596258, now seen corresponding path program 1 times [2022-11-16 11:06:09,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:09,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266009227] [2022-11-16 11:06:09,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:09,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:09,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:09,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:09,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:09,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:09,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:09,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:09,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:09,760 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-16 11:06:09,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:09,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266009227] [2022-11-16 11:06:09,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266009227] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:06:09,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [584307291] [2022-11-16 11:06:09,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:09,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:09,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:06:09,763 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:06:09,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:06:09,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:06:10,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:06:10,082 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-16 11:06:10,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:06:10,271 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-16 11:06:10,272 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [584307291] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 11:06:10,272 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:06:10,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4] total 5 [2022-11-16 11:06:10,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111324680] [2022-11-16 11:06:10,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:10,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:10,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:10,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:10,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:06:10,275 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-16 11:06:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:10,345 INFO L93 Difference]: Finished difference Result 450 states and 625 transitions. [2022-11-16 11:06:10,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:06:10,346 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-16 11:06:10,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:10,349 INFO L225 Difference]: With dead ends: 450 [2022-11-16 11:06:10,349 INFO L226 Difference]: Without dead ends: 264 [2022-11-16 11:06:10,350 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-16 11:06:10,351 INFO L413 NwaCegarLoop]: 253 mSDtfsCounter, 35 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 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-16 11:06:10,352 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 481 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:06:10,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2022-11-16 11:06:10,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2022-11-16 11:06:10,368 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-16 11:06:10,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 351 transitions. [2022-11-16 11:06:10,371 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 351 transitions. Word has length 182 [2022-11-16 11:06:10,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:10,371 INFO L495 AbstractCegarLoop]: Abstraction has 264 states and 351 transitions. [2022-11-16 11:06:10,372 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-16 11:06:10,372 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 351 transitions. [2022-11-16 11:06:10,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-11-16 11:06:10,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:10,376 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-16 11:06:10,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:06:10,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-11-16 11:06:10,583 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:10,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:10,584 INFO L85 PathProgramCache]: Analyzing trace with hash 687203413, now seen corresponding path program 1 times [2022-11-16 11:06:10,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:10,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391821704] [2022-11-16 11:06:10,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:10,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:10,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:10,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:10,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:10,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:10,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:10,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:10,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:10,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:10,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:10,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:10,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:10,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:10,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:10,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,777 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-16 11:06:10,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:10,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391821704] [2022-11-16 11:06:10,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391821704] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:10,778 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:10,778 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:06:10,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194604737] [2022-11-16 11:06:10,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:10,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:10,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:10,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:10,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:06:10,781 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-16 11:06:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:10,825 INFO L93 Difference]: Finished difference Result 407 states and 567 transitions. [2022-11-16 11:06:10,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:10,826 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-16 11:06:10,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:10,829 INFO L225 Difference]: With dead ends: 407 [2022-11-16 11:06:10,829 INFO L226 Difference]: Without dead ends: 270 [2022-11-16 11:06:10,830 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-16 11:06:10,831 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-16 11:06:10,831 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-16 11:06:10,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2022-11-16 11:06:10,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 268. [2022-11-16 11:06:10,847 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-16 11:06:10,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 354 transitions. [2022-11-16 11:06:10,850 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 354 transitions. Word has length 206 [2022-11-16 11:06:10,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:10,851 INFO L495 AbstractCegarLoop]: Abstraction has 268 states and 354 transitions. [2022-11-16 11:06:10,851 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-16 11:06:10,852 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 354 transitions. [2022-11-16 11:06:10,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-11-16 11:06:10,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:10,856 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-16 11:06:10,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 11:06:10,856 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:10,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:10,857 INFO L85 PathProgramCache]: Analyzing trace with hash 209531083, now seen corresponding path program 1 times [2022-11-16 11:06:10,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:10,858 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232741143] [2022-11-16 11:06:10,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:10,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:10,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:10,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:10,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:11,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:11,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:11,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:11,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:11,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:11,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:11,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:11,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:11,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:11,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:11,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:06:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,119 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-16 11:06:11,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:11,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232741143] [2022-11-16 11:06:11,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232741143] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:06:11,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878542553] [2022-11-16 11:06:11,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:11,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:11,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:06:11,122 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:06:11,147 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:06:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 692 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:06:11,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:06:11,397 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-16 11:06:11,397 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:06:11,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878542553] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:11,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:06:11,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-16 11:06:11,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192573333] [2022-11-16 11:06:11,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:11,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:11,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:11,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:11,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:06:11,401 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-16 11:06:11,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:11,448 INFO L93 Difference]: Finished difference Result 416 states and 574 transitions. [2022-11-16 11:06:11,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:11,449 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-16 11:06:11,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:11,454 INFO L225 Difference]: With dead ends: 416 [2022-11-16 11:06:11,454 INFO L226 Difference]: Without dead ends: 275 [2022-11-16 11:06:11,455 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 248 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:06:11,456 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-16 11:06:11,457 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-16 11:06:11,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-11-16 11:06:11,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2022-11-16 11:06:11,473 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-16 11:06:11,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 358 transitions. [2022-11-16 11:06:11,475 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 358 transitions. Word has length 213 [2022-11-16 11:06:11,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:11,479 INFO L495 AbstractCegarLoop]: Abstraction has 273 states and 358 transitions. [2022-11-16 11:06:11,480 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-16 11:06:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 358 transitions. [2022-11-16 11:06:11,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-11-16 11:06:11,485 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:11,485 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-16 11:06:11,499 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:06:11,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:11,699 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:11,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:11,700 INFO L85 PathProgramCache]: Analyzing trace with hash 915774272, now seen corresponding path program 1 times [2022-11-16 11:06:11,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:11,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333427193] [2022-11-16 11:06:11,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:11,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:11,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:11,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:11,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:11,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:11,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:11,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:11,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:11,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:11,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:11,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:11,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:11,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:06:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-16 11:06:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:11,969 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-16 11:06:11,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:11,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333427193] [2022-11-16 11:06:11,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333427193] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:06:11,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1432684497] [2022-11-16 11:06:11,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:11,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:11,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:06:11,972 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:06:11,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:06:12,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,226 INFO L263 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:06:12,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:06:12,257 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-16 11:06:12,258 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:06:12,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1432684497] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:12,258 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:06:12,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-16 11:06:12,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976936235] [2022-11-16 11:06:12,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:12,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:12,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:12,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:12,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:06:12,261 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-16 11:06:12,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:12,310 INFO L93 Difference]: Finished difference Result 418 states and 572 transitions. [2022-11-16 11:06:12,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:06:12,312 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-16 11:06:12,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:12,315 INFO L225 Difference]: With dead ends: 418 [2022-11-16 11:06:12,315 INFO L226 Difference]: Without dead ends: 272 [2022-11-16 11:06:12,316 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-16 11:06:12,317 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-16 11:06:12,317 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-16 11:06:12,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2022-11-16 11:06:12,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 272. [2022-11-16 11:06:12,334 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-16 11:06:12,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 353 transitions. [2022-11-16 11:06:12,337 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 353 transitions. Word has length 221 [2022-11-16 11:06:12,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:12,337 INFO L495 AbstractCegarLoop]: Abstraction has 272 states and 353 transitions. [2022-11-16 11:06:12,338 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-16 11:06:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 353 transitions. [2022-11-16 11:06:12,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2022-11-16 11:06:12,342 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:12,342 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-16 11:06:12,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:06:12,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:12,551 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:12,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:12,552 INFO L85 PathProgramCache]: Analyzing trace with hash 568293619, now seen corresponding path program 1 times [2022-11-16 11:06:12,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:12,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136402668] [2022-11-16 11:06:12,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:12,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:12,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:12,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:12,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:12,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:12,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:12,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:12,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:12,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:12,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:12,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:06:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-16 11:06:12,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-16 11:06:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:12,811 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-16 11:06:12,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:12,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136402668] [2022-11-16 11:06:12,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136402668] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:12,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:12,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:06:12,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249427061] [2022-11-16 11:06:12,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:12,813 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:12,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:12,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:12,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:06:12,817 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-16 11:06:13,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:13,203 INFO L93 Difference]: Finished difference Result 451 states and 620 transitions. [2022-11-16 11:06:13,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:06:13,204 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-16 11:06:13,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:13,207 INFO L225 Difference]: With dead ends: 451 [2022-11-16 11:06:13,207 INFO L226 Difference]: Without dead ends: 306 [2022-11-16 11:06:13,208 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-16 11:06:13,209 INFO L413 NwaCegarLoop]: 242 mSDtfsCounter, 177 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-16 11:06:13,210 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-16 11:06:13,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2022-11-16 11:06:13,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 271. [2022-11-16 11:06:13,237 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-16 11:06:13,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 350 transitions. [2022-11-16 11:06:13,240 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 350 transitions. Word has length 228 [2022-11-16 11:06:13,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:13,241 INFO L495 AbstractCegarLoop]: Abstraction has 271 states and 350 transitions. [2022-11-16 11:06:13,241 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-16 11:06:13,241 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 350 transitions. [2022-11-16 11:06:13,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2022-11-16 11:06:13,245 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:13,245 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-16 11:06:13,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-16 11:06:13,246 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:13,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:13,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1358671604, now seen corresponding path program 1 times [2022-11-16 11:06:13,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:13,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688837174] [2022-11-16 11:06:13,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:13,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:13,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:13,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:13,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:13,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:13,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:13,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:13,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:13,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:13,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:13,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:13,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:13,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:06:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-16 11:06:13,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-16 11:06:13,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:13,674 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-16 11:06:13,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:13,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688837174] [2022-11-16 11:06:13,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688837174] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:13,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:13,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:06:13,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683919028] [2022-11-16 11:06:13,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:13,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:06:13,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:13,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:06:13,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:06:13,677 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-16 11:06:14,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:14,594 INFO L93 Difference]: Finished difference Result 621 states and 830 transitions. [2022-11-16 11:06:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:06:14,595 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-16 11:06:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:14,599 INFO L225 Difference]: With dead ends: 621 [2022-11-16 11:06:14,599 INFO L226 Difference]: Without dead ends: 477 [2022-11-16 11:06:14,600 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-16 11:06:14,601 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-16 11:06:14,601 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-16 11:06:14,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2022-11-16 11:06:14,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 423. [2022-11-16 11:06:14,644 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-16 11:06:14,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 555 transitions. [2022-11-16 11:06:14,648 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 555 transitions. Word has length 231 [2022-11-16 11:06:14,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:14,649 INFO L495 AbstractCegarLoop]: Abstraction has 423 states and 555 transitions. [2022-11-16 11:06:14,649 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-16 11:06:14,649 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 555 transitions. [2022-11-16 11:06:14,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2022-11-16 11:06:14,654 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:14,654 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-16 11:06:14,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-16 11:06:14,655 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:14,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:14,656 INFO L85 PathProgramCache]: Analyzing trace with hash -1534595272, now seen corresponding path program 1 times [2022-11-16 11:06:14,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:14,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296553865] [2022-11-16 11:06:14,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:14,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:14,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:14,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:14,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:14,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:14,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:14,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:14,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:14,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:14,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:14,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:14,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:14,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:14,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:14,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:14,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:06:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-16 11:06:14,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-16 11:06:14,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-11-16 11:06:14,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-11-16 11:06:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-11-16 11:06:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:14,966 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-16 11:06:14,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:14,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296553865] [2022-11-16 11:06:14,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296553865] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:14,968 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:14,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:06:14,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102348170] [2022-11-16 11:06:14,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:14,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:14,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:14,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:14,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:06:14,971 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-16 11:06:15,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:15,684 INFO L93 Difference]: Finished difference Result 893 states and 1225 transitions. [2022-11-16 11:06:15,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:15,685 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-16 11:06:15,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:15,690 INFO L225 Difference]: With dead ends: 893 [2022-11-16 11:06:15,690 INFO L226 Difference]: Without dead ends: 665 [2022-11-16 11:06:15,692 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-16 11:06:15,692 INFO L413 NwaCegarLoop]: 205 mSDtfsCounter, 219 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:06:15,693 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.6s Time] [2022-11-16 11:06:15,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-11-16 11:06:15,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 503. [2022-11-16 11:06:15,757 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-16 11:06:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 660 transitions. [2022-11-16 11:06:15,762 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 660 transitions. Word has length 258 [2022-11-16 11:06:15,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:15,762 INFO L495 AbstractCegarLoop]: Abstraction has 503 states and 660 transitions. [2022-11-16 11:06:15,763 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-16 11:06:15,763 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 660 transitions. [2022-11-16 11:06:15,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2022-11-16 11:06:15,768 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:15,768 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-16 11:06:15,769 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-16 11:06:15,769 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:15,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:15,770 INFO L85 PathProgramCache]: Analyzing trace with hash -141182582, now seen corresponding path program 1 times [2022-11-16 11:06:15,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:15,770 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245809545] [2022-11-16 11:06:15,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:15,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:15,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:15,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:15,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:15,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:15,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:15,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:15,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:15,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:15,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:15,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:15,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:15,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:15,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:15,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:15,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:15,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:15,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:15,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:15,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:15,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:15,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:15,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:15,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:15,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:16,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:06:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:16,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-16 11:06:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:16,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-16 11:06:16,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:16,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-11-16 11:06:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:16,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-11-16 11:06:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:16,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-11-16 11:06:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:16,037 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-16 11:06:16,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:16,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245809545] [2022-11-16 11:06:16,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [245809545] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:16,038 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:16,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:06:16,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101150695] [2022-11-16 11:06:16,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:16,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:16,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:16,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:16,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:06:16,040 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-16 11:06:16,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:16,760 INFO L93 Difference]: Finished difference Result 1067 states and 1456 transitions. [2022-11-16 11:06:16,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:16,761 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-16 11:06:16,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:16,765 INFO L225 Difference]: With dead ends: 1067 [2022-11-16 11:06:16,765 INFO L226 Difference]: Without dead ends: 788 [2022-11-16 11:06:16,766 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-16 11:06:16,767 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 220 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:06:16,767 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.6s Time] [2022-11-16 11:06:16,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 788 states. [2022-11-16 11:06:16,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 788 to 613. [2022-11-16 11:06:16,836 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-16 11:06:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 806 transitions. [2022-11-16 11:06:16,840 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 806 transitions. Word has length 259 [2022-11-16 11:06:16,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:16,841 INFO L495 AbstractCegarLoop]: Abstraction has 613 states and 806 transitions. [2022-11-16 11:06:16,842 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-16 11:06:16,842 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 806 transitions. [2022-11-16 11:06:16,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-11-16 11:06:16,846 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:16,847 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-16 11:06:16,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-16 11:06:16,847 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:16,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:16,848 INFO L85 PathProgramCache]: Analyzing trace with hash -1355646765, now seen corresponding path program 1 times [2022-11-16 11:06:16,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:16,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167328694] [2022-11-16 11:06:16,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:16,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:16,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:16,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:16,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:16,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:16,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:16,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:17,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:17,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:17,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:17,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:17,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:17,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:17,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:17,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:17,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:17,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:17,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:17,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:17,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:06:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:17,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-16 11:06:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:17,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-16 11:06:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:17,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-11-16 11:06:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:17,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-16 11:06:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:17,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-16 11:06:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:17,105 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-16 11:06:17,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:17,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167328694] [2022-11-16 11:06:17,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167328694] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:17,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:17,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:06:17,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323055760] [2022-11-16 11:06:17,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:17,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:17,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:17,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:17,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:06:17,111 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-16 11:06:17,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:17,841 INFO L93 Difference]: Finished difference Result 1283 states and 1750 transitions. [2022-11-16 11:06:17,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:17,842 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-16 11:06:17,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:17,848 INFO L225 Difference]: With dead ends: 1283 [2022-11-16 11:06:17,848 INFO L226 Difference]: Without dead ends: 926 [2022-11-16 11:06:17,849 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-16 11:06:17,850 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 220 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:06:17,855 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.6s Time] [2022-11-16 11:06:17,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2022-11-16 11:06:17,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 723. [2022-11-16 11:06:17,960 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-16 11:06:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 958 transitions. [2022-11-16 11:06:17,965 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 958 transitions. Word has length 260 [2022-11-16 11:06:17,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:17,967 INFO L495 AbstractCegarLoop]: Abstraction has 723 states and 958 transitions. [2022-11-16 11:06:17,968 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-16 11:06:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 958 transitions. [2022-11-16 11:06:17,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2022-11-16 11:06:17,973 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:17,974 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-16 11:06:17,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-16 11:06:17,974 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:17,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:17,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1080887151, now seen corresponding path program 1 times [2022-11-16 11:06:17,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:17,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333886619] [2022-11-16 11:06:17,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:17,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:18,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:18,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:18,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:18,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:18,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:18,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:18,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:18,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:06:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-16 11:06:18,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-16 11:06:18,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-11-16 11:06:18,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2022-11-16 11:06:18,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-11-16 11:06:18,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,389 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-16 11:06:18,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:18,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333886619] [2022-11-16 11:06:18,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333886619] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:06:18,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [550489924] [2022-11-16 11:06:18,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:18,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:18,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:06:18,392 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:06:18,430 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:06:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:18,684 INFO L263 TraceCheckSpWp]: Trace formula consists of 893 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:06:18,707 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:06:18,767 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-16 11:06:18,768 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:06:18,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [550489924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:18,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:06:18,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-11-16 11:06:18,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649517164] [2022-11-16 11:06:18,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:18,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:18,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:18,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:18,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:06:18,772 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-16 11:06:19,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:19,008 INFO L93 Difference]: Finished difference Result 1194 states and 1622 transitions. [2022-11-16 11:06:19,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:19,009 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-16 11:06:19,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:19,014 INFO L225 Difference]: With dead ends: 1194 [2022-11-16 11:06:19,015 INFO L226 Difference]: Without dead ends: 723 [2022-11-16 11:06:19,017 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-16 11:06:19,018 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-16 11:06:19,021 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-16 11:06:19,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 723 states. [2022-11-16 11:06:19,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 723 to 723. [2022-11-16 11:06:19,123 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-16 11:06:19,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 952 transitions. [2022-11-16 11:06:19,127 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 952 transitions. Word has length 260 [2022-11-16 11:06:19,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:19,128 INFO L495 AbstractCegarLoop]: Abstraction has 723 states and 952 transitions. [2022-11-16 11:06:19,129 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-16 11:06:19,129 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 952 transitions. [2022-11-16 11:06:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2022-11-16 11:06:19,134 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:19,134 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-16 11:06:19,151 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-16 11:06:19,341 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:19,342 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:19,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:19,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1702413312, now seen corresponding path program 1 times [2022-11-16 11:06:19,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:19,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436562590] [2022-11-16 11:06:19,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:19,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:19,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:19,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:19,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:19,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:19,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:19,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:19,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:19,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:19,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:06:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-16 11:06:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-16 11:06:19,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-11-16 11:06:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-11-16 11:06:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 247 [2022-11-16 11:06:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:19,759 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-16 11:06:19,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:19,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436562590] [2022-11-16 11:06:19,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436562590] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:06:19,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [61100205] [2022-11-16 11:06:19,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:19,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:19,761 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:06:19,762 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:06:19,782 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:06:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-16 11:06:20,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:06:20,116 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-16 11:06:20,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:06:20,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [61100205] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:20,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:06:20,118 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2022-11-16 11:06:20,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636699532] [2022-11-16 11:06:20,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:20,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:20,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:20,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:20,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:06:20,120 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-16 11:06:20,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:20,279 INFO L93 Difference]: Finished difference Result 1194 states and 1608 transitions. [2022-11-16 11:06:20,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:20,280 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-16 11:06:20,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:20,285 INFO L225 Difference]: With dead ends: 1194 [2022-11-16 11:06:20,285 INFO L226 Difference]: Without dead ends: 735 [2022-11-16 11:06:20,287 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-16 11:06:20,287 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-16 11:06:20,288 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-16 11:06:20,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2022-11-16 11:06:20,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 735. [2022-11-16 11:06:20,372 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-16 11:06:20,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 966 transitions. [2022-11-16 11:06:20,376 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 966 transitions. Word has length 261 [2022-11-16 11:06:20,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:20,377 INFO L495 AbstractCegarLoop]: Abstraction has 735 states and 966 transitions. [2022-11-16 11:06:20,377 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-16 11:06:20,378 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 966 transitions. [2022-11-16 11:06:20,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2022-11-16 11:06:20,382 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:20,383 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-16 11:06:20,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:06:20,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-11-16 11:06:20,591 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:20,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:20,591 INFO L85 PathProgramCache]: Analyzing trace with hash -955415893, now seen corresponding path program 1 times [2022-11-16 11:06:20,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:20,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230717073] [2022-11-16 11:06:20,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:20,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:20,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:20,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:20,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:20,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:06:20,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-16 11:06:20,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-16 11:06:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 230 [2022-11-16 11:06:20,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-11-16 11:06:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-11-16 11:06:20,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:20,963 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-16 11:06:20,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:20,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230717073] [2022-11-16 11:06:20,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230717073] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:20,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:20,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:06:20,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588992323] [2022-11-16 11:06:20,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:20,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:20,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:20,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:20,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:06:20,966 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-16 11:06:21,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:21,408 INFO L93 Difference]: Finished difference Result 1208 states and 1622 transitions. [2022-11-16 11:06:21,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:06:21,409 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-16 11:06:21,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:21,414 INFO L225 Difference]: With dead ends: 1208 [2022-11-16 11:06:21,414 INFO L226 Difference]: Without dead ends: 715 [2022-11-16 11:06:21,416 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-16 11:06:21,416 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-16 11:06:21,417 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-16 11:06:21,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-11-16 11:06:21,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 715. [2022-11-16 11:06:21,506 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-16 11:06:21,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 715 states to 715 states and 930 transitions. [2022-11-16 11:06:21,510 INFO L78 Accepts]: Start accepts. Automaton has 715 states and 930 transitions. Word has length 262 [2022-11-16 11:06:21,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:21,511 INFO L495 AbstractCegarLoop]: Abstraction has 715 states and 930 transitions. [2022-11-16 11:06:21,511 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-16 11:06:21,512 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 930 transitions. [2022-11-16 11:06:21,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2022-11-16 11:06:21,517 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:21,518 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-16 11:06:21,518 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-16 11:06:21,518 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:21,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:21,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1386884296, now seen corresponding path program 1 times [2022-11-16 11:06:21,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:21,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681394194] [2022-11-16 11:06:21,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:21,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:21,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:21,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:21,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:21,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:21,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:21,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:21,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:21,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:21,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:21,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:21,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:21,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:21,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:21,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:21,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:21,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:22,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:22,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:22,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:22,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:22,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:22,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:22,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:22,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:22,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:22,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:22,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:22,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:22,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:22,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:22,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:22,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:06:22,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:22,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-16 11:06:22,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:22,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-16 11:06:22,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:22,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-16 11:06:22,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:22,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-16 11:06:22,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:22,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-16 11:06:22,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:22,086 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-16 11:06:22,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:22,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681394194] [2022-11-16 11:06:22,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681394194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:22,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:22,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:06:22,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957799526] [2022-11-16 11:06:22,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:22,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:06:22,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:22,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:06:22,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:06:22,090 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-16 11:06:22,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:22,875 INFO L93 Difference]: Finished difference Result 1036 states and 1422 transitions. [2022-11-16 11:06:22,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:06:22,876 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-16 11:06:22,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:22,882 INFO L225 Difference]: With dead ends: 1036 [2022-11-16 11:06:22,883 INFO L226 Difference]: Without dead ends: 1034 [2022-11-16 11:06:22,884 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-16 11:06:22,885 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-16 11:06:22,886 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-16 11:06:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1034 states. [2022-11-16 11:06:22,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1034 to 721. [2022-11-16 11:06:22,998 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-16 11:06:23,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 936 transitions. [2022-11-16 11:06:23,003 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 936 transitions. Word has length 263 [2022-11-16 11:06:23,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:23,004 INFO L495 AbstractCegarLoop]: Abstraction has 721 states and 936 transitions. [2022-11-16 11:06:23,004 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-16 11:06:23,004 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 936 transitions. [2022-11-16 11:06:23,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-11-16 11:06:23,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:23,008 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-16 11:06:23,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-16 11:06:23,008 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:23,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:23,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1763607020, now seen corresponding path program 1 times [2022-11-16 11:06:23,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:23,009 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409037647] [2022-11-16 11:06:23,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:23,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:23,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:23,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:23,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:23,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:23,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:23,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:23,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:23,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:23,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:23,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:23,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:06:23,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-16 11:06:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-16 11:06:23,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-16 11:06:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-16 11:06:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-16 11:06:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-11-16 11:06:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,625 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-16 11:06:23,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:23,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409037647] [2022-11-16 11:06:23,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409037647] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:06:23,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952187619] [2022-11-16 11:06:23,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:23,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:23,628 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:06:23,629 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:06:23,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-16 11:06:23,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:23,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 10 conjunts are in the unsatisfiable core [2022-11-16 11:06:23,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:06:24,242 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-16 11:06:24,243 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:06:24,708 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-16 11:06:24,708 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952187619] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:06:24,708 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:06:24,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 19 [2022-11-16 11:06:24,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351891849] [2022-11-16 11:06:24,709 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:06:24,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-11-16 11:06:24,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:24,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-11-16 11:06:24,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2022-11-16 11:06:24,711 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-16 11:06:28,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:28,558 INFO L93 Difference]: Finished difference Result 2138 states and 2980 transitions. [2022-11-16 11:06:28,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 11:06:28,559 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-16 11:06:28,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:28,570 INFO L225 Difference]: With dead ends: 2138 [2022-11-16 11:06:28,570 INFO L226 Difference]: Without dead ends: 1679 [2022-11-16 11:06:28,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 623 GetRequests, 583 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=211, Invalid=1121, Unknown=0, NotChecked=0, Total=1332 [2022-11-16 11:06:28,574 INFO L413 NwaCegarLoop]: 277 mSDtfsCounter, 648 mSDsluCounter, 2908 mSDsCounter, 0 mSdLazyCounter, 2833 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 3185 SdHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 2833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-16 11:06:28,574 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 3185 Invalid, 3009 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [176 Valid, 2833 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-16 11:06:28,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1679 states. [2022-11-16 11:06:28,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1679 to 989. [2022-11-16 11:06:28,775 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-16 11:06:28,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 989 states to 989 states and 1273 transitions. [2022-11-16 11:06:28,781 INFO L78 Accepts]: Start accepts. Automaton has 989 states and 1273 transitions. Word has length 271 [2022-11-16 11:06:28,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:28,781 INFO L495 AbstractCegarLoop]: Abstraction has 989 states and 1273 transitions. [2022-11-16 11:06:28,782 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-16 11:06:28,782 INFO L276 IsEmpty]: Start isEmpty. Operand 989 states and 1273 transitions. [2022-11-16 11:06:28,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2022-11-16 11:06:28,785 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:28,785 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-16 11:06:28,799 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:06:28,993 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:28,994 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:28,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:28,994 INFO L85 PathProgramCache]: Analyzing trace with hash -801993003, now seen corresponding path program 1 times [2022-11-16 11:06:28,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:28,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218891666] [2022-11-16 11:06:28,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:28,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:29,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:29,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:29,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:29,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:29,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:29,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:29,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:29,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:06:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-16 11:06:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-16 11:06:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-16 11:06:29,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-16 11:06:29,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-16 11:06:29,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-11-16 11:06:29,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,241 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-16 11:06:29,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:29,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218891666] [2022-11-16 11:06:29,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218891666] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:06:29,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786623533] [2022-11-16 11:06:29,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:29,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:29,243 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:06:29,244 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:06:29,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-16 11:06:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:29,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:06:29,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:06:29,536 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-16 11:06:29,544 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:06:29,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786623533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:29,544 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:06:29,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-16 11:06:29,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474034885] [2022-11-16 11:06:29,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:29,546 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:29,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:29,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:29,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:06:29,547 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-16 11:06:29,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:29,819 INFO L93 Difference]: Finished difference Result 1841 states and 2410 transitions. [2022-11-16 11:06:29,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:29,820 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-16 11:06:29,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:29,826 INFO L225 Difference]: With dead ends: 1841 [2022-11-16 11:06:29,826 INFO L226 Difference]: Without dead ends: 973 [2022-11-16 11:06:29,829 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-16 11:06:29,830 INFO L413 NwaCegarLoop]: 231 mSDtfsCounter, 11 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-16 11:06:29,830 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-16 11:06:29,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2022-11-16 11:06:29,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 973. [2022-11-16 11:06:29,964 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-16 11:06:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 973 states to 973 states and 1240 transitions. [2022-11-16 11:06:29,969 INFO L78 Accepts]: Start accepts. Automaton has 973 states and 1240 transitions. Word has length 271 [2022-11-16 11:06:29,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:29,970 INFO L495 AbstractCegarLoop]: Abstraction has 973 states and 1240 transitions. [2022-11-16 11:06:29,970 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-16 11:06:29,970 INFO L276 IsEmpty]: Start isEmpty. Operand 973 states and 1240 transitions. [2022-11-16 11:06:30,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-11-16 11:06:30,002 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:30,002 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-16 11:06:30,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:06:30,203 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-11-16 11:06:30,203 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:30,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:30,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1829250860, now seen corresponding path program 1 times [2022-11-16 11:06:30,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:30,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096284029] [2022-11-16 11:06:30,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:30,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:30,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:30,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:30,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:30,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:30,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:30,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:30,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:30,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:30,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:30,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-16 11:06:30,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-11-16 11:06:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-16 11:06:30,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-16 11:06:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-11-16 11:06:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-11-16 11:06:30,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-16 11:06:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-11-16 11:06:30,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-11-16 11:06:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,456 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-16 11:06:30,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:30,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096284029] [2022-11-16 11:06:30,457 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096284029] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:06:30,457 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38339552] [2022-11-16 11:06:30,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:30,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:30,458 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:06:30,459 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:06:30,494 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-16 11:06:30,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:30,752 INFO L263 TraceCheckSpWp]: Trace formula consists of 930 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:06:30,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:06:30,781 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-16 11:06:30,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:06:30,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38339552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:30,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:06:30,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-16 11:06:30,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851180111] [2022-11-16 11:06:30,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:30,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:06:30,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:30,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:06:30,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:06:30,784 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-16 11:06:30,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:30,984 INFO L93 Difference]: Finished difference Result 1689 states and 2194 transitions. [2022-11-16 11:06:30,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:06:30,985 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-16 11:06:30,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:30,990 INFO L225 Difference]: With dead ends: 1689 [2022-11-16 11:06:30,991 INFO L226 Difference]: Without dead ends: 828 [2022-11-16 11:06:30,994 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-16 11:06:30,995 INFO L413 NwaCegarLoop]: 234 mSDtfsCounter, 8 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-16 11:06:30,996 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-16 11:06:30,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2022-11-16 11:06:31,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828. [2022-11-16 11:06:31,117 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-16 11:06:31,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1055 transitions. [2022-11-16 11:06:31,122 INFO L78 Accepts]: Start accepts. Automaton has 828 states and 1055 transitions. Word has length 274 [2022-11-16 11:06:31,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:31,123 INFO L495 AbstractCegarLoop]: Abstraction has 828 states and 1055 transitions. [2022-11-16 11:06:31,123 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-16 11:06:31,123 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1055 transitions. [2022-11-16 11:06:31,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2022-11-16 11:06:31,126 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:31,126 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-16 11:06:31,140 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-16 11:06:31,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:31,335 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:31,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:31,336 INFO L85 PathProgramCache]: Analyzing trace with hash 211214063, now seen corresponding path program 1 times [2022-11-16 11:06:31,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:31,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530983412] [2022-11-16 11:06:31,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:31,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:32,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:32,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:32,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:32,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:32,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:32,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:32,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:32,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:32,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:06:32,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-16 11:06:32,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-16 11:06:32,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-16 11:06:32,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-16 11:06:32,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-16 11:06:32,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-11-16 11:06:32,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-11-16 11:06:32,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-11-16 11:06:32,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,650 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-16 11:06:32,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:32,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530983412] [2022-11-16 11:06:32,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530983412] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:06:32,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980886873] [2022-11-16 11:06:32,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:32,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:32,652 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:06:32,653 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:06:32,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-16 11:06:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:32,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 11:06:32,963 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:06:33,228 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-16 11:06:33,228 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:06:33,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980886873] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:33,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:06:33,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2022-11-16 11:06:33,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1318864333] [2022-11-16 11:06:33,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:33,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:06:33,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:33,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:06:33,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2022-11-16 11:06:33,231 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-16 11:06:33,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:33,885 INFO L93 Difference]: Finished difference Result 1714 states and 2246 transitions. [2022-11-16 11:06:33,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:06:33,887 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-16 11:06:33,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:33,894 INFO L225 Difference]: With dead ends: 1714 [2022-11-16 11:06:33,894 INFO L226 Difference]: Without dead ends: 1248 [2022-11-16 11:06:33,897 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-16 11:06:33,898 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-16 11:06:33,899 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-16 11:06:33,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2022-11-16 11:06:34,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 990. [2022-11-16 11:06:34,057 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-16 11:06:34,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 990 states to 990 states and 1257 transitions. [2022-11-16 11:06:34,062 INFO L78 Accepts]: Start accepts. Automaton has 990 states and 1257 transitions. Word has length 286 [2022-11-16 11:06:34,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:34,063 INFO L495 AbstractCegarLoop]: Abstraction has 990 states and 1257 transitions. [2022-11-16 11:06:34,064 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-16 11:06:34,064 INFO L276 IsEmpty]: Start isEmpty. Operand 990 states and 1257 transitions. [2022-11-16 11:06:34,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-11-16 11:06:34,067 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:34,067 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-16 11:06:34,076 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-16 11:06:34,275 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-11-16 11:06:34,275 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:34,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:34,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1543527212, now seen corresponding path program 1 times [2022-11-16 11:06:34,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:34,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803680820] [2022-11-16 11:06:34,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:34,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:34,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:34,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:34,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:34,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:34,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:34,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:34,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:34,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:34,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:34,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:34,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:34,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:06:34,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-16 11:06:34,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-16 11:06:34,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-16 11:06:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-16 11:06:34,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-11-16 11:06:34,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-16 11:06:34,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-11-16 11:06:34,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-11-16 11:06:34,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:34,606 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-16 11:06:34,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:34,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803680820] [2022-11-16 11:06:34,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803680820] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:34,607 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:34,607 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 11:06:34,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044883572] [2022-11-16 11:06:34,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:34,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:06:34,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:34,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:06:34,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:06:34,610 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-16 11:06:35,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:35,606 INFO L93 Difference]: Finished difference Result 2828 states and 3907 transitions. [2022-11-16 11:06:35,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:06:35,607 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-16 11:06:35,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:35,618 INFO L225 Difference]: With dead ends: 2828 [2022-11-16 11:06:35,618 INFO L226 Difference]: Without dead ends: 2185 [2022-11-16 11:06:35,621 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-16 11:06:35,622 INFO L413 NwaCegarLoop]: 484 mSDtfsCounter, 499 mSDsluCounter, 1145 mSDsCounter, 0 mSdLazyCounter, 451 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:06:35,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 1629 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 11:06:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2185 states. [2022-11-16 11:06:35,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2185 to 1045. [2022-11-16 11:06:35,804 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-16 11:06:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1345 transitions. [2022-11-16 11:06:35,809 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1345 transitions. Word has length 292 [2022-11-16 11:06:35,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:35,810 INFO L495 AbstractCegarLoop]: Abstraction has 1045 states and 1345 transitions. [2022-11-16 11:06:35,810 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-16 11:06:35,810 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1345 transitions. [2022-11-16 11:06:35,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-11-16 11:06:35,813 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:35,813 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-16 11:06:35,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-16 11:06:35,814 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:35,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:35,816 INFO L85 PathProgramCache]: Analyzing trace with hash -286887768, now seen corresponding path program 1 times [2022-11-16 11:06:35,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:35,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334783099] [2022-11-16 11:06:35,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:35,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:35,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:36,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:36,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:36,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:36,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:36,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:36,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:36,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:36,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:36,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:36,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:36,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:36,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:36,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:06:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-16 11:06:36,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-16 11:06:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-16 11:06:36,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-16 11:06:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-11-16 11:06:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-16 11:06:36,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-11-16 11:06:36,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-11-16 11:06:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,564 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-16 11:06:36,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:36,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334783099] [2022-11-16 11:06:36,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334783099] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:06:36,566 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685060266] [2022-11-16 11:06:36,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:36,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:36,566 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:06:36,568 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:06:36,585 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-11-16 11:06:36,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:36,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-16 11:06:36,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:06:37,139 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-16 11:06:37,140 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:06:37,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685060266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:37,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:06:37,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12] total 17 [2022-11-16 11:06:37,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1541645776] [2022-11-16 11:06:37,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:37,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:06:37,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:37,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:06:37,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2022-11-16 11:06:37,143 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-16 11:06:38,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:38,948 INFO L93 Difference]: Finished difference Result 2805 states and 3763 transitions. [2022-11-16 11:06:38,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-11-16 11:06:38,949 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-16 11:06:38,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:38,963 INFO L225 Difference]: With dead ends: 2805 [2022-11-16 11:06:38,963 INFO L226 Difference]: Without dead ends: 2108 [2022-11-16 11:06:38,966 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-16 11:06:38,967 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, 1.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:06:38,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1274 Valid, 2896 Invalid, 1324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [300 Valid, 1024 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-11-16 11:06:38,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2108 states. [2022-11-16 11:06:39,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2108 to 1221. [2022-11-16 11:06:39,228 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-16 11:06:39,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1566 transitions. [2022-11-16 11:06:39,233 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1566 transitions. Word has length 292 [2022-11-16 11:06:39,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:39,234 INFO L495 AbstractCegarLoop]: Abstraction has 1221 states and 1566 transitions. [2022-11-16 11:06:39,234 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-16 11:06:39,235 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1566 transitions. [2022-11-16 11:06:39,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2022-11-16 11:06:39,237 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:39,238 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-16 11:06:39,252 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-11-16 11:06:39,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:39,446 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:39,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:39,446 INFO L85 PathProgramCache]: Analyzing trace with hash 600167080, now seen corresponding path program 1 times [2022-11-16 11:06:39,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:39,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200616545] [2022-11-16 11:06:39,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:39,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:39,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:39,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:39,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:39,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:39,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:40,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:40,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:40,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:40,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:40,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:40,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:40,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:40,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:40,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:40,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:06:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-16 11:06:40,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-16 11:06:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-16 11:06:40,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-16 11:06:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-11-16 11:06:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-16 11:06:40,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-11-16 11:06:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-11-16 11:06:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,158 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-16 11:06:40,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:40,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200616545] [2022-11-16 11:06:40,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200616545] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:06:40,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513726508] [2022-11-16 11:06:40,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:40,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:40,160 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:06:40,161 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:06:40,186 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-11-16 11:06:40,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:40,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 988 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 11:06:40,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:06:40,591 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-16 11:06:40,592 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:06:40,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513726508] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:40,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:06:40,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [12] total 15 [2022-11-16 11:06:40,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883243964] [2022-11-16 11:06:40,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:40,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:06:40,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:40,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:06:40,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:06:40,595 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-16 11:06:41,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:41,606 INFO L93 Difference]: Finished difference Result 2477 states and 3294 transitions. [2022-11-16 11:06:41,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-16 11:06:41,608 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-16 11:06:41,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:41,617 INFO L225 Difference]: With dead ends: 2477 [2022-11-16 11:06:41,618 INFO L226 Difference]: Without dead ends: 1601 [2022-11-16 11:06:41,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 341 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2022-11-16 11:06:41,622 INFO L413 NwaCegarLoop]: 466 mSDtfsCounter, 400 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 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.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:06:41,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [415 Valid, 2200 Invalid, 642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 11:06:41,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1601 states. [2022-11-16 11:06:41,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1601 to 1199. [2022-11-16 11:06:41,869 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-16 11:06:41,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1199 states to 1199 states and 1529 transitions. [2022-11-16 11:06:41,873 INFO L78 Accepts]: Start accepts. Automaton has 1199 states and 1529 transitions. Word has length 292 [2022-11-16 11:06:41,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:41,874 INFO L495 AbstractCegarLoop]: Abstraction has 1199 states and 1529 transitions. [2022-11-16 11:06:41,875 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-16 11:06:41,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1199 states and 1529 transitions. [2022-11-16 11:06:41,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2022-11-16 11:06:41,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:41,878 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-16 11:06:41,896 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-11-16 11:06:42,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:42,087 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:42,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:42,088 INFO L85 PathProgramCache]: Analyzing trace with hash -1957012249, now seen corresponding path program 1 times [2022-11-16 11:06:42,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:42,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430975441] [2022-11-16 11:06:42,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:42,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:42,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:42,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:42,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:42,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:42,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:42,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:42,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:42,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:42,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:42,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:42,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:06:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-16 11:06:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-16 11:06:42,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-16 11:06:42,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-16 11:06:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-16 11:06:42,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-11-16 11:06:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-11-16 11:06:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-11-16 11:06:42,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-11-16 11:06:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:42,372 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-16 11:06:42,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:42,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430975441] [2022-11-16 11:06:42,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430975441] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:06:42,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:06:42,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:06:42,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814334848] [2022-11-16 11:06:42,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:06:42,375 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:06:42,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:42,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:06:42,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:06:42,378 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-16 11:06:43,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:06:43,366 INFO L93 Difference]: Finished difference Result 1977 states and 2543 transitions. [2022-11-16 11:06:43,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:06:43,367 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-16 11:06:43,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:06:43,372 INFO L225 Difference]: With dead ends: 1977 [2022-11-16 11:06:43,373 INFO L226 Difference]: Without dead ends: 1135 [2022-11-16 11:06:43,375 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-16 11:06:43,376 INFO L413 NwaCegarLoop]: 284 mSDtfsCounter, 480 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s 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.7s IncrementalHoareTripleChecker+Time [2022-11-16 11:06:43,376 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.7s Time] [2022-11-16 11:06:43,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2022-11-16 11:06:43,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 898. [2022-11-16 11:06:43,530 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-16 11:06:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 898 states to 898 states and 1126 transitions. [2022-11-16 11:06:43,534 INFO L78 Accepts]: Start accepts. Automaton has 898 states and 1126 transitions. Word has length 300 [2022-11-16 11:06:43,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:06:43,535 INFO L495 AbstractCegarLoop]: Abstraction has 898 states and 1126 transitions. [2022-11-16 11:06:43,535 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-16 11:06:43,536 INFO L276 IsEmpty]: Start isEmpty. Operand 898 states and 1126 transitions. [2022-11-16 11:06:43,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2022-11-16 11:06:43,540 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:06:43,540 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-16 11:06:43,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-16 11:06:43,541 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:06:43,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:06:43,542 INFO L85 PathProgramCache]: Analyzing trace with hash 336941807, now seen corresponding path program 1 times [2022-11-16 11:06:43,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:06:43,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217558413] [2022-11-16 11:06:43,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:43,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:06:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:44,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:06:44,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:44,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:06:44,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:44,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:06:44,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:44,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:06:44,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:44,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:06:44,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:44,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:06:44,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:44,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:06:44,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:44,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:06:44,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:44,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:06:44,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:44,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:06:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:44,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:44,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:44,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:06:44,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:44,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:06:44,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:45,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:06:45,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:45,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:06:45,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:45,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:06:45,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:45,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:06:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:45,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-16 11:06:45,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:45,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-16 11:06:45,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:45,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-11-16 11:06:45,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:45,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-11-16 11:06:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:45,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2022-11-16 11:06:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:45,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 259 [2022-11-16 11:06:45,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:45,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 266 [2022-11-16 11:06:45,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:45,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-11-16 11:06:45,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:45,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 284 [2022-11-16 11:06:45,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:45,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-11-16 11:06:45,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:45,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 309 [2022-11-16 11:06:45,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:45,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 318 [2022-11-16 11:06:45,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:45,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 326 [2022-11-16 11:06:45,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:45,142 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-16 11:06:45,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:06:45,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217558413] [2022-11-16 11:06:45,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217558413] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:06:45,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1783486210] [2022-11-16 11:06:45,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:06:45,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:06:45,144 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:06:45,145 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:06:45,178 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-11-16 11:06:45,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:06:45,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 1261 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-16 11:06:45,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:06:46,210 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-16 11:06:46,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:06:47,313 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-16 11:06:47,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1783486210] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:06:47,314 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:06:47,315 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 34 [2022-11-16 11:06:47,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89757266] [2022-11-16 11:06:47,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:06:47,321 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-11-16 11:06:47,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:06:47,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-11-16 11:06:47,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1033, Unknown=0, NotChecked=0, Total=1122 [2022-11-16 11:06:47,324 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-16 11:08:27,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:08:27,805 INFO L93 Difference]: Finished difference Result 15080 states and 20690 transitions. [2022-11-16 11:08:27,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 682 states. [2022-11-16 11:08:27,806 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-16 11:08:27,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:08:27,917 INFO L225 Difference]: With dead ends: 15080 [2022-11-16 11:08:27,917 INFO L226 Difference]: Without dead ends: 14483 [2022-11-16 11:08:28,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1450 GetRequests, 738 SyntacticMatches, 1 SemanticMatches, 711 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 228850 ImplicationChecksByTransitivity, 63.9s TimeCoverageRelationStatistics Valid=27145, Invalid=480511, Unknown=0, NotChecked=0, Total=507656 [2022-11-16 11:08:28,004 INFO L413 NwaCegarLoop]: 943 mSDtfsCounter, 8555 mSDsluCounter, 18694 mSDsCounter, 0 mSdLazyCounter, 29382 mSolverCounterSat, 9396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 26.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8555 SdHoareTripleChecker+Valid, 19637 SdHoareTripleChecker+Invalid, 38778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.4s SdHoareTripleChecker+Time, 9396 IncrementalHoareTripleChecker+Valid, 29382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 31.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:08:28,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8555 Valid, 19637 Invalid, 38778 Unknown, 0 Unchecked, 0.4s Time], IncrementalHoareTripleChecker [9396 Valid, 29382 Invalid, 0 Unknown, 0 Unchecked, 31.2s Time] [2022-11-16 11:08:28,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14483 states. [2022-11-16 11:08:29,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14483 to 3550. [2022-11-16 11:08:29,303 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-16 11:08:29,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3550 states to 3550 states and 4550 transitions. [2022-11-16 11:08:29,317 INFO L78 Accepts]: Start accepts. Automaton has 3550 states and 4550 transitions. Word has length 340 [2022-11-16 11:08:29,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:08:29,318 INFO L495 AbstractCegarLoop]: Abstraction has 3550 states and 4550 transitions. [2022-11-16 11:08:29,319 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-16 11:08:29,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3550 states and 4550 transitions. [2022-11-16 11:08:29,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2022-11-16 11:08:29,330 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:08:29,331 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-16 11:08:29,339 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-11-16 11:08:29,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-11-16 11:08:29,539 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:08:29,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:08:29,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1208992398, now seen corresponding path program 1 times [2022-11-16 11:08:29,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:08:29,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857104437] [2022-11-16 11:08:29,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:08:29,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:08:29,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:08:31,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:08:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:08:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:08:31,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:08:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:08:31,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:08:31,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:08:31,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:08:31,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:08:31,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:08:31,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:08:31,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:08:31,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:08:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:08:31,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:08:31,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:08:31,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-16 11:08:31,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-16 11:08:31,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-11-16 11:08:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-16 11:08:31,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 250 [2022-11-16 11:08:31,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-11-16 11:08:31,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 267 [2022-11-16 11:08:31,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-11-16 11:08:31,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 285 [2022-11-16 11:08:31,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 301 [2022-11-16 11:08:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 310 [2022-11-16 11:08:31,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 319 [2022-11-16 11:08:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 327 [2022-11-16 11:08:31,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:31,760 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-16 11:08:31,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:08:31,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857104437] [2022-11-16 11:08:31,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857104437] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:08:31,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1417302061] [2022-11-16 11:08:31,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:08:31,761 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:08:31,762 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:08:31,763 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:08:31,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-11-16 11:08:32,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:08:32,136 INFO L263 TraceCheckSpWp]: Trace formula consists of 1262 conjuncts, 36 conjunts are in the unsatisfiable core [2022-11-16 11:08:32,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:08:32,974 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-16 11:08:32,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:08:34,047 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-16 11:08:34,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1417302061] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:08:34,048 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:08:34,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 13, 13] total 41 [2022-11-16 11:08:34,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224773872] [2022-11-16 11:08:34,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:08:34,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-11-16 11:08:34,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:08:34,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-11-16 11:08:34,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=1537, Unknown=0, NotChecked=0, Total=1640 [2022-11-16 11:08:34,052 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-16 11:09:14,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:09:14,898 INFO L93 Difference]: Finished difference Result 11327 states and 14716 transitions. [2022-11-16 11:09:14,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 298 states. [2022-11-16 11:09:14,899 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-16 11:09:14,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:09:14,925 INFO L225 Difference]: With dead ends: 11327 [2022-11-16 11:09:14,926 INFO L226 Difference]: Without dead ends: 8263 [2022-11-16 11:09:14,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1070 GetRequests, 736 SyntacticMatches, 1 SemanticMatches, 333 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42686 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=6927, Invalid=104963, Unknown=0, NotChecked=0, Total=111890 [2022-11-16 11:09:14,941 INFO L413 NwaCegarLoop]: 986 mSDtfsCounter, 6157 mSDsluCounter, 20591 mSDsCounter, 0 mSdLazyCounter, 24389 mSolverCounterSat, 2982 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6158 SdHoareTripleChecker+Valid, 21577 SdHoareTripleChecker+Invalid, 27371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.4s SdHoareTripleChecker+Time, 2982 IncrementalHoareTripleChecker+Valid, 24389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:09:14,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6158 Valid, 21577 Invalid, 27371 Unknown, 0 Unchecked, 0.4s Time], IncrementalHoareTripleChecker [2982 Valid, 24389 Invalid, 0 Unknown, 0 Unchecked, 19.1s Time] [2022-11-16 11:09:14,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8263 states. [2022-11-16 11:09:15,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8263 to 2862. [2022-11-16 11:09:15,668 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-16 11:09:15,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2862 states to 2862 states and 3569 transitions. [2022-11-16 11:09:15,678 INFO L78 Accepts]: Start accepts. Automaton has 2862 states and 3569 transitions. Word has length 341 [2022-11-16 11:09:15,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:09:15,679 INFO L495 AbstractCegarLoop]: Abstraction has 2862 states and 3569 transitions. [2022-11-16 11:09:15,679 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-16 11:09:15,679 INFO L276 IsEmpty]: Start isEmpty. Operand 2862 states and 3569 transitions. [2022-11-16 11:09:15,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2022-11-16 11:09:15,688 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:09:15,689 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-16 11:09:15,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-11-16 11:09:15,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-11-16 11:09:15,897 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:09:15,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:09:15,898 INFO L85 PathProgramCache]: Analyzing trace with hash 6096405, now seen corresponding path program 1 times [2022-11-16 11:09:15,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:09:15,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974895022] [2022-11-16 11:09:15,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:09:15,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:09:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:09:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:09:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:09:16,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:09:16,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:09:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:09:16,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:09:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:09:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:09:16,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:09:16,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:09:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:09:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:09:16,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:09:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:09:16,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:09:16,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:09:16,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-16 11:09:16,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-16 11:09:16,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-16 11:09:16,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-11-16 11:09:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-11-16 11:09:16,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-16 11:09:16,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-11-16 11:09:16,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-11-16 11:09:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-11-16 11:09:16,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-11-16 11:09:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-11-16 11:09:16,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-11-16 11:09:16,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-11-16 11:09:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:16,204 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-16 11:09:16,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:09:16,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974895022] [2022-11-16 11:09:16,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974895022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:09:16,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:09:16,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:09:16,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889570729] [2022-11-16 11:09:16,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:09:16,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:09:16,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:09:16,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:09:16,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:09:16,209 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-16 11:09:17,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:09:17,289 INFO L93 Difference]: Finished difference Result 5813 states and 7243 transitions. [2022-11-16 11:09:17,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:09:17,290 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-16 11:09:17,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:09:17,300 INFO L225 Difference]: With dead ends: 5813 [2022-11-16 11:09:17,300 INFO L226 Difference]: Without dead ends: 2820 [2022-11-16 11:09:17,306 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-16 11:09:17,307 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 111 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-16 11:09:17,307 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-16 11:09:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2022-11-16 11:09:18,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2820. [2022-11-16 11:09:18,107 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-16 11:09:18,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2820 states to 2820 states and 3443 transitions. [2022-11-16 11:09:18,115 INFO L78 Accepts]: Start accepts. Automaton has 2820 states and 3443 transitions. Word has length 342 [2022-11-16 11:09:18,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:09:18,117 INFO L495 AbstractCegarLoop]: Abstraction has 2820 states and 3443 transitions. [2022-11-16 11:09:18,117 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-16 11:09:18,117 INFO L276 IsEmpty]: Start isEmpty. Operand 2820 states and 3443 transitions. [2022-11-16 11:09:18,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2022-11-16 11:09:18,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:09:18,128 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-16 11:09:18,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-11-16 11:09:18,129 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:09:18,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:09:18,130 INFO L85 PathProgramCache]: Analyzing trace with hash -917418757, now seen corresponding path program 1 times [2022-11-16 11:09:18,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:09:18,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618058089] [2022-11-16 11:09:18,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:09:18,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:09:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:09:18,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:09:18,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:09:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:09:18,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:09:18,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:09:18,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:09:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:09:18,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:09:18,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:09:18,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:09:18,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:09:18,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:09:18,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:09:18,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:09:18,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:09:18,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:09:18,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-16 11:09:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-16 11:09:18,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-16 11:09:18,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-11-16 11:09:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-11-16 11:09:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-16 11:09:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-11-16 11:09:18,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:18,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-11-16 11:09:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:19,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-11-16 11:09:19,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:19,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-11-16 11:09:19,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:19,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-11-16 11:09:19,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:19,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-11-16 11:09:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:19,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-11-16 11:09:19,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:19,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-11-16 11:09:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:19,091 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-16 11:09:19,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:09:19,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618058089] [2022-11-16 11:09:19,092 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618058089] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:09:19,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675037052] [2022-11-16 11:09:19,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:09:19,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:09:19,092 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:09:19,093 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:09:19,114 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-11-16 11:09:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:19,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-16 11:09:19,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:09:19,705 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-16 11:09:19,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:09:20,549 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-16 11:09:20,550 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675037052] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:09:20,550 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:09:20,550 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 23 [2022-11-16 11:09:20,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099478921] [2022-11-16 11:09:20,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:09:20,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-11-16 11:09:20,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:09:20,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-11-16 11:09:20,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=435, Unknown=0, NotChecked=0, Total=506 [2022-11-16 11:09:20,553 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-16 11:09:29,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:09:29,424 INFO L93 Difference]: Finished difference Result 12193 states and 15464 transitions. [2022-11-16 11:09:29,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-11-16 11:09:29,424 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-16 11:09:29,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:09:29,464 INFO L225 Difference]: With dead ends: 12193 [2022-11-16 11:09:29,464 INFO L226 Difference]: Without dead ends: 10348 [2022-11-16 11:09:29,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 859 GetRequests, 786 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1190 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=801, Invalid=4169, Unknown=0, NotChecked=0, Total=4970 [2022-11-16 11:09:29,473 INFO L413 NwaCegarLoop]: 795 mSDtfsCounter, 1934 mSDsluCounter, 7689 mSDsCounter, 0 mSdLazyCounter, 3791 mSolverCounterSat, 864 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1954 SdHoareTripleChecker+Valid, 8484 SdHoareTripleChecker+Invalid, 4655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 864 IncrementalHoareTripleChecker+Valid, 3791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:09:29,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1954 Valid, 8484 Invalid, 4655 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [864 Valid, 3791 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-11-16 11:09:29,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10348 states. [2022-11-16 11:09:31,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10348 to 5037. [2022-11-16 11:09:31,185 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-16 11:09:31,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5037 states to 5037 states and 6156 transitions. [2022-11-16 11:09:31,199 INFO L78 Accepts]: Start accepts. Automaton has 5037 states and 6156 transitions. Word has length 352 [2022-11-16 11:09:31,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:09:31,200 INFO L495 AbstractCegarLoop]: Abstraction has 5037 states and 6156 transitions. [2022-11-16 11:09:31,200 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-16 11:09:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand 5037 states and 6156 transitions. [2022-11-16 11:09:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2022-11-16 11:09:31,213 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:09:31,214 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-16 11:09:31,226 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-11-16 11:09:31,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:09:31,420 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:09:31,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:09:31,420 INFO L85 PathProgramCache]: Analyzing trace with hash 1818725745, now seen corresponding path program 1 times [2022-11-16 11:09:31,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:09:31,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811088884] [2022-11-16 11:09:31,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:09:31,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:09:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:32,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:09:32,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:32,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:09:32,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:32,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:09:32,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:32,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:09:32,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:32,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:09:32,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:32,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:09:32,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:32,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:09:32,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:32,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:09:32,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:32,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:09:32,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:32,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:09:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:32,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:09:32,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:32,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:09:32,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:32,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:09:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:32,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:09:32,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:32,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:09:32,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:32,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:09:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:33,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:09:33,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:33,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-16 11:09:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:33,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-16 11:09:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:33,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-16 11:09:33,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:33,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-11-16 11:09:33,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:33,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-11-16 11:09:33,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:33,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-16 11:09:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:33,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 268 [2022-11-16 11:09:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:33,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-11-16 11:09:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:33,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-11-16 11:09:33,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:33,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-11-16 11:09:33,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:33,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-11-16 11:09:33,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:33,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 320 [2022-11-16 11:09:33,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:33,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 328 [2022-11-16 11:09:33,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:33,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 337 [2022-11-16 11:09:33,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:33,114 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-16 11:09:33,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:09:33,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811088884] [2022-11-16 11:09:33,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1811088884] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:09:33,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423095763] [2022-11-16 11:09:33,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:09:33,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:09:33,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:09:33,117 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:09:33,119 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-11-16 11:09:33,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:09:33,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-16 11:09:33,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:09:34,244 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-16 11:09:34,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:09:35,316 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-16 11:09:35,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423095763] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:09:35,316 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:09:35,316 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15, 19] total 49 [2022-11-16 11:09:35,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062916682] [2022-11-16 11:09:35,317 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:09:35,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-16 11:09:35,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:09:35,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-16 11:09:35,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=2221, Unknown=0, NotChecked=0, Total=2352 [2022-11-16 11:09:35,320 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-16 11:10:11,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:11,321 INFO L93 Difference]: Finished difference Result 27541 states and 37011 transitions. [2022-11-16 11:10:11,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 214 states. [2022-11-16 11:10:11,322 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-16 11:10:11,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:11,402 INFO L225 Difference]: With dead ends: 27541 [2022-11-16 11:10:11,402 INFO L226 Difference]: Without dead ends: 23223 [2022-11-16 11:10:11,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1013 GetRequests, 756 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22799 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=4015, Invalid=62807, Unknown=0, NotChecked=0, Total=66822 [2022-11-16 11:10:11,421 INFO L413 NwaCegarLoop]: 643 mSDtfsCounter, 4128 mSDsluCounter, 18223 mSDsCounter, 0 mSdLazyCounter, 21240 mSolverCounterSat, 1743 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4140 SdHoareTripleChecker+Valid, 18866 SdHoareTripleChecker+Invalid, 22983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1743 IncrementalHoareTripleChecker+Valid, 21240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:11,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4140 Valid, 18866 Invalid, 22983 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1743 Valid, 21240 Invalid, 0 Unknown, 0 Unchecked, 15.0s Time] [2022-11-16 11:10:11,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23223 states. [2022-11-16 11:10:13,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23223 to 5495. [2022-11-16 11:10:13,598 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-16 11:10:13,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5495 states to 5495 states and 6674 transitions. [2022-11-16 11:10:13,619 INFO L78 Accepts]: Start accepts. Automaton has 5495 states and 6674 transitions. Word has length 352 [2022-11-16 11:10:13,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:13,620 INFO L495 AbstractCegarLoop]: Abstraction has 5495 states and 6674 transitions. [2022-11-16 11:10:13,620 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-16 11:10:13,621 INFO L276 IsEmpty]: Start isEmpty. Operand 5495 states and 6674 transitions. [2022-11-16 11:10:13,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2022-11-16 11:10:13,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:13,642 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-16 11:10:13,655 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-11-16 11:10:13,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-11-16 11:10:13,849 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:10:13,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:13,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1706367875, now seen corresponding path program 1 times [2022-11-16 11:10:13,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:13,850 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32928324] [2022-11-16 11:10:13,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:13,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:13,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:13,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:10:13,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:10:14,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-16 11:10:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-11-16 11:10:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-16 11:10:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:10:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:10:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:10:14,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-16 11:10:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:10:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:10:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:10:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-11-16 11:10:14,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:10:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:10:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:10:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-16 11:10:14,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-16 11:10:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-11-16 11:10:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 236 [2022-11-16 11:10:14,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-11-16 11:10:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2022-11-16 11:10:14,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-11-16 11:10:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-11-16 11:10:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-11-16 11:10:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-11-16 11:10:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-11-16 11:10:14,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-11-16 11:10:14,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-11-16 11:10:14,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-11-16 11:10:14,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-11-16 11:10:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,131 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-16 11:10:14,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:14,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32928324] [2022-11-16 11:10:14,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32928324] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:10:14,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1644555720] [2022-11-16 11:10:14,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:14,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:10:14,132 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:10:14,134 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:10:14,162 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-11-16 11:10:14,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:14,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 1287 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-16 11:10:14,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:10:14,472 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-16 11:10:14,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:10:14,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1644555720] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:14,473 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:10:14,473 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 5 [2022-11-16 11:10:14,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710212640] [2022-11-16 11:10:14,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:14,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:10:14,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:14,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:10:14,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:10:14,475 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-16 11:10:15,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:15,841 INFO L93 Difference]: Finished difference Result 10533 states and 12827 transitions. [2022-11-16 11:10:15,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:10:15,841 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-16 11:10:15,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:15,853 INFO L225 Difference]: With dead ends: 10533 [2022-11-16 11:10:15,854 INFO L226 Difference]: Without dead ends: 5039 [2022-11-16 11:10:15,862 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-16 11:10:15,863 INFO L413 NwaCegarLoop]: 225 mSDtfsCounter, 28 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-16 11:10:15,863 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-16 11:10:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5039 states. [2022-11-16 11:10:17,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5039 to 5039. [2022-11-16 11:10:17,351 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-16 11:10:17,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5039 states to 5039 states and 6146 transitions. [2022-11-16 11:10:17,366 INFO L78 Accepts]: Start accepts. Automaton has 5039 states and 6146 transitions. Word has length 355 [2022-11-16 11:10:17,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:17,366 INFO L495 AbstractCegarLoop]: Abstraction has 5039 states and 6146 transitions. [2022-11-16 11:10:17,367 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-16 11:10:17,367 INFO L276 IsEmpty]: Start isEmpty. Operand 5039 states and 6146 transitions. [2022-11-16 11:10:17,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2022-11-16 11:10:17,381 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:17,382 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-16 11:10:17,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-11-16 11:10:17,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-11-16 11:10:17,590 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:10:17,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:17,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1005231542, now seen corresponding path program 1 times [2022-11-16 11:10:17,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:17,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683069857] [2022-11-16 11:10:17,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:17,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:17,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:10:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:10:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:10:17,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:10:17,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:10:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:10:17,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:10:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:10:17,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:10:17,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:10:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:10:17,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:10:17,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:10:17,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:10:17,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:10:17,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:10:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:10:17,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-11-16 11:10:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-16 11:10:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-16 11:10:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-11-16 11:10:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-11-16 11:10:17,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-11-16 11:10:17,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-11-16 11:10:17,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 278 [2022-11-16 11:10:17,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-11-16 11:10:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-11-16 11:10:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 312 [2022-11-16 11:10:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 321 [2022-11-16 11:10:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-11-16 11:10:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 340 [2022-11-16 11:10:17,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-11-16 11:10:17,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:17,881 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-16 11:10:17,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:17,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683069857] [2022-11-16 11:10:17,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683069857] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:17,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:17,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:10:17,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767640494] [2022-11-16 11:10:17,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:17,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:10:17,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:17,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:10:17,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:10:17,884 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-16 11:10:19,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:19,115 INFO L93 Difference]: Finished difference Result 6723 states and 8219 transitions. [2022-11-16 11:10:19,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:10:19,116 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-16 11:10:19,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:19,125 INFO L225 Difference]: With dead ends: 6723 [2022-11-16 11:10:19,125 INFO L226 Difference]: Without dead ends: 2436 [2022-11-16 11:10:19,134 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-16 11:10:19,134 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:19,135 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.2s Time] [2022-11-16 11:10:19,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2022-11-16 11:10:19,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2436. [2022-11-16 11:10:19,979 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-16 11:10:19,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2436 states to 2436 states and 2930 transitions. [2022-11-16 11:10:19,984 INFO L78 Accepts]: Start accepts. Automaton has 2436 states and 2930 transitions. Word has length 362 [2022-11-16 11:10:19,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:19,985 INFO L495 AbstractCegarLoop]: Abstraction has 2436 states and 2930 transitions. [2022-11-16 11:10:19,986 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-16 11:10:19,986 INFO L276 IsEmpty]: Start isEmpty. Operand 2436 states and 2930 transitions. [2022-11-16 11:10:19,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2022-11-16 11:10:19,994 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:19,994 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-16 11:10:19,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-11-16 11:10:19,995 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:10:19,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:19,996 INFO L85 PathProgramCache]: Analyzing trace with hash -294846551, now seen corresponding path program 1 times [2022-11-16 11:10:19,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:19,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025808893] [2022-11-16 11:10:19,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:19,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:10:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:10:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:10:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:10:21,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:10:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:10:21,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:10:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:10:21,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:10:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:10:21,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:10:21,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:10:21,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:10:21,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:10:21,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:10:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:10:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:10:21,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-16 11:10:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-16 11:10:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-11-16 11:10:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-16 11:10:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-11-16 11:10:21,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-11-16 11:10:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-11-16 11:10:21,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-11-16 11:10:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-11-16 11:10:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2022-11-16 11:10:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2022-11-16 11:10:21,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 322 [2022-11-16 11:10:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 331 [2022-11-16 11:10:21,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-11-16 11:10:21,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-11-16 11:10:21,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,436 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-16 11:10:21,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:21,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025808893] [2022-11-16 11:10:21,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025808893] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:10:21,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109082571] [2022-11-16 11:10:21,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:21,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:10:21,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:10:21,443 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:10:21,475 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-11-16 11:10:21,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:21,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 1313 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-16 11:10:21,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:10:23,842 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-16 11:10:23,842 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:10:25,870 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-16 11:10:25,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109082571] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:10:25,871 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:10:25,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 27, 21] total 64 [2022-11-16 11:10:25,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101158297] [2022-11-16 11:10:25,872 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:10:25,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-11-16 11:10:25,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:25,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-11-16 11:10:25,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=3798, Unknown=0, NotChecked=0, Total=4032 [2022-11-16 11:10:25,875 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-16 11:10:56,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:56,244 INFO L93 Difference]: Finished difference Result 9294 states and 12083 transitions. [2022-11-16 11:10:56,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2022-11-16 11:10:56,246 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-16 11:10:56,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:56,273 INFO L225 Difference]: With dead ends: 9294 [2022-11-16 11:10:56,273 INFO L226 Difference]: Without dead ends: 7373 [2022-11-16 11:10:56,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 964 GetRequests, 763 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11420 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=2730, Invalid=38276, Unknown=0, NotChecked=0, Total=41006 [2022-11-16 11:10:56,282 INFO L413 NwaCegarLoop]: 649 mSDtfsCounter, 2712 mSDsluCounter, 23828 mSDsCounter, 0 mSdLazyCounter, 24030 mSolverCounterSat, 1243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2725 SdHoareTripleChecker+Valid, 24477 SdHoareTripleChecker+Invalid, 25273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1243 IncrementalHoareTripleChecker+Valid, 24030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:56,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2725 Valid, 24477 Invalid, 25273 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1243 Valid, 24030 Invalid, 0 Unknown, 0 Unchecked, 17.2s Time] [2022-11-16 11:10:56,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7373 states. [2022-11-16 11:10:57,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7373 to 2442. [2022-11-16 11:10:57,429 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-16 11:10:57,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2442 states to 2442 states and 2930 transitions. [2022-11-16 11:10:57,436 INFO L78 Accepts]: Start accepts. Automaton has 2442 states and 2930 transitions. Word has length 363 [2022-11-16 11:10:57,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:57,437 INFO L495 AbstractCegarLoop]: Abstraction has 2442 states and 2930 transitions. [2022-11-16 11:10:57,437 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-16 11:10:57,437 INFO L276 IsEmpty]: Start isEmpty. Operand 2442 states and 2930 transitions. [2022-11-16 11:10:57,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2022-11-16 11:10:57,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:57,441 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-16 11:10:57,451 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-11-16 11:10:57,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:10:57,642 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:10:57,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:57,643 INFO L85 PathProgramCache]: Analyzing trace with hash 325853320, now seen corresponding path program 1 times [2022-11-16 11:10:57,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:57,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163501924] [2022-11-16 11:10:57,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:57,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:57,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:10:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:10:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:10:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:10:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:10:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:10:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:10:57,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:10:57,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:10:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:10:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:10:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:10:57,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:10:57,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:10:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:10:57,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:10:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:10:57,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-16 11:10:57,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-16 11:10:57,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-11-16 11:10:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-11-16 11:10:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 253 [2022-11-16 11:10:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 264 [2022-11-16 11:10:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 273 [2022-11-16 11:10:57,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 283 [2022-11-16 11:10:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2022-11-16 11:10:57,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-11-16 11:10:57,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 308 [2022-11-16 11:10:57,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-11-16 11:10:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-11-16 11:10:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2022-11-16 11:10:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2022-11-16 11:10:57,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 359 [2022-11-16 11:10:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:10:57,993 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-16 11:10:57,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:10:57,994 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163501924] [2022-11-16 11:10:57,994 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163501924] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:10:57,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:10:57,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:10:57,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192072884] [2022-11-16 11:10:57,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:10:57,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:10:57,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:10:57,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:10:57,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:10:57,999 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-16 11:10:59,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:10:59,127 INFO L93 Difference]: Finished difference Result 4359 states and 5266 transitions. [2022-11-16 11:10:59,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:10:59,127 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-16 11:10:59,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:10:59,135 INFO L225 Difference]: With dead ends: 4359 [2022-11-16 11:10:59,135 INFO L226 Difference]: Without dead ends: 2350 [2022-11-16 11:10:59,138 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-16 11:10:59,139 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.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:10:59,139 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.3s Time] [2022-11-16 11:10:59,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2350 states. [2022-11-16 11:10:59,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2350 to 2350. [2022-11-16 11:10:59,855 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-16 11:10:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2350 states to 2350 states and 2816 transitions. [2022-11-16 11:10:59,861 INFO L78 Accepts]: Start accepts. Automaton has 2350 states and 2816 transitions. Word has length 374 [2022-11-16 11:10:59,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:10:59,862 INFO L495 AbstractCegarLoop]: Abstraction has 2350 states and 2816 transitions. [2022-11-16 11:10:59,862 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-16 11:10:59,862 INFO L276 IsEmpty]: Start isEmpty. Operand 2350 states and 2816 transitions. [2022-11-16 11:10:59,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2022-11-16 11:10:59,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:10:59,869 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-16 11:10:59,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-11-16 11:10:59,869 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:10:59,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:10:59,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1942345502, now seen corresponding path program 1 times [2022-11-16 11:10:59,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:10:59,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1868308536] [2022-11-16 11:10:59,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:10:59,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:10:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:11:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:11:00,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:11:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:11:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:11:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:11:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:11:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:11:00,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:11:00,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:11:00,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:11:00,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:11:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:11:00,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:11:00,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:11:00,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:11:00,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:11:00,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-16 11:11:00,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-16 11:11:00,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-11-16 11:11:00,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-16 11:11:00,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-11-16 11:11:00,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-11-16 11:11:00,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-11-16 11:11:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-11-16 11:11:00,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 288 [2022-11-16 11:11:00,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 298 [2022-11-16 11:11:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2022-11-16 11:11:00,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 324 [2022-11-16 11:11:00,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 333 [2022-11-16 11:11:00,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 342 [2022-11-16 11:11:00,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 350 [2022-11-16 11:11:00,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2022-11-16 11:11:00,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 366 [2022-11-16 11:11:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,193 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-16 11:11:00,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:11:00,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1868308536] [2022-11-16 11:11:00,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1868308536] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:11:00,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1925576548] [2022-11-16 11:11:00,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:11:00,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:11:00,195 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:11:00,196 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:11:00,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-11-16 11:11:00,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:00,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 1363 conjuncts, 12 conjunts are in the unsatisfiable core [2022-11-16 11:11:00,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:11:01,349 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-16 11:11:01,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:11:01,865 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-16 11:11:01,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1925576548] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:11:01,866 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:11:01,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 20 [2022-11-16 11:11:01,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91624463] [2022-11-16 11:11:01,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:11:01,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 11:11:01,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:11:01,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 11:11:01,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:11:01,870 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-16 11:11:13,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:11:13,000 INFO L93 Difference]: Finished difference Result 10257 states and 13098 transitions. [2022-11-16 11:11:13,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2022-11-16 11:11:13,001 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-16 11:11:13,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:11:13,018 INFO L225 Difference]: With dead ends: 10257 [2022-11-16 11:11:13,018 INFO L226 Difference]: Without dead ends: 8576 [2022-11-16 11:11:13,023 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-16 11:11:13,023 INFO L413 NwaCegarLoop]: 494 mSDtfsCounter, 2653 mSDsluCounter, 5517 mSDsCounter, 0 mSdLazyCounter, 5827 mSolverCounterSat, 1056 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2663 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.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:11:13,024 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2663 Valid, 6011 Invalid, 6883 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1056 Valid, 5827 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-16 11:11:13,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8576 states. [2022-11-16 11:11:14,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8576 to 3984. [2022-11-16 11:11:14,464 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-16 11:11:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3984 states to 3984 states and 4795 transitions. [2022-11-16 11:11:14,477 INFO L78 Accepts]: Start accepts. Automaton has 3984 states and 4795 transitions. Word has length 379 [2022-11-16 11:11:14,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:11:14,478 INFO L495 AbstractCegarLoop]: Abstraction has 3984 states and 4795 transitions. [2022-11-16 11:11:14,478 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-16 11:11:14,479 INFO L276 IsEmpty]: Start isEmpty. Operand 3984 states and 4795 transitions. [2022-11-16 11:11:14,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2022-11-16 11:11:14,488 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:11:14,488 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-16 11:11:14,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-11-16 11:11:14,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-11-16 11:11:14,705 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:11:14,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:11:14,706 INFO L85 PathProgramCache]: Analyzing trace with hash -996014735, now seen corresponding path program 1 times [2022-11-16 11:11:14,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:11:14,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36664732] [2022-11-16 11:11:14,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:11:14,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:11:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:15,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:11:15,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:15,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:11:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:15,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:11:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:15,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:11:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:15,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:11:15,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:15,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:11:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:15,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:11:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:15,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:11:15,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:15,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:11:15,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:15,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:11:15,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:15,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:11:15,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:15,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:11:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:15,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:11:15,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:15,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:11:15,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:15,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:11:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:15,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:11:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:15,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:11:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:16,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-16 11:11:16,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:16,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-11-16 11:11:16,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:16,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 232 [2022-11-16 11:11:16,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:16,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-11-16 11:11:16,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:16,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-11-16 11:11:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:16,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 262 [2022-11-16 11:11:16,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:16,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-11-16 11:11:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:16,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-11-16 11:11:16,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:16,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-11-16 11:11:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:16,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 296 [2022-11-16 11:11:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:16,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 306 [2022-11-16 11:11:16,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:16,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 314 [2022-11-16 11:11:16,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:16,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 330 [2022-11-16 11:11:16,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:16,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 339 [2022-11-16 11:11:16,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:16,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 348 [2022-11-16 11:11:16,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:16,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 356 [2022-11-16 11:11:16,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:16,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-11-16 11:11:16,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:16,095 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-16 11:11:16,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:11:16,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36664732] [2022-11-16 11:11:16,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36664732] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:11:16,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210013081] [2022-11-16 11:11:16,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:11:16,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:11:16,097 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:11:16,098 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:11:16,111 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-11-16 11:11:16,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:16,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 1361 conjuncts, 19 conjunts are in the unsatisfiable core [2022-11-16 11:11:16,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:11:16,839 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-16 11:11:16,839 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:11:16,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210013081] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:11:16,840 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:11:16,840 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [17] total 25 [2022-11-16 11:11:16,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981595201] [2022-11-16 11:11:16,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:11:16,841 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:11:16,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:11:16,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:11:16,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=548, Unknown=0, NotChecked=0, Total=600 [2022-11-16 11:11:16,843 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-16 11:11:19,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:11:19,777 INFO L93 Difference]: Finished difference Result 8324 states and 10188 transitions. [2022-11-16 11:11:19,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-16 11:11:19,781 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-16 11:11:19,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:11:19,792 INFO L225 Difference]: With dead ends: 8324 [2022-11-16 11:11:19,792 INFO L226 Difference]: Without dead ends: 4985 [2022-11-16 11:11:19,798 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 440 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=241, Invalid=1829, Unknown=0, NotChecked=0, Total=2070 [2022-11-16 11:11:19,799 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 692 mSDsluCounter, 1972 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 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-16 11:11:19,799 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 2273 Invalid, 745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:11:19,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4985 states. [2022-11-16 11:11:20,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4985 to 3579. [2022-11-16 11:11:20,943 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-16 11:11:20,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3579 states to 3579 states and 4304 transitions. [2022-11-16 11:11:20,949 INFO L78 Accepts]: Start accepts. Automaton has 3579 states and 4304 transitions. Word has length 380 [2022-11-16 11:11:20,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:11:20,949 INFO L495 AbstractCegarLoop]: Abstraction has 3579 states and 4304 transitions. [2022-11-16 11:11:20,950 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-16 11:11:20,950 INFO L276 IsEmpty]: Start isEmpty. Operand 3579 states and 4304 transitions. [2022-11-16 11:11:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2022-11-16 11:11:20,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:11:20,956 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-16 11:11:20,967 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-11-16 11:11:21,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:11:21,163 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:11:21,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:11:21,163 INFO L85 PathProgramCache]: Analyzing trace with hash -48212473, now seen corresponding path program 1 times [2022-11-16 11:11:21,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:11:21,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5352290] [2022-11-16 11:11:21,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:11:21,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:11:21,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:21,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 11:11:21,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:21,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-16 11:11:21,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:21,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 11:11:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:21,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-16 11:11:21,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:21,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 11:11:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:21,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2022-11-16 11:11:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:21,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 11:11:21,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:21,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2022-11-16 11:11:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:21,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-16 11:11:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:21,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-16 11:11:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:21,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:11:21,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:21,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 11:11:21,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:21,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-11-16 11:11:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:21,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 11:11:21,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:21,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-16 11:11:21,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:21,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-16 11:11:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:21,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-11-16 11:11:21,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:22,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-11-16 11:11:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:22,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-11-16 11:11:22,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:22,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-11-16 11:11:22,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:22,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 242 [2022-11-16 11:11:22,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:22,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-11-16 11:11:22,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:22,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-11-16 11:11:22,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:22,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-11-16 11:11:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:22,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-16 11:11:22,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:22,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-11-16 11:11:22,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:22,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-11-16 11:11:22,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:22,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 307 [2022-11-16 11:11:22,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:22,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-11-16 11:11:22,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:22,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 332 [2022-11-16 11:11:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:22,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 341 [2022-11-16 11:11:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:22,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 349 [2022-11-16 11:11:22,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:22,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 358 [2022-11-16 11:11:22,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:22,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 368 [2022-11-16 11:11:22,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:22,119 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-16 11:11:22,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:11:22,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5352290] [2022-11-16 11:11:22,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5352290] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:11:22,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1138262729] [2022-11-16 11:11:22,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:11:22,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:11:22,121 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:11:22,122 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:11:22,133 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-11-16 11:11:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:11:22,491 INFO L263 TraceCheckSpWp]: Trace formula consists of 1363 conjuncts, 70 conjunts are in the unsatisfiable core [2022-11-16 11:11:22,500 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:11:24,439 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-16 11:11:24,439 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:11:33,259 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-16 11:11:33,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1138262729] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:11:33,260 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:11:33,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 27, 21] total 51 [2022-11-16 11:11:33,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713743441] [2022-11-16 11:11:33,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:11:33,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-11-16 11:11:33,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:11:33,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-11-16 11:11:33,265 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=2316, Unknown=3, NotChecked=0, Total=2550 [2022-11-16 11:11:33,265 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-16 11:11:43,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:11:43,834 INFO L93 Difference]: Finished difference Result 7858 states and 9801 transitions. [2022-11-16 11:11:43,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-11-16 11:11:43,835 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-16 11:11:43,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:11:43,849 INFO L225 Difference]: With dead ends: 7858 [2022-11-16 11:11:43,849 INFO L226 Difference]: Without dead ends: 4684 [2022-11-16 11:11:43,855 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 894 GetRequests, 806 SyntacticMatches, 3 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1803 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=841, Invalid=6638, Unknown=3, NotChecked=0, Total=7482 [2022-11-16 11:11:43,856 INFO L413 NwaCegarLoop]: 261 mSDtfsCounter, 1187 mSDsluCounter, 5936 mSDsCounter, 0 mSdLazyCounter, 4268 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 6197 SdHoareTripleChecker+Invalid, 4737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 4268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 164 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:11:43,856 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 6197 Invalid, 4737 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [305 Valid, 4268 Invalid, 0 Unknown, 164 Unchecked, 5.5s Time] [2022-11-16 11:11:43,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4684 states. [2022-11-16 11:11:45,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4684 to 3586. [2022-11-16 11:11:45,229 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-16 11:11:45,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3586 states to 3586 states and 4307 transitions. [2022-11-16 11:11:45,237 INFO L78 Accepts]: Start accepts. Automaton has 3586 states and 4307 transitions. Word has length 384 [2022-11-16 11:11:45,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:11:45,238 INFO L495 AbstractCegarLoop]: Abstraction has 3586 states and 4307 transitions. [2022-11-16 11:11:45,238 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-16 11:11:45,238 INFO L276 IsEmpty]: Start isEmpty. Operand 3586 states and 4307 transitions. [2022-11-16 11:11:45,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2022-11-16 11:11:45,243 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:11:45,244 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-16 11:11:45,250 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-11-16 11:11:45,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-11-16 11:11:45,444 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:11:45,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:11:45,445 INFO L85 PathProgramCache]: Analyzing trace with hash 552300336, now seen corresponding path program 1 times [2022-11-16 11:11:45,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:11:45,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779299067] [2022-11-16 11:11:45,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:11:45,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:11:45,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:11:45,534 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:11:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:11:45,824 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:11:45,825 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:11:45,826 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 11:11:45,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-11-16 11:11:45,832 INFO L444 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-16 11:11:45,838 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:11:46,147 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:11:46 BoogieIcfgContainer [2022-11-16 11:11:46,147 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:11:46,148 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:11:46,148 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:11:46,149 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:11:46,149 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:06:03" (3/4) ... [2022-11-16 11:11:46,151 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 11:11:46,504 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:11:46,506 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:11:46,506 INFO L158 Benchmark]: Toolchain (without parser) took 345168.98ms. Allocated memory was 146.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 109.0MB in the beginning and 2.1GB in the end (delta: -2.0GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-11-16 11:11:46,506 INFO L158 Benchmark]: CDTParser took 0.43ms. Allocated memory is still 146.8MB. Free memory was 119.1MB in the beginning and 119.1MB in the end (delta: 28.7kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:11:46,507 INFO L158 Benchmark]: CACSL2BoogieTranslator took 712.56ms. Allocated memory is still 146.8MB. Free memory was 108.6MB in the beginning and 114.2MB in the end (delta: -5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 11:11:46,507 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.97ms. Allocated memory is still 146.8MB. Free memory was 114.2MB in the beginning and 110.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-16 11:11:46,508 INFO L158 Benchmark]: Boogie Preprocessor took 48.15ms. Allocated memory is still 146.8MB. Free memory was 110.9MB in the beginning and 108.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:11:46,508 INFO L158 Benchmark]: RCFGBuilder took 1112.44ms. Allocated memory is still 146.8MB. Free memory was 108.8MB in the beginning and 78.6MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2022-11-16 11:11:46,509 INFO L158 Benchmark]: TraceAbstraction took 342860.01ms. Allocated memory was 146.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 78.1MB in the beginning and 781.1MB in the end (delta: -702.9MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2022-11-16 11:11:46,509 INFO L158 Benchmark]: Witness Printer took 357.63ms. Allocated memory is still 2.3GB. Free memory was 781.1MB in the beginning and 2.1GB in the end (delta: -1.3GB). Peak memory consumption was 6.8MB. Max. memory is 16.1GB. [2022-11-16 11:11:46,518 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.43ms. Allocated memory is still 146.8MB. Free memory was 119.1MB in the beginning and 119.1MB in the end (delta: 28.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 712.56ms. Allocated memory is still 146.8MB. Free memory was 108.6MB in the beginning and 114.2MB in the end (delta: -5.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.97ms. Allocated memory is still 146.8MB. Free memory was 114.2MB in the beginning and 110.9MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.15ms. Allocated memory is still 146.8MB. Free memory was 110.9MB in the beginning and 108.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1112.44ms. Allocated memory is still 146.8MB. Free memory was 108.8MB in the beginning and 78.6MB in the end (delta: 30.2MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 342860.01ms. Allocated memory was 146.8MB in the beginning and 2.3GB in the end (delta: 2.1GB). Free memory was 78.1MB in the beginning and 781.1MB in the end (delta: -702.9MB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 357.63ms. Allocated memory is still 2.3GB. Free memory was 781.1MB in the beginning and 2.1GB in the end (delta: -1.3GB). Peak memory consumption was 6.8MB. 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: [L47] _Bool gate2Failed_History_1 ; [L46] _Bool gate2Failed_History_0 ; [L48] _Bool gate2Failed_History_2 ; [L26] int8_t g1v_new ; [L37] _Bool gate2Failed ; [L30] port_t g3v ; [L28] int8_t g2v_old ; [L24] port_t g1v ; [L29] int8_t g2v_new ; [L45] _Bool gate1Failed_History_2 ; [L44] _Bool gate1Failed_History_1 ; [L43] _Bool gate1Failed_History_0 ; [L36] _Bool gate1Failed ; [L25] int8_t g1v_old ; [L23] msg_t nomsg = (msg_t )-1; [L31] int8_t g3v_old ; [L27] port_t g2v ; [L52] int8_t votedValue_History_0 ; [L53] int8_t votedValue_History_1 ; [L38] _Bool gate3Failed ; [L54] int8_t votedValue_History_2 ; [L39] msg_t VALUE1 ; [L49] _Bool gate3Failed_History_0 ; [L40] msg_t VALUE2 ; [L41] msg_t VALUE3 ; [L51] _Bool gate3Failed_History_2 ; [L32] int8_t g3v_new ; [L50] _Bool gate3Failed_History_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=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)=255, \old(history_id)=3, buf=255, 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)=255, \old(history_id)=3, buf=255, 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: 342.4s, OverallIterations: 50, TraceHistogramMax: 16, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.3s, AutomataDifference: 263.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 34456 SdHoareTripleChecker+Valid, 107.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 34025 mSDsluCounter, 145736 SdHoareTripleChecker+Invalid, 92.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 164 IncrementalHoareTripleChecker+Unchecked, 129822 mSDsCounter, 18945 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 122416 IncrementalHoareTripleChecker+Invalid, 141525 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 18945 mSolverCounterUnsat, 15914 mSDtfsCounter, 122416 mSolverCounterSat, 1.7s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 13057 GetRequests, 10969 SyntacticMatches, 24 SemanticMatches, 2064 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314498 ImplicationChecksByTransitivity, 128.5s 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: 17.7s AutomataMinimizationTime, 49 MinimizatonAttempts, 56109 StatesRemovedByMinimization, 33 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 1.5s SsaConstructionTime, 4.8s SatisfiabilityAnalysisTime, 47.1s 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-16 11:11:46,570 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ad050862-673a-4958-a4bf-bd3ec563dae3/bin/uautomizer-tPACEb0tL8/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