./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/config/TaipanReach.xml -i ../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2354c4d30c0335eb0a6c6e03cf8d087a440768412264986840e048ded8afea74 --- 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-2329fc7 [2022-12-14 06:04:43,010 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-14 06:04:43,011 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-14 06:04:43,023 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-14 06:04:43,024 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-14 06:04:43,025 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-14 06:04:43,025 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-14 06:04:43,026 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-14 06:04:43,027 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-14 06:04:43,028 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-14 06:04:43,028 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-14 06:04:43,029 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-14 06:04:43,029 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-14 06:04:43,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-14 06:04:43,031 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-14 06:04:43,031 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-14 06:04:43,032 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-14 06:04:43,033 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-14 06:04:43,033 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-14 06:04:43,034 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-14 06:04:43,035 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-14 06:04:43,036 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-14 06:04:43,037 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-14 06:04:43,038 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-14 06:04:43,039 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-14 06:04:43,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-14 06:04:43,040 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-14 06:04:43,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-14 06:04:43,041 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-14 06:04:43,041 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-14 06:04:43,041 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-14 06:04:43,042 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-14 06:04:43,042 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-14 06:04:43,043 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-14 06:04:43,043 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-14 06:04:43,044 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-14 06:04:43,044 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-14 06:04:43,044 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-14 06:04:43,044 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-14 06:04:43,045 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-14 06:04:43,045 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-14 06:04:43,046 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-12-14 06:04:43,059 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-14 06:04:43,059 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-14 06:04:43,060 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-14 06:04:43,060 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-14 06:04:43,060 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-14 06:04:43,060 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-14 06:04:43,060 INFO L138 SettingsManager]: * User list type=DISABLED [2022-12-14 06:04:43,061 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-12-14 06:04:43,061 INFO L138 SettingsManager]: * Explicit value domain=true [2022-12-14 06:04:43,061 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-12-14 06:04:43,061 INFO L138 SettingsManager]: * Octagon Domain=false [2022-12-14 06:04:43,061 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-12-14 06:04:43,061 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-12-14 06:04:43,061 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-12-14 06:04:43,062 INFO L138 SettingsManager]: * Interval Domain=false [2022-12-14 06:04:43,062 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-12-14 06:04:43,062 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-12-14 06:04:43,062 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-12-14 06:04:43,062 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-14 06:04:43,063 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-14 06:04:43,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-14 06:04:43,063 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-14 06:04:43,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-14 06:04:43,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-14 06:04:43,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-14 06:04:43,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-14 06:04:43,063 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-14 06:04:43,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-14 06:04:43,064 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-14 06:04:43,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-14 06:04:43,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-14 06:04:43,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-14 06:04:43,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:04:43,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-14 06:04:43,064 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-12-14 06:04:43,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-14 06:04:43,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-14 06:04:43,065 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-12-14 06:04:43,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-14 06:04:43,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-14 06:04:43,065 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-12-14 06:04:43,066 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_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/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_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh 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 -> Taipan 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 -> 2354c4d30c0335eb0a6c6e03cf8d087a440768412264986840e048ded8afea74 [2022-12-14 06:04:43,234 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-14 06:04:43,254 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-14 06:04:43,257 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-14 06:04:43,258 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-14 06:04:43,258 INFO L275 PluginConnector]: CDTParser initialized [2022-12-14 06:04:43,260 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2022-12-14 06:04:45,926 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-14 06:04:46,114 INFO L351 CDTParser]: Found 1 translation units. [2022-12-14 06:04:46,114 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2022-12-14 06:04:46,123 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/data/0398ac58f/224d817660df42ab9def3ee4e83a5eb1/FLAG4893aaebc [2022-12-14 06:04:46,137 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/data/0398ac58f/224d817660df42ab9def3ee4e83a5eb1 [2022-12-14 06:04:46,139 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-14 06:04:46,140 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-14 06:04:46,141 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-14 06:04:46,142 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-14 06:04:46,145 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-14 06:04:46,146 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:04:46" (1/1) ... [2022-12-14 06:04:46,147 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e521a50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:04:46, skipping insertion in model container [2022-12-14 06:04:46,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.12 06:04:46" (1/1) ... [2022-12-14 06:04:46,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-14 06:04:46,185 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-14 06:04:46,400 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c[14700,14713] [2022-12-14 06:04:46,404 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:04:46,414 INFO L203 MainTranslator]: Completed pre-run [2022-12-14 06:04:46,468 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c[14700,14713] [2022-12-14 06:04:46,468 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-14 06:04:46,484 INFO L208 MainTranslator]: Completed translation [2022-12-14 06:04:46,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:04:46 WrapperNode [2022-12-14 06:04:46,485 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-14 06:04:46,486 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-14 06:04:46,486 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-14 06:04:46,486 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-14 06:04:46,493 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:04:46" (1/1) ... [2022-12-14 06:04:46,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:04:46" (1/1) ... [2022-12-14 06:04:46,532 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 482 [2022-12-14 06:04:46,532 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-14 06:04:46,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-14 06:04:46,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-14 06:04:46,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-14 06:04:46,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:04:46" (1/1) ... [2022-12-14 06:04:46,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:04:46" (1/1) ... [2022-12-14 06:04:46,547 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:04:46" (1/1) ... [2022-12-14 06:04:46,548 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:04:46" (1/1) ... [2022-12-14 06:04:46,557 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:04:46" (1/1) ... [2022-12-14 06:04:46,563 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:04:46" (1/1) ... [2022-12-14 06:04:46,565 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:04:46" (1/1) ... [2022-12-14 06:04:46,567 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:04:46" (1/1) ... [2022-12-14 06:04:46,571 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-14 06:04:46,572 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-14 06:04:46,572 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-14 06:04:46,572 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-14 06:04:46,573 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:04:46" (1/1) ... [2022-12-14 06:04:46,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-14 06:04:46,588 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:04:46,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-14 06:04:46,601 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-14 06:04:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-12-14 06:04:46,630 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-12-14 06:04:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-14 06:04:46,630 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-12-14 06:04:46,631 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-12-14 06:04:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-12-14 06:04:46,631 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-12-14 06:04:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-12-14 06:04:46,631 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-12-14 06:04:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-12-14 06:04:46,631 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-12-14 06:04:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-14 06:04:46,631 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-12-14 06:04:46,631 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-12-14 06:04:46,632 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-14 06:04:46,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-14 06:04:46,632 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-12-14 06:04:46,632 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-12-14 06:04:46,722 INFO L235 CfgBuilder]: Building ICFG [2022-12-14 06:04:46,724 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-14 06:04:47,137 INFO L276 CfgBuilder]: Performing block encoding [2022-12-14 06:04:47,235 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-14 06:04:47,235 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-14 06:04:47,237 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:04:47 BoogieIcfgContainer [2022-12-14 06:04:47,237 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-14 06:04:47,238 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-14 06:04:47,238 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-14 06:04:47,241 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-14 06:04:47,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.12 06:04:46" (1/3) ... [2022-12-14 06:04:47,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac6980b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:04:47, skipping insertion in model container [2022-12-14 06:04:47,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.12 06:04:46" (2/3) ... [2022-12-14 06:04:47,242 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ac6980b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.12 06:04:47, skipping insertion in model container [2022-12-14 06:04:47,242 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:04:47" (3/3) ... [2022-12-14 06:04:47,243 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2022-12-14 06:04:47,256 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-14 06:04:47,256 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-14 06:04:47,291 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-14 06:04:47,296 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=FINITE_AUTOMATA, 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;@40b254f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-14 06:04:47,296 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-14 06:04:47,299 INFO L276 IsEmpty]: Start isEmpty. Operand has 150 states, 110 states have (on average 1.5363636363636364) internal successors, (169), 111 states have internal predecessors, (169), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-12-14 06:04:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-12-14 06:04:47,305 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:04:47,305 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:04:47,305 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:04:47,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:04:47,309 INFO L85 PathProgramCache]: Analyzing trace with hash 417223043, now seen corresponding path program 1 times [2022-12-14 06:04:47,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:04:47,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401486668] [2022-12-14 06:04:47,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:04:47,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:04:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:04:47,631 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:04:47,631 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:04:47,632 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401486668] [2022-12-14 06:04:47,632 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401486668] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:04:47,632 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:04:47,633 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:04:47,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143675601] [2022-12-14 06:04:47,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:04:47,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:04:47,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:04:47,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:04:47,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:04:47,661 INFO L87 Difference]: Start difference. First operand has 150 states, 110 states have (on average 1.5363636363636364) internal successors, (169), 111 states have internal predecessors, (169), 31 states have call successors, (31), 7 states have call predecessors, (31), 7 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 06:04:47,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:04:47,764 INFO L93 Difference]: Finished difference Result 301 states and 489 transitions. [2022-12-14 06:04:47,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:04:47,766 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 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 19 [2022-12-14 06:04:47,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:04:47,773 INFO L225 Difference]: With dead ends: 301 [2022-12-14 06:04:47,774 INFO L226 Difference]: Without dead ends: 153 [2022-12-14 06:04:47,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-12-14 06:04:47,780 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 5 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:04:47,781 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 638 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:04:47,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-12-14 06:04:47,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-12-14 06:04:47,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 113 states have (on average 1.5044247787610618) internal successors, (170), 113 states have internal predecessors, (170), 31 states have call successors, (31), 8 states have call predecessors, (31), 8 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2022-12-14 06:04:47,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 232 transitions. [2022-12-14 06:04:47,824 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 232 transitions. Word has length 19 [2022-12-14 06:04:47,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:04:47,825 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 232 transitions. [2022-12-14 06:04:47,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-14 06:04:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 232 transitions. [2022-12-14 06:04:47,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-12-14 06:04:47,827 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:04:47,827 INFO L195 NwaCegarLoop]: trace 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] [2022-12-14 06:04:47,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-14 06:04:47,828 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:04:47,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:04:47,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1492107668, now seen corresponding path program 1 times [2022-12-14 06:04:47,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:04:47,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371410150] [2022-12-14 06:04:47,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:04:47,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:04:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:04:47,969 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:04:47,969 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:04:47,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371410150] [2022-12-14 06:04:47,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371410150] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:04:47,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:04:47,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:04:47,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731085769] [2022-12-14 06:04:47,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:04:47,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 06:04:47,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:04:47,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 06:04:47,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:04:47,973 INFO L87 Difference]: Start difference. First operand 153 states and 232 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 06:04:48,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:04:48,218 INFO L93 Difference]: Finished difference Result 435 states and 675 transitions. [2022-12-14 06:04:48,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 06:04:48,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 30 [2022-12-14 06:04:48,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:04:48,222 INFO L225 Difference]: With dead ends: 435 [2022-12-14 06:04:48,222 INFO L226 Difference]: Without dead ends: 285 [2022-12-14 06:04:48,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:04:48,225 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 573 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 573 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:04:48,226 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [573 Valid, 596 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 06:04:48,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-12-14 06:04:48,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 187. [2022-12-14 06:04:48,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 142 states have (on average 1.5070422535211268) internal successors, (214), 142 states have internal predecessors, (214), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-12-14 06:04:48,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 282 transitions. [2022-12-14 06:04:48,257 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 282 transitions. Word has length 30 [2022-12-14 06:04:48,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:04:48,257 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 282 transitions. [2022-12-14 06:04:48,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 06:04:48,258 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 282 transitions. [2022-12-14 06:04:48,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-12-14 06:04:48,259 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:04:48,259 INFO L195 NwaCegarLoop]: trace 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] [2022-12-14 06:04:48,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-14 06:04:48,260 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:04:48,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:04:48,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1268001403, now seen corresponding path program 1 times [2022-12-14 06:04:48,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:04:48,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605464658] [2022-12-14 06:04:48,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:04:48,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:04:48,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:04:48,379 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:04:48,379 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:04:48,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605464658] [2022-12-14 06:04:48,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1605464658] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:04:48,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:04:48,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-14 06:04:48,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332661789] [2022-12-14 06:04:48,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:04:48,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-14 06:04:48,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:04:48,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-14 06:04:48,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-14 06:04:48,381 INFO L87 Difference]: Start difference. First operand 187 states and 282 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 06:04:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:04:48,601 INFO L93 Difference]: Finished difference Result 435 states and 673 transitions. [2022-12-14 06:04:48,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-14 06:04:48,602 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 31 [2022-12-14 06:04:48,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:04:48,603 INFO L225 Difference]: With dead ends: 435 [2022-12-14 06:04:48,603 INFO L226 Difference]: Without dead ends: 285 [2022-12-14 06:04:48,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:04:48,604 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 569 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 569 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:04:48,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [569 Valid, 599 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-14 06:04:48,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-12-14 06:04:48,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 187. [2022-12-14 06:04:48,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 142 states have (on average 1.5) internal successors, (213), 142 states have internal predecessors, (213), 34 states have call successors, (34), 10 states have call predecessors, (34), 10 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-12-14 06:04:48,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 281 transitions. [2022-12-14 06:04:48,619 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 281 transitions. Word has length 31 [2022-12-14 06:04:48,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:04:48,620 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 281 transitions. [2022-12-14 06:04:48,620 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-12-14 06:04:48,620 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 281 transitions. [2022-12-14 06:04:48,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-12-14 06:04:48,621 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:04:48,621 INFO L195 NwaCegarLoop]: trace 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] [2022-12-14 06:04:48,621 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-12-14 06:04:48,621 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:04:48,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:04:48,622 INFO L85 PathProgramCache]: Analyzing trace with hash -963253393, now seen corresponding path program 1 times [2022-12-14 06:04:48,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:04:48,622 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068003673] [2022-12-14 06:04:48,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:04:48,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:04:48,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:04:48,742 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:04:48,742 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:04:48,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068003673] [2022-12-14 06:04:48,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068003673] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:04:48,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:04:48,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:04:48,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289749661] [2022-12-14 06:04:48,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:04:48,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:04:48,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:04:48,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:04:48,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:04:48,744 INFO L87 Difference]: Start difference. First operand 187 states and 281 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 06:04:48,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:04:48,804 INFO L93 Difference]: Finished difference Result 342 states and 516 transitions. [2022-12-14 06:04:48,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:04:48,805 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 33 [2022-12-14 06:04:48,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:04:48,807 INFO L225 Difference]: With dead ends: 342 [2022-12-14 06:04:48,807 INFO L226 Difference]: Without dead ends: 192 [2022-12-14 06:04:48,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-12-14 06:04:48,808 INFO L413 NwaCegarLoop]: 218 mSDtfsCounter, 6 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:04:48,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 650 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:04:48,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-12-14 06:04:48,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-12-14 06:04:48,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 146 states have (on average 1.4863013698630136) internal successors, (217), 146 states have internal predecessors, (217), 34 states have call successors, (34), 11 states have call predecessors, (34), 11 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-12-14 06:04:48,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 285 transitions. [2022-12-14 06:04:48,819 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 285 transitions. Word has length 33 [2022-12-14 06:04:48,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:04:48,820 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 285 transitions. [2022-12-14 06:04:48,820 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 3 states have internal predecessors, (24), 2 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-12-14 06:04:48,820 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 285 transitions. [2022-12-14 06:04:48,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-12-14 06:04:48,821 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:04:48,821 INFO L195 NwaCegarLoop]: trace 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] [2022-12-14 06:04:48,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-14 06:04:48,821 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:04:48,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:04:48,822 INFO L85 PathProgramCache]: Analyzing trace with hash 760205813, now seen corresponding path program 1 times [2022-12-14 06:04:48,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:04:48,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896615208] [2022-12-14 06:04:48,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:04:48,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:04:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:04:48,959 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:04:48,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:04:48,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896615208] [2022-12-14 06:04:48,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896615208] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:04:48,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:04:48,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:04:48,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354076494] [2022-12-14 06:04:48,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:04:48,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:04:48,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:04:48,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:04:48,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:04:48,962 INFO L87 Difference]: Start difference. First operand 192 states and 285 transitions. Second operand has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-14 06:04:49,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:04:49,024 INFO L93 Difference]: Finished difference Result 352 states and 527 transitions. [2022-12-14 06:04:49,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:04:49,025 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 41 [2022-12-14 06:04:49,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:04:49,026 INFO L225 Difference]: With dead ends: 352 [2022-12-14 06:04:49,026 INFO L226 Difference]: Without dead ends: 197 [2022-12-14 06:04:49,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-12-14 06:04:49,028 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 6 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:04:49,028 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 636 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:04:49,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-12-14 06:04:49,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-12-14 06:04:49,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 150 states have (on average 1.4733333333333334) internal successors, (221), 150 states have internal predecessors, (221), 34 states have call successors, (34), 12 states have call predecessors, (34), 12 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-12-14 06:04:49,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 289 transitions. [2022-12-14 06:04:49,048 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 289 transitions. Word has length 41 [2022-12-14 06:04:49,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:04:49,048 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 289 transitions. [2022-12-14 06:04:49,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.5) internal successors, (30), 3 states have internal predecessors, (30), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-14 06:04:49,049 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 289 transitions. [2022-12-14 06:04:49,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 06:04:49,051 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:04:49,051 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:04:49,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-14 06:04:49,051 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:04:49,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:04:49,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1448994529, now seen corresponding path program 1 times [2022-12-14 06:04:49,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:04:49,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763756615] [2022-12-14 06:04:49,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:04:49,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:04:49,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:04:49,154 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:04:49,154 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:04:49,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763756615] [2022-12-14 06:04:49,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763756615] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:04:49,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:04:49,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:04:49,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3961110] [2022-12-14 06:04:49,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:04:49,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:04:49,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:04:49,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:04:49,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:04:49,156 INFO L87 Difference]: Start difference. First operand 197 states and 289 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 06:04:49,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:04:49,212 INFO L93 Difference]: Finished difference Result 361 states and 531 transitions. [2022-12-14 06:04:49,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:04:49,213 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 49 [2022-12-14 06:04:49,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:04:49,215 INFO L225 Difference]: With dead ends: 361 [2022-12-14 06:04:49,215 INFO L226 Difference]: Without dead ends: 201 [2022-12-14 06:04:49,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-12-14 06:04:49,216 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 5 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:04:49,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 645 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:04:49,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-12-14 06:04:49,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-12-14 06:04:49,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 153 states have (on average 1.4640522875816993) internal successors, (224), 153 states have internal predecessors, (224), 34 states have call successors, (34), 13 states have call predecessors, (34), 13 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-12-14 06:04:49,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 292 transitions. [2022-12-14 06:04:49,227 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 292 transitions. Word has length 49 [2022-12-14 06:04:49,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:04:49,227 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 292 transitions. [2022-12-14 06:04:49,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 06:04:49,227 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 292 transitions. [2022-12-14 06:04:49,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-12-14 06:04:49,228 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:04:49,228 INFO L195 NwaCegarLoop]: trace 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] [2022-12-14 06:04:49,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-14 06:04:49,228 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:04:49,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:04:49,229 INFO L85 PathProgramCache]: Analyzing trace with hash 947464774, now seen corresponding path program 1 times [2022-12-14 06:04:49,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:04:49,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757280120] [2022-12-14 06:04:49,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:04:49,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:04:49,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:04:49,328 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-14 06:04:49,328 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:04:49,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757280120] [2022-12-14 06:04:49,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757280120] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:04:49,329 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:04:49,329 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:04:49,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394466888] [2022-12-14 06:04:49,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:04:49,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:04:49,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:04:49,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:04:49,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:04:49,331 INFO L87 Difference]: Start difference. First operand 201 states and 292 transitions. Second operand has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 06:04:49,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:04:49,386 INFO L93 Difference]: Finished difference Result 370 states and 541 transitions. [2022-12-14 06:04:49,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:04:49,387 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 49 [2022-12-14 06:04:49,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:04:49,388 INFO L225 Difference]: With dead ends: 370 [2022-12-14 06:04:49,388 INFO L226 Difference]: Without dead ends: 206 [2022-12-14 06:04:49,389 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-12-14 06:04:49,389 INFO L413 NwaCegarLoop]: 215 mSDtfsCounter, 6 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:04:49,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 636 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:04:49,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-12-14 06:04:49,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-12-14 06:04:49,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 157 states have (on average 1.4522292993630572) internal successors, (228), 157 states have internal predecessors, (228), 34 states have call successors, (34), 14 states have call predecessors, (34), 14 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-12-14 06:04:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 296 transitions. [2022-12-14 06:04:49,404 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 296 transitions. Word has length 49 [2022-12-14 06:04:49,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:04:49,404 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 296 transitions. [2022-12-14 06:04:49,404 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.0) internal successors, (36), 3 states have internal predecessors, (36), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-12-14 06:04:49,404 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 296 transitions. [2022-12-14 06:04:49,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-12-14 06:04:49,405 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:04:49,405 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:04:49,405 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-14 06:04:49,405 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:04:49,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:04:49,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1175154758, now seen corresponding path program 1 times [2022-12-14 06:04:49,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:04:49,406 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243538933] [2022-12-14 06:04:49,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:04:49,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:04:49,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:04:49,518 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-12-14 06:04:49,518 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:04:49,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243538933] [2022-12-14 06:04:49,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243538933] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:04:49,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:04:49,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:04:49,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311397398] [2022-12-14 06:04:49,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:04:49,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:04:49,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:04:49,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:04:49,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:04:49,521 INFO L87 Difference]: Start difference. First operand 206 states and 296 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 06:04:49,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:04:49,571 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2022-12-14 06:04:49,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:04:49,572 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 57 [2022-12-14 06:04:49,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:04:49,574 INFO L225 Difference]: With dead ends: 381 [2022-12-14 06:04:49,574 INFO L226 Difference]: Without dead ends: 212 [2022-12-14 06:04:49,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-12-14 06:04:49,576 INFO L413 NwaCegarLoop]: 219 mSDtfsCounter, 7 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:04:49,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 647 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:04:49,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-12-14 06:04:49,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-12-14 06:04:49,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 212 states, 162 states have (on average 1.4382716049382716) internal successors, (233), 162 states have internal predecessors, (233), 34 states have call successors, (34), 15 states have call predecessors, (34), 15 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2022-12-14 06:04:49,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 301 transitions. [2022-12-14 06:04:49,585 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 301 transitions. Word has length 57 [2022-12-14 06:04:49,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:04:49,586 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 301 transitions. [2022-12-14 06:04:49,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 3 states have internal predecessors, (38), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2022-12-14 06:04:49,586 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 301 transitions. [2022-12-14 06:04:49,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-12-14 06:04:49,586 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:04:49,587 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 06:04:49,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-14 06:04:49,587 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:04:49,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:04:49,587 INFO L85 PathProgramCache]: Analyzing trace with hash -719289663, now seen corresponding path program 1 times [2022-12-14 06:04:49,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:04:49,587 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379122172] [2022-12-14 06:04:49,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:04:49,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:04:49,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:04:49,846 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 06:04:49,846 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:04:49,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379122172] [2022-12-14 06:04:49,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379122172] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:04:49,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1291810252] [2022-12-14 06:04:49,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:04:49,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:04:49,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:04:49,848 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:04:49,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-14 06:04:49,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:04:49,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 13 conjunts are in the unsatisfiable core [2022-12-14 06:04:49,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:04:50,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-14 06:04:50,121 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-12-14 06:04:50,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1291810252] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:04:50,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-12-14 06:04:50,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2022-12-14 06:04:50,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810732619] [2022-12-14 06:04:50,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:04:50,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 06:04:50,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:04:50,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 06:04:50,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-12-14 06:04:50,124 INFO L87 Difference]: Start difference. First operand 212 states and 301 transitions. Second operand has 8 states, 6 states have (on average 7.5) internal successors, (45), 8 states have internal predecessors, (45), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 06:04:50,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:04:50,334 INFO L93 Difference]: Finished difference Result 601 states and 839 transitions. [2022-12-14 06:04:50,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-12-14 06:04:50,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 7.5) internal successors, (45), 8 states have internal predecessors, (45), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) Word has length 60 [2022-12-14 06:04:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:04:50,338 INFO L225 Difference]: With dead ends: 601 [2022-12-14 06:04:50,338 INFO L226 Difference]: Without dead ends: 400 [2022-12-14 06:04:50,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-12-14 06:04:50,340 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 220 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-14 06:04:50,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 1114 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-14 06:04:50,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-12-14 06:04:50,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 396. [2022-12-14 06:04:50,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 300 states have (on average 1.42) internal successors, (426), 301 states have internal predecessors, (426), 65 states have call successors, (65), 30 states have call predecessors, (65), 30 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2022-12-14 06:04:50,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 556 transitions. [2022-12-14 06:04:50,360 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 556 transitions. Word has length 60 [2022-12-14 06:04:50,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:04:50,360 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 556 transitions. [2022-12-14 06:04:50,360 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 7.5) internal successors, (45), 8 states have internal predecessors, (45), 4 states have call successors, (8), 3 states have call predecessors, (8), 4 states have return successors, (7), 3 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 06:04:50,360 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 556 transitions. [2022-12-14 06:04:50,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-14 06:04:50,361 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:04:50,361 INFO L195 NwaCegarLoop]: trace histogram [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-12-14 06:04:50,367 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-14 06:04:50,561 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:04:50,562 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:04:50,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:04:50,562 INFO L85 PathProgramCache]: Analyzing trace with hash 704856508, now seen corresponding path program 1 times [2022-12-14 06:04:50,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:04:50,562 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936310577] [2022-12-14 06:04:50,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:04:50,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:04:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:04:50,847 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 06:04:50,847 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:04:50,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936310577] [2022-12-14 06:04:50,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936310577] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:04:50,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302718926] [2022-12-14 06:04:50,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:04:50,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:04:50,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:04:50,849 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:04:50,850 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-14 06:04:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:04:50,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 06:04:50,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:04:51,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:04:51,186 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:04:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 06:04:51,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1302718926] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:04:51,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1775666279] [2022-12-14 06:04:51,346 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2022-12-14 06:04:51,346 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 06:04:51,349 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 06:04:51,353 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 06:04:51,353 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 06:04:54,030 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 123 for LOIs [2022-12-14 06:04:54,053 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-12-14 06:04:54,069 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 148 for LOIs [2022-12-14 06:04:54,114 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 06:05:05,618 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1775666279] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:05:05,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:05:05,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [9, 9, 9] total 36 [2022-12-14 06:05:05,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981795853] [2022-12-14 06:05:05,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:05:05,620 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 06:05:05,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:05:05,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 06:05:05,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 06:05:05,621 INFO L87 Difference]: Start difference. First operand 396 states and 556 transitions. Second operand has 25 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 18 states have internal predecessors, (43), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 06:05:09,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:05:09,570 INFO L93 Difference]: Finished difference Result 821 states and 1160 transitions. [2022-12-14 06:05:09,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 06:05:09,571 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 18 states have internal predecessors, (43), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 62 [2022-12-14 06:05:09,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:05:09,575 INFO L225 Difference]: With dead ends: 821 [2022-12-14 06:05:09,575 INFO L226 Difference]: Without dead ends: 465 [2022-12-14 06:05:09,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 151 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 06:05:09,576 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 120 mSDsluCounter, 2251 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 2533 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-12-14 06:05:09,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 2533 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-12-14 06:05:09,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-12-14 06:05:09,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 442. [2022-12-14 06:05:09,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 331 states have (on average 1.3987915407854985) internal successors, (463), 332 states have internal predecessors, (463), 78 states have call successors, (78), 32 states have call predecessors, (78), 32 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2022-12-14 06:05:09,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 619 transitions. [2022-12-14 06:05:09,623 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 619 transitions. Word has length 62 [2022-12-14 06:05:09,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:05:09,623 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 619 transitions. [2022-12-14 06:05:09,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 18 states have internal predecessors, (43), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 06:05:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 619 transitions. [2022-12-14 06:05:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-12-14 06:05:09,625 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:05:09,625 INFO L195 NwaCegarLoop]: trace histogram [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-12-14 06:05:09,631 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-14 06:05:09,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-12-14 06:05:09,825 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:05:09,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:05:09,826 INFO L85 PathProgramCache]: Analyzing trace with hash -154619428, now seen corresponding path program 1 times [2022-12-14 06:05:09,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:05:09,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006004152] [2022-12-14 06:05:09,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:05:09,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:05:09,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:05:10,058 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 06:05:10,058 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:05:10,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006004152] [2022-12-14 06:05:10,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006004152] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:05:10,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1891883875] [2022-12-14 06:05:10,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:05:10,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:05:10,059 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:05:10,060 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:05:10,061 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-14 06:05:10,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:05:10,144 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 06:05:10,147 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:05:10,350 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:05:10,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:05:10,446 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 06:05:10,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1891883875] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:05:10,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1290740688] [2022-12-14 06:05:10,450 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2022-12-14 06:05:10,450 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 06:05:10,450 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 06:05:10,450 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 06:05:10,450 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 06:05:11,962 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 123 for LOIs [2022-12-14 06:05:11,983 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 146 for LOIs [2022-12-14 06:05:12,000 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 148 for LOIs [2022-12-14 06:05:12,043 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 06:05:23,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [1290740688] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:05:23,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:05:23,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [9, 9, 9] total 36 [2022-12-14 06:05:23,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999471764] [2022-12-14 06:05:23,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:05:23,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-12-14 06:05:23,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:05:23,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-12-14 06:05:23,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2022-12-14 06:05:23,864 INFO L87 Difference]: Start difference. First operand 442 states and 619 transitions. Second operand has 25 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 18 states have internal predecessors, (43), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 06:05:29,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:05:29,276 INFO L93 Difference]: Finished difference Result 890 states and 1256 transitions. [2022-12-14 06:05:29,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-12-14 06:05:29,277 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 18 states have internal predecessors, (43), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 62 [2022-12-14 06:05:29,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:05:29,281 INFO L225 Difference]: With dead ends: 890 [2022-12-14 06:05:29,281 INFO L226 Difference]: Without dead ends: 523 [2022-12-14 06:05:29,283 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 154 SyntacticMatches, 5 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2022-12-14 06:05:29,283 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 77 mSDsluCounter, 3406 mSDsCounter, 0 mSdLazyCounter, 2408 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 3685 SdHoareTripleChecker+Invalid, 2418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-12-14 06:05:29,284 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 3685 Invalid, 2418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2408 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-12-14 06:05:29,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-12-14 06:05:29,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 500. [2022-12-14 06:05:29,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 372 states have (on average 1.3709677419354838) internal successors, (510), 373 states have internal predecessors, (510), 92 states have call successors, (92), 35 states have call predecessors, (92), 35 states have return successors, (92), 91 states have call predecessors, (92), 92 states have call successors, (92) [2022-12-14 06:05:29,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 694 transitions. [2022-12-14 06:05:29,381 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 694 transitions. Word has length 62 [2022-12-14 06:05:29,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:05:29,381 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 694 transitions. [2022-12-14 06:05:29,381 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 18 states have internal predecessors, (43), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 06:05:29,381 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 694 transitions. [2022-12-14 06:05:29,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-12-14 06:05:29,382 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:05:29,382 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:05:29,387 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-14 06:05:29,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:05:29,583 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:05:29,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:05:29,583 INFO L85 PathProgramCache]: Analyzing trace with hash -2107894249, now seen corresponding path program 1 times [2022-12-14 06:05:29,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:05:29,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919341596] [2022-12-14 06:05:29,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:05:29,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:05:29,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:05:29,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 06:05:29,891 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:05:29,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919341596] [2022-12-14 06:05:29,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919341596] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:05:29,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1545271340] [2022-12-14 06:05:29,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:05:29,891 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:05:29,891 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:05:29,892 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:05:29,893 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-14 06:05:29,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:05:29,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 06:05:29,992 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:05:30,160 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:05:30,160 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:05:30,262 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-12-14 06:05:30,263 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1545271340] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:05:30,263 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [255222803] [2022-12-14 06:05:30,266 INFO L159 IcfgInterpreter]: Started Sifa with 59 locations of interest [2022-12-14 06:05:30,266 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 06:05:30,266 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 06:05:30,266 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 06:05:30,266 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 06:05:32,315 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 125 for LOIs [2022-12-14 06:05:32,337 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-12-14 06:05:32,352 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 140 for LOIs [2022-12-14 06:05:32,393 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 06:05:46,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [255222803] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:05:46,917 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:05:46,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [9, 9, 9] total 38 [2022-12-14 06:05:46,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716632398] [2022-12-14 06:05:46,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:05:46,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-12-14 06:05:46,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:05:46,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-12-14 06:05:46,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1230, Unknown=0, NotChecked=0, Total=1406 [2022-12-14 06:05:46,919 INFO L87 Difference]: Start difference. First operand 500 states and 694 transitions. Second operand has 27 states, 24 states have (on average 1.875) internal successors, (45), 20 states have internal predecessors, (45), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 06:05:52,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:05:52,491 INFO L93 Difference]: Finished difference Result 925 states and 1301 transitions. [2022-12-14 06:05:52,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-12-14 06:05:52,492 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 24 states have (on average 1.875) internal successors, (45), 20 states have internal predecessors, (45), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) Word has length 64 [2022-12-14 06:05:52,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:05:52,496 INFO L225 Difference]: With dead ends: 925 [2022-12-14 06:05:52,496 INFO L226 Difference]: Without dead ends: 569 [2022-12-14 06:05:52,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 156 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=185, Invalid=1297, Unknown=0, NotChecked=0, Total=1482 [2022-12-14 06:05:52,499 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 74 mSDsluCounter, 3647 mSDsCounter, 0 mSdLazyCounter, 2436 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 3968 SdHoareTripleChecker+Invalid, 2450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 2436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-12-14 06:05:52,499 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 3968 Invalid, 2450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 2436 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-12-14 06:05:52,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-12-14 06:05:52,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 529. [2022-12-14 06:05:52,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 391 states have (on average 1.3580562659846547) internal successors, (531), 392 states have internal predecessors, (531), 101 states have call successors, (101), 36 states have call predecessors, (101), 36 states have return successors, (101), 100 states have call predecessors, (101), 101 states have call successors, (101) [2022-12-14 06:05:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 733 transitions. [2022-12-14 06:05:52,589 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 733 transitions. Word has length 64 [2022-12-14 06:05:52,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:05:52,589 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 733 transitions. [2022-12-14 06:05:52,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 24 states have (on average 1.875) internal successors, (45), 20 states have internal predecessors, (45), 4 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7) [2022-12-14 06:05:52,589 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 733 transitions. [2022-12-14 06:05:52,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-12-14 06:05:52,590 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:05:52,590 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:05:52,594 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-12-14 06:05:52,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-12-14 06:05:52,792 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:05:52,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:05:52,793 INFO L85 PathProgramCache]: Analyzing trace with hash 940244338, now seen corresponding path program 1 times [2022-12-14 06:05:52,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:05:52,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634300774] [2022-12-14 06:05:52,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:05:52,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:05:52,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:05:52,870 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-12-14 06:05:52,870 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:05:52,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634300774] [2022-12-14 06:05:52,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634300774] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:05:52,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:05:52,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-14 06:05:52,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435631264] [2022-12-14 06:05:52,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:05:52,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-14 06:05:52,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:05:52,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-14 06:05:52,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-14 06:05:52,872 INFO L87 Difference]: Start difference. First operand 529 states and 733 transitions. Second operand has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-14 06:05:52,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:05:52,998 INFO L93 Difference]: Finished difference Result 950 states and 1345 transitions. [2022-12-14 06:05:52,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-14 06:05:52,998 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 66 [2022-12-14 06:05:52,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:05:53,000 INFO L225 Difference]: With dead ends: 950 [2022-12-14 06:05:53,000 INFO L226 Difference]: Without dead ends: 537 [2022-12-14 06:05:53,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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-12-14 06:05:53,001 INFO L413 NwaCegarLoop]: 220 mSDtfsCounter, 5 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-14 06:05:53,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 645 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-14 06:05:53,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-12-14 06:05:53,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2022-12-14 06:05:53,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 397 states have (on average 1.3526448362720402) internal successors, (537), 398 states have internal predecessors, (537), 101 states have call successors, (101), 38 states have call predecessors, (101), 38 states have return successors, (101), 100 states have call predecessors, (101), 101 states have call successors, (101) [2022-12-14 06:05:53,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 739 transitions. [2022-12-14 06:05:53,083 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 739 transitions. Word has length 66 [2022-12-14 06:05:53,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:05:53,084 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 739 transitions. [2022-12-14 06:05:53,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.75) internal successors, (47), 3 states have internal predecessors, (47), 2 states have call successors, (9), 3 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-12-14 06:05:53,084 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 739 transitions. [2022-12-14 06:05:53,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-12-14 06:05:53,085 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:05:53,085 INFO L195 NwaCegarLoop]: trace histogram [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-12-14 06:05:53,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-12-14 06:05:53,085 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:05:53,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:05:53,085 INFO L85 PathProgramCache]: Analyzing trace with hash -1228117876, now seen corresponding path program 1 times [2022-12-14 06:05:53,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:05:53,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844339905] [2022-12-14 06:05:53,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:05:53,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:05:53,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:05:53,286 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 06:05:53,286 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:05:53,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844339905] [2022-12-14 06:05:53,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844339905] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-14 06:05:53,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [968504307] [2022-12-14 06:05:53,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:05:53,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-14 06:05:53,287 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 [2022-12-14 06:05:53,287 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-14 06:05:53,288 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-14 06:05:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:05:53,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 17 conjunts are in the unsatisfiable core [2022-12-14 06:05:53,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-14 06:05:53,532 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-14 06:05:53,533 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-14 06:05:53,629 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 06:05:53,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [968504307] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-14 06:05:53,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [636774214] [2022-12-14 06:05:53,632 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2022-12-14 06:05:53,632 INFO L166 IcfgInterpreter]: Building call graph [2022-12-14 06:05:53,632 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-12-14 06:05:53,632 INFO L176 IcfgInterpreter]: Starting interpretation [2022-12-14 06:05:53,632 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-12-14 06:05:56,997 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 231 for LOIs [2022-12-14 06:05:57,195 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-12-14 06:05:57,211 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 192 for LOIs [2022-12-14 06:05:57,329 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 154 for LOIs [2022-12-14 06:05:57,362 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 151 for LOIs [2022-12-14 06:05:57,409 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 148 for LOIs [2022-12-14 06:05:57,451 INFO L180 IcfgInterpreter]: Interpretation finished [2022-12-14 06:06:31,765 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '16698#(and (<= 0 (+ ~manual_selection_History_0~0 128)) (= ~s2p_old~0 (ite (<= (mod (ite (not (= ~nomsg~0 1)) 1 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 1)) 1 ~nomsg~0) 256) (+ (mod (ite (not (= ~nomsg~0 1)) 1 ~nomsg~0) 256) (- 256)))) (= ~s1p_old~0 (ite (<= (mod ~nomsg~0 256) 127) (mod ~nomsg~0 256) (+ (- 256) (mod ~nomsg~0 256)))) (not (= (mod ~side1Failed~0 256) 0)) (<= 0 (+ 2 ~active_side_History_1~0)) (= ~s1p~0 0) (= ~cs1~0 0) (= ~s2s1~0 0) (<= (+ ~s1p_new~0 1) 0) (<= ~manual_selection_History_0~0 127) (= ~manual_selection_History_1~0 0) (= |assert_#in~arg| 0) (= (ite (<= (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) (+ (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) (- 256))) ~cs2_old~0) (= ~s1s1~0 0) (= ~s1s2_old~0 (ite (<= (mod ~nomsg~0 256) 127) (mod ~nomsg~0 256) (+ (- 256) (mod ~nomsg~0 256)))) (= ~nomsg~0 ~s1s1_new~0) (= ~nomsg~0 ~s2s1_new~0) (= assert_~arg |assert_#in~arg|) (not (= (mod ~side1Failed_History_1~0 256) 0)) (= ~s2s2~0 0) (= ~side2Failed~0 ~side2Failed_History_0~0) (<= 0 (+ ~s1p_new~0 1)) (= (ite (<= (mod (ite (not (= ~nomsg~0 1)) 1 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 1)) 1 ~nomsg~0) 256) (+ (mod (ite (not (= ~nomsg~0 1)) 1 ~nomsg~0) 256) (- 256))) ~s2s1_old~0) (<= (+ 2 ~active_side_History_2~0) 0) (= ~side2_written~0 1) (<= 0 ~manual_selection_History_2~0) (= (mod ~side2Failed_History_1~0 256) 0) (= ~s1s2~0 0) (= (mod ~side2Failed~0 256) 0) (= ~nomsg~0 ~s2p_new~0) (<= (+ 2 ~active_side_History_1~0) 0) (= ~s2s2_old~0 (ite (<= (mod (ite (not (= ~nomsg~0 1)) 1 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 1)) 1 ~nomsg~0) 256) (+ (mod (ite (not (= ~nomsg~0 1)) 1 ~nomsg~0) 256) (- 256)))) (= ~side1Failed_History_0~0 ~side1Failed~0) (= (ite (<= (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) 127) (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) (+ (mod (ite (not (= ~nomsg~0 ~manual_selection_History_0~0)) ~manual_selection_History_0~0 ~nomsg~0) 256) (- 256))) ~cs1_old~0) (= |#NULL.offset| 0) (<= 0 (+ 2 ~active_side_History_2~0)) (= ~s1s1_old~0 (ite (<= (mod ~nomsg~0 256) 127) (mod ~nomsg~0 256) (+ (- 256) (mod ~nomsg~0 256)))) (<= ~manual_selection_History_2~0 0) (= ~nomsg~0 ~cs1_new~0) (= ~active_side_History_0~0 0) (<= 0 (+ ~side1_written~0 1)) (= ~nomsg~0 ~s2s2_new~0) (= ~nomsg~0 ~cs2_new~0) (<= 0 (+ ~cs2_new~0 1)) (= ~cs2~0 0) (<= (+ ~side1_written~0 1) 0) (= ~nomsg~0 ~s1s2_new~0) (<= 0 |#StackHeapBarrier|) (= ~s2p~0 0) (<= (+ ~s1s1_new~0 1) 0) (= |#NULL.base| 0))' at error location [2022-12-14 06:06:31,765 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-12-14 06:06:31,765 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-14 06:06:31,765 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-12-14 06:06:31,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65833393] [2022-12-14 06:06:31,765 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-14 06:06:31,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-14 06:06:31,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:06:31,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-14 06:06:31,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2707, Unknown=0, NotChecked=0, Total=2970 [2022-12-14 06:06:31,767 INFO L87 Difference]: Start difference. First operand 537 states and 739 transitions. Second operand has 13 states, 9 states have (on average 8.333333333333334) internal successors, (75), 12 states have internal predecessors, (75), 4 states have call successors, (17), 3 states have call predecessors, (17), 8 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-12-14 06:06:32,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:06:32,310 INFO L93 Difference]: Finished difference Result 1294 states and 1812 transitions. [2022-12-14 06:06:32,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-12-14 06:06:32,310 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 9 states have (on average 8.333333333333334) internal successors, (75), 12 states have internal predecessors, (75), 4 states have call successors, (17), 3 states have call predecessors, (17), 8 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) Word has length 70 [2022-12-14 06:06:32,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:06:32,313 INFO L225 Difference]: With dead ends: 1294 [2022-12-14 06:06:32,313 INFO L226 Difference]: Without dead ends: 885 [2022-12-14 06:06:32,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 150 SyntacticMatches, 15 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1124 ImplicationChecksByTransitivity, 34.5s TimeCoverageRelationStatistics Valid=287, Invalid=3253, Unknown=0, NotChecked=0, Total=3540 [2022-12-14 06:06:32,315 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 307 mSDsluCounter, 2269 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 332 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-12-14 06:06:32,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [332 Valid, 2614 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-12-14 06:06:32,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-12-14 06:06:32,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 559. [2022-12-14 06:06:32,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 559 states, 412 states have (on average 1.3155339805825244) internal successors, (542), 415 states have internal predecessors, (542), 99 states have call successors, (99), 47 states have call predecessors, (99), 47 states have return successors, (99), 96 states have call predecessors, (99), 99 states have call successors, (99) [2022-12-14 06:06:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 740 transitions. [2022-12-14 06:06:32,418 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 740 transitions. Word has length 70 [2022-12-14 06:06:32,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:06:32,418 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 740 transitions. [2022-12-14 06:06:32,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 9 states have (on average 8.333333333333334) internal successors, (75), 12 states have internal predecessors, (75), 4 states have call successors, (17), 3 states have call predecessors, (17), 8 states have return successors, (18), 4 states have call predecessors, (18), 4 states have call successors, (18) [2022-12-14 06:06:32,418 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 740 transitions. [2022-12-14 06:06:32,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-12-14 06:06:32,419 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:06:32,419 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:06:32,424 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-12-14 06:06:32,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-12-14 06:06:32,620 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:06:32,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:06:32,620 INFO L85 PathProgramCache]: Analyzing trace with hash -796085950, now seen corresponding path program 1 times [2022-12-14 06:06:32,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:06:32,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161877886] [2022-12-14 06:06:32,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:06:32,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:06:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:06:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 06:06:32,818 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:06:32,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [161877886] [2022-12-14 06:06:32,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [161877886] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:06:32,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:06:32,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 06:06:32,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917623388] [2022-12-14 06:06:32,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:06:32,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 06:06:32,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:06:32,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 06:06:32,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:06:32,820 INFO L87 Difference]: Start difference. First operand 559 states and 740 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 06:06:33,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:06:33,529 INFO L93 Difference]: Finished difference Result 1234 states and 1714 transitions. [2022-12-14 06:06:33,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 06:06:33,530 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) Word has length 71 [2022-12-14 06:06:33,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:06:33,533 INFO L225 Difference]: With dead ends: 1234 [2022-12-14 06:06:33,533 INFO L226 Difference]: Without dead ends: 922 [2022-12-14 06:06:33,533 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-12-14 06:06:33,534 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 561 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:06:33,534 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1912 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 06:06:33,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2022-12-14 06:06:33,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 693. [2022-12-14 06:06:33,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 509 states have (on average 1.3163064833005893) internal successors, (670), 512 states have internal predecessors, (670), 123 states have call successors, (123), 60 states have call predecessors, (123), 60 states have return successors, (123), 120 states have call predecessors, (123), 123 states have call successors, (123) [2022-12-14 06:06:33,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 916 transitions. [2022-12-14 06:06:33,673 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 916 transitions. Word has length 71 [2022-12-14 06:06:33,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:06:33,674 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 916 transitions. [2022-12-14 06:06:33,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 7 states have internal predecessors, (50), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2022-12-14 06:06:33,674 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 916 transitions. [2022-12-14 06:06:33,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-12-14 06:06:33,675 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:06:33,675 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-12-14 06:06:33,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-12-14 06:06:33,676 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:06:33,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:06:33,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1444938409, now seen corresponding path program 1 times [2022-12-14 06:06:33,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:06:33,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989200288] [2022-12-14 06:06:33,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:06:33,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:06:33,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-14 06:06:33,831 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-12-14 06:06:33,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-12-14 06:06:33,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989200288] [2022-12-14 06:06:33,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989200288] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-14 06:06:33,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-14 06:06:33,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-14 06:06:33,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389899631] [2022-12-14 06:06:33,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-14 06:06:33,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-14 06:06:33,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-12-14 06:06:33,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-14 06:06:33,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-12-14 06:06:33,833 INFO L87 Difference]: Start difference. First operand 693 states and 916 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-14 06:06:34,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-14 06:06:34,547 INFO L93 Difference]: Finished difference Result 1587 states and 2196 transitions. [2022-12-14 06:06:34,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-14 06:06:34,548 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-12-14 06:06:34,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-14 06:06:34,551 INFO L225 Difference]: With dead ends: 1587 [2022-12-14 06:06:34,551 INFO L226 Difference]: Without dead ends: 1245 [2022-12-14 06:06:34,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-12-14 06:06:34,552 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 722 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 120 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-12-14 06:06:34,552 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 2086 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [120 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-12-14 06:06:34,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2022-12-14 06:06:34,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 952. [2022-12-14 06:06:34,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 697 states have (on average 1.3228120516499282) internal successors, (922), 702 states have internal predecessors, (922), 169 states have call successors, (169), 85 states have call predecessors, (169), 85 states have return successors, (169), 164 states have call predecessors, (169), 169 states have call successors, (169) [2022-12-14 06:06:34,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1260 transitions. [2022-12-14 06:06:34,724 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1260 transitions. Word has length 73 [2022-12-14 06:06:34,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-14 06:06:34,724 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 1260 transitions. [2022-12-14 06:06:34,724 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 7 states have internal predecessors, (52), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-12-14 06:06:34,725 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1260 transitions. [2022-12-14 06:06:34,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-12-14 06:06:34,725 INFO L187 NwaCegarLoop]: Found error trace [2022-12-14 06:06:34,725 INFO L195 NwaCegarLoop]: trace histogram [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-12-14 06:06:34,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-12-14 06:06:34,725 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-14 06:06:34,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-14 06:06:34,726 INFO L85 PathProgramCache]: Analyzing trace with hash 1593259580, now seen corresponding path program 1 times [2022-12-14 06:06:34,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-12-14 06:06:34,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553882837] [2022-12-14 06:06:34,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-14 06:06:34,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-14 06:06:34,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 06:06:34,750 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-14 06:06:34,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-14 06:06:34,797 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-12-14 06:06:34,797 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-12-14 06:06:34,798 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-12-14 06:06:34,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-12-14 06:06:34,802 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-14 06:06:34,805 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-14 06:06:34,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.12 06:06:34 BoogieIcfgContainer [2022-12-14 06:06:34,868 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-14 06:06:34,869 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-14 06:06:34,869 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-14 06:06:34,869 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-14 06:06:34,869 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.12 06:04:47" (3/4) ... [2022-12-14 06:06:34,871 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-12-14 06:06:34,942 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/witness.graphml [2022-12-14 06:06:34,942 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-14 06:06:34,943 INFO L158 Benchmark]: Toolchain (without parser) took 108802.72ms. Allocated memory was 136.3MB in the beginning and 343.9MB in the end (delta: 207.6MB). Free memory was 101.0MB in the beginning and 276.2MB in the end (delta: -175.2MB). Peak memory consumption was 221.9MB. Max. memory is 16.1GB. [2022-12-14 06:06:34,943 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 136.3MB. Free memory was 108.6MB in the beginning and 108.5MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-12-14 06:06:34,943 INFO L158 Benchmark]: CACSL2BoogieTranslator took 343.48ms. Allocated memory is still 136.3MB. Free memory was 101.0MB in the beginning and 83.3MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-12-14 06:06:34,943 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.93ms. Allocated memory is still 136.3MB. Free memory was 83.3MB in the beginning and 80.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-14 06:06:34,943 INFO L158 Benchmark]: Boogie Preprocessor took 38.04ms. Allocated memory is still 136.3MB. Free memory was 80.0MB in the beginning and 77.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-12-14 06:06:34,944 INFO L158 Benchmark]: RCFGBuilder took 665.14ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 77.5MB in the beginning and 103.7MB in the end (delta: -26.3MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2022-12-14 06:06:34,944 INFO L158 Benchmark]: TraceAbstraction took 107629.93ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 102.6MB in the beginning and 91.8MB in the end (delta: 10.8MB). Peak memory consumption was 190.0MB. Max. memory is 16.1GB. [2022-12-14 06:06:34,944 INFO L158 Benchmark]: Witness Printer took 73.80ms. Allocated memory is still 343.9MB. Free memory was 91.8MB in the beginning and 276.2MB in the end (delta: -184.4MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. [2022-12-14 06:06:34,945 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.16ms. Allocated memory is still 136.3MB. Free memory was 108.6MB in the beginning and 108.5MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 343.48ms. Allocated memory is still 136.3MB. Free memory was 101.0MB in the beginning and 83.3MB in the end (delta: 17.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.93ms. Allocated memory is still 136.3MB. Free memory was 83.3MB in the beginning and 80.0MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 38.04ms. Allocated memory is still 136.3MB. Free memory was 80.0MB in the beginning and 77.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 665.14ms. Allocated memory was 136.3MB in the beginning and 163.6MB in the end (delta: 27.3MB). Free memory was 77.5MB in the beginning and 103.7MB in the end (delta: -26.3MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. * TraceAbstraction took 107629.93ms. Allocated memory was 163.6MB in the beginning and 343.9MB in the end (delta: 180.4MB). Free memory was 102.6MB in the beginning and 91.8MB in the end (delta: 10.8MB). Peak memory consumption was 190.0MB. Max. memory is 16.1GB. * Witness Printer took 73.80ms. Allocated memory is still 343.9MB. Free memory was 91.8MB in the beginning and 276.2MB in the end (delta: -184.4MB). Peak memory consumption was 3.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 619]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] msg_t nomsg = (msg_t )-1; [L25] port_t cs1 ; [L26] int8_t cs1_old ; [L27] int8_t cs1_new ; [L28] port_t cs2 ; [L29] int8_t cs2_old ; [L30] int8_t cs2_new ; [L31] port_t s1s2 ; [L32] int8_t s1s2_old ; [L33] int8_t s1s2_new ; [L34] port_t s1s1 ; [L35] int8_t s1s1_old ; [L36] int8_t s1s1_new ; [L37] port_t s2s1 ; [L38] int8_t s2s1_old ; [L39] int8_t s2s1_new ; [L40] port_t s2s2 ; [L41] int8_t s2s2_old ; [L42] int8_t s2s2_new ; [L43] port_t s1p ; [L44] int8_t s1p_old ; [L45] int8_t s1p_new ; [L46] port_t s2p ; [L47] int8_t s2p_old ; [L48] int8_t s2p_new ; [L51] _Bool side1Failed ; [L52] _Bool side2Failed ; [L53] msg_t side1_written ; [L54] msg_t side2_written ; [L60] static _Bool side1Failed_History_0 ; [L61] static _Bool side1Failed_History_1 ; [L62] static _Bool side1Failed_History_2 ; [L63] static _Bool side2Failed_History_0 ; [L64] static _Bool side2Failed_History_1 ; [L65] static _Bool side2Failed_History_2 ; [L66] static int8_t active_side_History_0 ; [L67] static int8_t active_side_History_1 ; [L68] static int8_t active_side_History_2 ; [L69] static msg_t manual_selection_History_0 ; [L70] static msg_t manual_selection_History_1 ; [L71] static msg_t manual_selection_History_2 ; [L542] int c1 ; [L543] int i2 ; [L546] c1 = 0 [L547] side1Failed = __VERIFIER_nondet_bool() [L548] side2Failed = __VERIFIER_nondet_bool() [L549] side1_written = __VERIFIER_nondet_char() [L550] side2_written = __VERIFIER_nondet_char() [L551] side1Failed_History_0 = __VERIFIER_nondet_bool() [L552] side1Failed_History_1 = __VERIFIER_nondet_bool() [L553] side1Failed_History_2 = __VERIFIER_nondet_bool() [L554] side2Failed_History_0 = __VERIFIER_nondet_bool() [L555] side2Failed_History_1 = __VERIFIER_nondet_bool() [L556] side2Failed_History_2 = __VERIFIER_nondet_bool() [L557] active_side_History_0 = __VERIFIER_nondet_char() [L558] active_side_History_1 = __VERIFIER_nondet_char() [L559] active_side_History_2 = __VERIFIER_nondet_char() [L560] manual_selection_History_0 = __VERIFIER_nondet_char() [L561] manual_selection_History_1 = __VERIFIER_nondet_char() [L562] manual_selection_History_2 = __VERIFIER_nondet_char() [L563] CALL, EXPR init() [L197] COND FALSE !((int )side1Failed_History_0 != 0) [L200] COND FALSE !((int )side2Failed_History_0 != 0) [L203] COND FALSE !((int )active_side_History_0 != -2) [L206] COND FALSE !((int )manual_selection_History_0 != 0) [L209] COND FALSE !((int )side1Failed_History_1 != 0) [L212] COND FALSE !((int )side2Failed_History_1 != 0) [L215] COND FALSE !((int )active_side_History_1 != -2) [L218] COND FALSE !((int )manual_selection_History_1 != 0) [L221] COND FALSE !((int )side1Failed_History_2 != 0) [L224] COND FALSE !((int )side2Failed_History_2 != 0) [L227] COND FALSE !((int )active_side_History_2 != -2) [L230] COND FALSE !((int )manual_selection_History_2 != 0) [L233] return (1); [L563] RET, EXPR init() [L563] i2 = init() [L564] CALL assume_abort_if_not(i2) VAL [\old(cond)=1, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) [L564] RET assume_abort_if_not(i2) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=0, cs1_old=0, cs2=0, cs2_new=0, cs2_old=0, i2=1, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=0, s1p_old=0, s1s1=0, s1s1_new=0, s1s1_old=0, s1s2=0, s1s2_new=0, s1s2_old=0, s2p=0, s2p_new=0, s2p_old=0, s2s1=0, s2s1_new=0, s2s1_old=0, s2s2=0, s2s2_new=0, s2s2_old=0, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L565] cs1_old = nomsg [L566] cs1_new = nomsg [L567] cs2_old = nomsg [L568] cs2_new = nomsg [L569] s1s2_old = nomsg [L570] s1s2_new = nomsg [L571] s1s1_old = nomsg [L572] s1s1_new = nomsg [L573] s2s1_old = nomsg [L574] s2s1_new = nomsg [L575] s2s2_old = nomsg [L576] s2s2_new = nomsg [L577] s1p_old = nomsg [L578] s1p_new = nomsg [L579] s2p_old = nomsg [L580] s2p_new = nomsg [L581] i2 = 0 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, c1=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, i2=0, manual_selection_History_0=0, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1_written=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L582] COND TRUE i2 < 10 [L584] CALL Console_task_each_pals_period() [L251] msg_t manual_selection ; [L252] char tmp ; [L255] tmp = __VERIFIER_nondet_char() [L256] manual_selection = tmp [L257] CALL write_manual_selection_history(manual_selection) [L167] manual_selection_History_2 = manual_selection_History_1 [L168] manual_selection_History_1 = manual_selection_History_0 [L169] manual_selection_History_0 = val [L257] RET write_manual_selection_history(manual_selection) [L258] cs1_new = manual_selection != nomsg && cs1_new == nomsg ? manual_selection : cs1_new [L259] cs2_new = manual_selection != nomsg && cs2_new == nomsg ? manual_selection : cs2_new [L260] manual_selection = (msg_t )0 [L584] RET Console_task_each_pals_period() [L585] CALL Side1_activestandby_task_each_pals_period() [L266] int8_t side1 ; [L267] int8_t side2 ; [L268] msg_t manual_selection ; [L269] int8_t next_state ; [L272] side1 = nomsg [L273] side2 = nomsg [L274] manual_selection = (msg_t )0 [L275] side1Failed = __VERIFIER_nondet_bool() [L276] CALL write_side1_failed_history(side1Failed) [L77] side1Failed_History_2 = side1Failed_History_1 [L78] side1Failed_History_1 = side1Failed_History_0 [L79] side1Failed_History_0 = val [L276] RET write_side1_failed_history(side1Failed) [L277] COND FALSE !(\read(side1Failed)) [L284] side1 = s1s1_old [L285] s1s1_old = nomsg [L286] side2 = s2s1_old [L287] s2s1_old = nomsg [L288] manual_selection = cs1_old [L289] cs1_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L290] COND TRUE (int )side1 == (int )side2 [L291] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=-1, s1s1=0, s1s1_new=-1, s1s1_old=-1, s1s2=0, s1s2_new=-1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=0, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L314] s1s1_new = next_state != nomsg && s1s1_new == nomsg ? next_state : s1s1_new [L315] s1s2_new = next_state != nomsg && s1s2_new == nomsg ? next_state : s1s2_new [L316] s1p_new = next_state != nomsg && s1p_new == nomsg ? next_state : s1p_new [L317] side1_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L585] RET Side1_activestandby_task_each_pals_period() [L586] CALL Side2_activestandby_task_each_pals_period() [L323] int8_t side1 ; [L324] int8_t side2 ; [L325] msg_t manual_selection ; [L326] int8_t next_state ; [L329] side1 = nomsg [L330] side2 = nomsg [L331] manual_selection = (msg_t )0 [L332] side2Failed = __VERIFIER_nondet_bool() [L333] CALL write_side2_failed_history(side2Failed) [L107] side2Failed_History_2 = side2Failed_History_1 [L108] side2Failed_History_1 = side2Failed_History_0 [L109] side2Failed_History_0 = val [L333] RET write_side2_failed_history(side2Failed) [L334] COND FALSE !(\read(side2Failed)) [L341] side1 = s1s2_old [L342] s1s2_old = nomsg [L343] side2 = s2s2_old [L344] s2s2_old = nomsg [L345] manual_selection = cs2_old [L346] cs2_old = nomsg VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L347] COND TRUE (int )side1 == (int )side2 [L348] next_state = (int8_t )1 VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=-1, s2p_old=-1, s2s1=0, s2s1_new=-1, s2s1_old=-1, s2s2=0, s2s2_new=-1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=0, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L371] s2s1_new = next_state != nomsg && s2s1_new == nomsg ? next_state : s2s1_new [L372] s2s2_new = next_state != nomsg && s2s2_new == nomsg ? next_state : s2s2_new [L373] s2p_new = next_state != nomsg && s2p_new == nomsg ? next_state : s2p_new [L374] side2_written = next_state VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, next_state=1, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L586] RET Side2_activestandby_task_each_pals_period() [L587] CALL Pendulum_prism_task_each_pals_period() [L380] int8_t active_side ; [L381] int8_t tmp ; [L382] int8_t side1 ; [L383] int8_t side2 ; VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] CALL, EXPR read_active_side_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\old(index)=0, \result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] RET, EXPR read_active_side_history((unsigned char)0) VAL [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_active_side_history((unsigned char)0)=-2, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L386] tmp = read_active_side_history((unsigned char)0) [L387] active_side = tmp [L388] side1 = nomsg [L389] side2 = nomsg [L390] side1 = s1p_old [L391] s1p_old = nomsg [L392] side2 = s2p_old [L393] s2p_old = nomsg VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L394] COND FALSE !((int )side1 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L397] COND FALSE !((int )side2 == 1) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L400] COND FALSE !((int )side1 == 0) VAL [active_side=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L408] COND TRUE (int )side1 == (int )nomsg [L409] COND FALSE !((int )side2 == 0) [L412] active_side = (int8_t )0 VAL [active_side=0, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=1, s1p_old=-1, s1s1=0, s1s1_new=1, s1s1_old=-1, s1s2=0, s1s2_new=1, s1s2_old=-1, s2p=0, s2p_new=1, s2p_old=-1, s2s1=0, s2s1_new=1, s2s1_old=-1, s2s2=0, s2s2_new=1, s2s2_old=-1, side1=-1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2=-1, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=-2] [L417] CALL write_active_side_history(active_side) [L137] active_side_History_2 = active_side_History_1 [L138] active_side_History_1 = active_side_History_0 [L139] active_side_History_0 = val [L417] RET write_active_side_history(active_side) [L587] RET Pendulum_prism_task_each_pals_period() [L588] cs1_old = cs1_new [L589] cs1_new = nomsg [L590] cs2_old = cs2_new [L591] cs2_new = nomsg [L592] s1s2_old = s1s2_new [L593] s1s2_new = nomsg [L594] s1s1_old = s1s1_new [L595] s1s1_new = nomsg [L596] s2s1_old = s2s1_new [L597] s2s1_new = nomsg [L598] s2s2_old = s2s2_new [L599] s2s2_new = nomsg [L600] s1p_old = s1p_new [L601] s1p_new = nomsg [L602] s2p_old = s2p_new [L603] s2p_new = nomsg [L604] CALL, EXPR check() [L423] int tmp ; [L424] msg_t tmp___0 ; [L425] _Bool tmp___1 ; [L426] _Bool tmp___2 ; [L427] _Bool tmp___3 ; [L428] _Bool tmp___4 ; [L429] int8_t tmp___5 ; [L430] _Bool tmp___6 ; [L431] _Bool tmp___7 ; [L432] _Bool tmp___8 ; [L433] int8_t tmp___9 ; [L434] _Bool tmp___10 ; [L435] _Bool tmp___11 ; [L436] _Bool tmp___12 ; [L437] msg_t tmp___13 ; [L438] _Bool tmp___14 ; [L439] _Bool tmp___15 ; [L440] _Bool tmp___16 ; [L441] _Bool tmp___17 ; [L442] int8_t tmp___18 ; [L443] int8_t tmp___19 ; [L444] int8_t tmp___20 ; [L447] COND TRUE ! side1Failed [L448] tmp = 1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L455] CALL assume_abort_if_not((_Bool )tmp) VAL [\old(cond)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L58] COND FALSE !(!cond) [L455] RET assume_abort_if_not((_Bool )tmp) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] CALL, EXPR read_manual_selection_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L178] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L456] RET, EXPR read_manual_selection_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_manual_selection_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1] [L456] tmp___0 = read_manual_selection_history((unsigned char)1) [L457] COND TRUE ! tmp___0 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] CALL, EXPR read_side1_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L458] RET, EXPR read_side1_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0] [L458] tmp___1 = read_side1_failed_history((unsigned char)1) [L459] COND TRUE ! tmp___1 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] CALL, EXPR read_side1_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L460] RET, EXPR read_side1_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0] [L460] tmp___2 = read_side1_failed_history((unsigned char)0) [L461] COND TRUE ! tmp___2 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] CALL, EXPR read_side2_failed_history((unsigned char)1) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND FALSE !((int )index == 0) VAL [\old(index)=1, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\old(index)=1, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L462] RET, EXPR read_side2_failed_history((unsigned char)1) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0] [L462] tmp___3 = read_side2_failed_history((unsigned char)1) [L463] COND TRUE ! tmp___3 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] CALL, EXPR read_side2_failed_history((unsigned char)0) VAL [\old(index)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_0); VAL [\old(index)=0, \result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, index=0, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L464] RET, EXPR read_side2_failed_history((unsigned char)0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)0)=0, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0] [L464] tmp___4 = read_side2_failed_history((unsigned char)0) [L465] COND TRUE ! tmp___4 VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L466] COND FALSE !(! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L471] COND FALSE !(! (! ((int )side1_written == 0))) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L476] COND TRUE ! (! ((int )side1_written == 1)) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L477] COND TRUE ! ((int )side2_written == 0) [L478] return (0); VAL [\result=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0, tmp=1, tmp___0=0, tmp___1=0, tmp___2=0, tmp___3=0, tmp___4=0] [L604] RET, EXPR check() [L604] c1 = check() [L605] CALL assert(c1) VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L617] COND TRUE ! arg VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] [L619] reach_error() VAL [\old(arg)=0, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-1, cs2=0, cs2_new=-1, cs2_old=-1, manual_selection_History_0=-1, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, s1p=0, s1p_new=-1, s1p_old=1, s1s1=0, s1s1_new=-1, s1s1_old=1, s1s2=0, s1s2_new=-1, s1s2_old=1, s2p=0, s2p_new=-1, s2p_old=1, s2s1=0, s2s1_new=-1, s2s1_old=1, s2s2=0, s2s2_new=-1, s2s2_old=1, side1_written=1, side1Failed=0, side1Failed_History_0=0, side1Failed_History_1=0, side1Failed_History_2=0, side2_written=1, side2Failed=0, side2Failed_History_0=0, side2Failed_History_1=0, side2Failed_History_2=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 150 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 107.5s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 18.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3366 SdHoareTripleChecker+Valid, 14.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3263 mSDsluCounter, 23604 SdHoareTripleChecker+Invalid, 13.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19253 mSDsCounter, 412 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8627 IncrementalHoareTripleChecker+Invalid, 9039 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 412 mSolverCounterUnsat, 4351 mSDtfsCounter, 8627 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 982 GetRequests, 711 SyntacticMatches, 35 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2155 ImplicationChecksByTransitivity, 74.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=952occurred in iteration=16, InterpolantAutomatonStates: 159, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 16 MinimizatonAttempts, 1134 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 1230 NumberOfCodeBlocks, 1230 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 1388 ConstructedInterpolants, 0 QuantifiedInterpolants, 4767 SizeOfPredicates, 68 NumberOfNonLiveVariables, 1998 ConjunctsInSsa, 81 ConjunctsInUnsatCore, 25 InterpolantComputations, 12 PerfectInterpolantSequences, 135/152 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: OVERALL_TIME: 6.5s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 12, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 104, DAG_INTERPRETER_EARLY_EXITS: 3, TOOLS_POST_APPLICATIONS: 101, TOOLS_POST_TIME: 1.8s, TOOLS_POST_CALL_APPLICATIONS: 36, TOOLS_POST_CALL_TIME: 2.0s, TOOLS_POST_RETURN_APPLICATIONS: 24, TOOLS_POST_RETURN_TIME: 1.0s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 161, TOOLS_QUANTIFIERELIM_TIME: 4.8s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.2s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 265, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 33, DOMAIN_JOIN_TIME: 1.3s, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME: 0.0s, DOMAIN_WIDEN_APPLICATIONS: 0, DOMAIN_WIDEN_TIME: 0.0s, DOMAIN_ISSUBSETEQ_APPLICATIONS: 0, DOMAIN_ISSUBSETEQ_TIME: 0.0s, DOMAIN_ISBOTTOM_APPLICATIONS: 104, DOMAIN_ISBOTTOM_TIME: 0.3s, LOOP_SUMMARIZER_APPLICATIONS: 0, LOOP_SUMMARIZER_CACHE_MISSES: 0, LOOP_SUMMARIZER_OVERALL_TIME: 0.0s, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 0, CALL_SUMMARIZER_APPLICATIONS: 24, CALL_SUMMARIZER_CACHE_MISSES: 9, CALL_SUMMARIZER_OVERALL_TIME: 0.0s, CALL_SUMMARIZER_NEW_COMPUTATION_TIME: 0.0s, PROCEDURE_GRAPH_BUILDER_TIME: 0.0s, PATH_EXPR_TIME: 0.0s, REGEX_TO_DAG_TIME: 0.0s, DAG_COMPRESSION_TIME: 0.0s, DAG_COMPRESSION_PROCESSED_NODES: 3073, DAG_COMPRESSION_RETAINED_NODES: 352, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-12-14 06:06:34,960 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cca3aa54-22f2-4718-94e2-0cc177d9ca6d/bin/utaipan-gh47qXpMRh/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with 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