./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 4e7fbc69 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/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_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW --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-4e7fbc6 [2022-11-23 15:34:05,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:34:05,162 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:34:05,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:34:05,212 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:34:05,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:34:05,220 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:34:05,223 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:34:05,226 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:34:05,233 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:34:05,234 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:34:05,237 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:34:05,238 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:34:05,241 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:34:05,243 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:34:05,246 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:34:05,249 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:34:05,250 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:34:05,252 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:34:05,260 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:34:05,262 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:34:05,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:34:05,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:34:05,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:34:05,279 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:34:05,280 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:34:05,280 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:34:05,282 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:34:05,283 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:34:05,286 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:34:05,286 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:34:05,287 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:34:05,290 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:34:05,292 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:34:05,293 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:34:05,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:34:05,295 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:34:05,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:34:05,296 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:34:05,298 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:34:05,299 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:34:05,300 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 15:34:05,346 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:34:05,347 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:34:05,348 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:34:05,348 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:34:05,349 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:34:05,349 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:34:05,349 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:34:05,349 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:34:05,350 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:34:05,350 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 15:34:05,351 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:34:05,351 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:34:05,351 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 15:34:05,352 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 15:34:05,352 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:34:05,352 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 15:34:05,352 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 15:34:05,352 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 15:34:05,353 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:34:05,353 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:34:05,354 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:34:05,354 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:34:05,354 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:34:05,354 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 15:34:05,354 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:34:05,355 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 15:34:05,355 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:34:05,356 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 15:34:05,356 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:34:05,356 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 15:34:05,356 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:34:05,357 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:34:05,357 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:34:05,357 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:34:05,357 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 15:34:05,358 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:34:05,358 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 15:34:05,358 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 15:34:05,358 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 15:34:05,358 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 15:34:05,359 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:34:05,359 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_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/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_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW 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-11-23 15:34:05,704 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:34:05,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:34:05,739 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:34:05,741 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:34:05,741 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:34:05,742 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2022-11-23 15:34:08,918 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:34:09,263 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:34:09,274 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2022-11-23 15:34:09,285 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/data/43fe50005/a2b60988c8d34754b10bfce4eef8e060/FLAG6398d8248 [2022-11-23 15:34:09,302 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/data/43fe50005/a2b60988c8d34754b10bfce4eef8e060 [2022-11-23 15:34:09,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:34:09,307 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:34:09,309 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:34:09,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:34:09,313 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:34:09,314 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:34:09" (1/1) ... [2022-11-23 15:34:09,316 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17d7ab75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:09, skipping insertion in model container [2022-11-23 15:34:09,316 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:34:09" (1/1) ... [2022-11-23 15:34:09,324 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:34:09,369 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:34:09,630 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_50349da6-1d01-4fd6-9142-69d06621bce9/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c[14700,14713] [2022-11-23 15:34:09,634 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:34:09,646 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:34:09,712 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_50349da6-1d01-4fd6-9142-69d06621bce9/sv-benchmarks/c/seq-mthreaded/pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c[14700,14713] [2022-11-23 15:34:09,712 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:34:09,728 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:34:09,729 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:09 WrapperNode [2022-11-23 15:34:09,729 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:34:09,730 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:34:09,730 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:34:09,730 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:34:09,738 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:09" (1/1) ... [2022-11-23 15:34:09,760 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:09" (1/1) ... [2022-11-23 15:34:09,797 INFO L138 Inliner]: procedures = 32, calls = 48, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 482 [2022-11-23 15:34:09,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:34:09,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:34:09,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:34:09,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:34:09,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:09" (1/1) ... [2022-11-23 15:34:09,808 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:09" (1/1) ... [2022-11-23 15:34:09,812 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:09" (1/1) ... [2022-11-23 15:34:09,813 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:09" (1/1) ... [2022-11-23 15:34:09,823 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:09" (1/1) ... [2022-11-23 15:34:09,830 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:09" (1/1) ... [2022-11-23 15:34:09,832 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:09" (1/1) ... [2022-11-23 15:34:09,834 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:09" (1/1) ... [2022-11-23 15:34:09,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:34:09,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:34:09,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:34:09,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:34:09,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:09" (1/1) ... [2022-11-23 15:34:09,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:34:09,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:34:09,896 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:34:09,898 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:34:09,940 INFO L130 BoogieDeclarations]: Found specification of procedure read_manual_selection_history [2022-11-23 15:34:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure read_manual_selection_history [2022-11-23 15:34:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:34:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure read_side2_failed_history [2022-11-23 15:34:09,941 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side2_failed_history [2022-11-23 15:34:09,941 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2022-11-23 15:34:09,942 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2022-11-23 15:34:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure flip_the_side [2022-11-23 15:34:09,942 INFO L138 BoogieDeclarations]: Found implementation of procedure flip_the_side [2022-11-23 15:34:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-23 15:34:09,942 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-23 15:34:09,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 15:34:09,943 INFO L130 BoogieDeclarations]: Found specification of procedure read_side1_failed_history [2022-11-23 15:34:09,943 INFO L138 BoogieDeclarations]: Found implementation of procedure read_side1_failed_history [2022-11-23 15:34:09,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:34:09,943 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:34:09,943 INFO L130 BoogieDeclarations]: Found specification of procedure read_active_side_history [2022-11-23 15:34:09,943 INFO L138 BoogieDeclarations]: Found implementation of procedure read_active_side_history [2022-11-23 15:34:10,085 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:34:10,088 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:34:10,794 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:34:11,039 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:34:11,039 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-23 15:34:11,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:34:11 BoogieIcfgContainer [2022-11-23 15:34:11,043 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:34:11,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:34:11,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:34:11,050 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:34:11,050 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:34:09" (1/3) ... [2022-11-23 15:34:11,051 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ff872a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:34:11, skipping insertion in model container [2022-11-23 15:34:11,051 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:09" (2/3) ... [2022-11-23 15:34:11,052 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ff872a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:34:11, skipping insertion in model container [2022-11-23 15:34:11,052 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:34:11" (3/3) ... [2022-11-23 15:34:11,053 INFO L112 eAbstractionObserver]: Analyzing ICFG pals_STARTPALS_ActiveStandby.1.ufo.BOUNDED-10.pals.c [2022-11-23 15:34:11,075 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:34:11,075 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-23 15:34:11,131 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:34:11,138 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;@12255380, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:34:11,138 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-23 15:34:11,144 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-11-23 15:34:11,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-23 15:34:11,154 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:34:11,155 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-11-23 15:34:11,155 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:34:11,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:34:11,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1110225083, now seen corresponding path program 1 times [2022-11-23 15:34:11,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:34:11,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045047487] [2022-11-23 15:34:11,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:34:11,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:34:11,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:34:11,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:34:11,806 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:34:11,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045047487] [2022-11-23 15:34:11,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045047487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:34:11,808 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:34:11,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:34:11,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507981273] [2022-11-23 15:34:11,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:34:11,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:34:11,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:34:11,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:34:11,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:34:11,870 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-11-23 15:34:12,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:34:12,086 INFO L93 Difference]: Finished difference Result 301 states and 489 transitions. [2022-11-23 15:34:12,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:34:12,089 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-11-23 15:34:12,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:34:12,103 INFO L225 Difference]: With dead ends: 301 [2022-11-23 15:34:12,103 INFO L226 Difference]: Without dead ends: 153 [2022-11-23 15:34:12,115 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-11-23 15:34:12,122 INFO L413 NwaCegarLoop]: 216 mSDtfsCounter, 5 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:34:12,123 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.1s Time] [2022-11-23 15:34:12,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-11-23 15:34:12,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-11-23 15:34:12,195 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-11-23 15:34:12,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 232 transitions. [2022-11-23 15:34:12,204 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 232 transitions. Word has length 19 [2022-11-23 15:34:12,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:34:12,205 INFO L495 AbstractCegarLoop]: Abstraction has 153 states and 232 transitions. [2022-11-23 15:34:12,206 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-11-23 15:34:12,208 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 232 transitions. [2022-11-23 15:34:12,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-11-23 15:34:12,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:34:12,211 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-11-23 15:34:12,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 15:34:12,212 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:34:12,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:34:12,213 INFO L85 PathProgramCache]: Analyzing trace with hash -2035649686, now seen corresponding path program 1 times [2022-11-23 15:34:12,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:34:12,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741158407] [2022-11-23 15:34:12,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:34:12,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:34:12,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:34:12,458 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:34:12,459 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:34:12,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741158407] [2022-11-23 15:34:12,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741158407] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:34:12,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:34:12,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:34:12,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266723073] [2022-11-23 15:34:12,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:34:12,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:34:12,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:34:12,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:34:12,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:34:12,466 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-11-23 15:34:12,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:34:12,940 INFO L93 Difference]: Finished difference Result 435 states and 675 transitions. [2022-11-23 15:34:12,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:34:12,941 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-11-23 15:34:12,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:34:12,944 INFO L225 Difference]: With dead ends: 435 [2022-11-23 15:34:12,944 INFO L226 Difference]: Without dead ends: 285 [2022-11-23 15:34:12,945 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-11-23 15:34:12,947 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 573 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:34:12,948 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.3s Time] [2022-11-23 15:34:12,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-23 15:34:12,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 187. [2022-11-23 15:34:12,981 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-11-23 15:34:12,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 282 transitions. [2022-11-23 15:34:12,984 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 282 transitions. Word has length 30 [2022-11-23 15:34:12,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:34:12,985 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 282 transitions. [2022-11-23 15:34:12,985 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-11-23 15:34:12,985 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 282 transitions. [2022-11-23 15:34:12,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-11-23 15:34:12,986 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:34:12,987 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-11-23 15:34:12,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 15:34:12,987 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:34:12,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:34:12,988 INFO L85 PathProgramCache]: Analyzing trace with hash -937934777, now seen corresponding path program 1 times [2022-11-23 15:34:12,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:34:12,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227821946] [2022-11-23 15:34:12,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:34:12,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:34:13,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:34:13,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:34:13,111 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:34:13,111 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227821946] [2022-11-23 15:34:13,111 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227821946] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:34:13,111 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:34:13,111 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:34:13,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460992912] [2022-11-23 15:34:13,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:34:13,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:34:13,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:34:13,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:34:13,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:34:13,113 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-11-23 15:34:13,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:34:13,458 INFO L93 Difference]: Finished difference Result 435 states and 673 transitions. [2022-11-23 15:34:13,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:34:13,459 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-11-23 15:34:13,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:34:13,461 INFO L225 Difference]: With dead ends: 435 [2022-11-23 15:34:13,461 INFO L226 Difference]: Without dead ends: 285 [2022-11-23 15:34:13,462 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-11-23 15:34:13,463 INFO L413 NwaCegarLoop]: 211 mSDtfsCounter, 569 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.3s IncrementalHoareTripleChecker+Time [2022-11-23 15:34:13,464 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.3s Time] [2022-11-23 15:34:13,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-11-23 15:34:13,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 187. [2022-11-23 15:34:13,492 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-11-23 15:34:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 281 transitions. [2022-11-23 15:34:13,494 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 281 transitions. Word has length 31 [2022-11-23 15:34:13,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:34:13,494 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 281 transitions. [2022-11-23 15:34:13,495 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-11-23 15:34:13,495 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 281 transitions. [2022-11-23 15:34:13,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-23 15:34:13,496 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:34:13,496 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-11-23 15:34:13,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 15:34:13,497 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:34:13,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:34:13,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1596805711, now seen corresponding path program 1 times [2022-11-23 15:34:13,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:34:13,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014369964] [2022-11-23 15:34:13,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:34:13,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:34:13,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:34:13,703 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:34:13,703 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:34:13,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014369964] [2022-11-23 15:34:13,703 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014369964] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:34:13,703 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:34:13,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:34:13,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820548571] [2022-11-23 15:34:13,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:34:13,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:34:13,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:34:13,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:34:13,705 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:34:13,705 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-11-23 15:34:13,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:34:13,770 INFO L93 Difference]: Finished difference Result 342 states and 516 transitions. [2022-11-23 15:34:13,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:34:13,771 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-11-23 15:34:13,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:34:13,772 INFO L225 Difference]: With dead ends: 342 [2022-11-23 15:34:13,773 INFO L226 Difference]: Without dead ends: 192 [2022-11-23 15:34:13,773 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-11-23 15:34:13,774 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-11-23 15:34:13,775 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-11-23 15:34:13,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-23 15:34:13,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2022-11-23 15:34:13,796 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-11-23 15:34:13,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 285 transitions. [2022-11-23 15:34:13,798 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 285 transitions. Word has length 33 [2022-11-23 15:34:13,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:34:13,798 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 285 transitions. [2022-11-23 15:34:13,798 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-11-23 15:34:13,799 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 285 transitions. [2022-11-23 15:34:13,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-11-23 15:34:13,800 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:34:13,800 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-11-23 15:34:13,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 15:34:13,801 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:34:13,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:34:13,801 INFO L85 PathProgramCache]: Analyzing trace with hash 558838327, now seen corresponding path program 1 times [2022-11-23 15:34:13,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:34:13,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001839293] [2022-11-23 15:34:13,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:34:13,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:34:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:34:14,049 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:34:14,050 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:34:14,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001839293] [2022-11-23 15:34:14,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001839293] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:34:14,051 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:34:14,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:34:14,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425863596] [2022-11-23 15:34:14,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:34:14,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:34:14,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:34:14,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:34:14,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:34:14,057 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-11-23 15:34:14,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:34:14,144 INFO L93 Difference]: Finished difference Result 352 states and 527 transitions. [2022-11-23 15:34:14,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:34:14,146 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-11-23 15:34:14,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:34:14,152 INFO L225 Difference]: With dead ends: 352 [2022-11-23 15:34:14,152 INFO L226 Difference]: Without dead ends: 197 [2022-11-23 15:34:14,153 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-11-23 15:34:14,156 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.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:34:14,157 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.1s Time] [2022-11-23 15:34:14,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-11-23 15:34:14,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-11-23 15:34:14,186 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-11-23 15:34:14,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 289 transitions. [2022-11-23 15:34:14,193 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 289 transitions. Word has length 41 [2022-11-23 15:34:14,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:34:14,195 INFO L495 AbstractCegarLoop]: Abstraction has 197 states and 289 transitions. [2022-11-23 15:34:14,195 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-11-23 15:34:14,196 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 289 transitions. [2022-11-23 15:34:14,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-23 15:34:14,203 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:34:14,204 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-11-23 15:34:14,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 15:34:14,205 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:34:14,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:34:14,206 INFO L85 PathProgramCache]: Analyzing trace with hash 300291937, now seen corresponding path program 1 times [2022-11-23 15:34:14,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:34:14,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252824927] [2022-11-23 15:34:14,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:34:14,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:34:14,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:34:14,451 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:34:14,451 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:34:14,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252824927] [2022-11-23 15:34:14,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252824927] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:34:14,452 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:34:14,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:34:14,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204688491] [2022-11-23 15:34:14,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:34:14,453 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:34:14,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:34:14,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:34:14,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:34:14,454 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-11-23 15:34:14,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:34:14,542 INFO L93 Difference]: Finished difference Result 361 states and 531 transitions. [2022-11-23 15:34:14,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:34:14,543 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-11-23 15:34:14,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:34:14,548 INFO L225 Difference]: With dead ends: 361 [2022-11-23 15:34:14,549 INFO L226 Difference]: Without dead ends: 201 [2022-11-23 15:34:14,550 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-11-23 15:34:14,552 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.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:34:14,555 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.1s Time] [2022-11-23 15:34:14,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-23 15:34:14,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-11-23 15:34:14,576 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-11-23 15:34:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 292 transitions. [2022-11-23 15:34:14,578 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 292 transitions. Word has length 49 [2022-11-23 15:34:14,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:34:14,579 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 292 transitions. [2022-11-23 15:34:14,580 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-11-23 15:34:14,580 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 292 transitions. [2022-11-23 15:34:14,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-11-23 15:34:14,583 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:34:14,584 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-11-23 15:34:14,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 15:34:14,585 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:34:14,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:34:14,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1598216056, now seen corresponding path program 1 times [2022-11-23 15:34:14,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:34:14,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760868970] [2022-11-23 15:34:14,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:34:14,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:34:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:34:14,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-23 15:34:14,867 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:34:14,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760868970] [2022-11-23 15:34:14,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760868970] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:34:14,868 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:34:14,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:34:14,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252712849] [2022-11-23 15:34:14,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:34:14,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:34:14,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:34:14,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:34:14,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:34:14,871 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-11-23 15:34:14,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:34:14,964 INFO L93 Difference]: Finished difference Result 370 states and 541 transitions. [2022-11-23 15:34:14,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:34:14,965 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-11-23 15:34:14,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:34:14,967 INFO L225 Difference]: With dead ends: 370 [2022-11-23 15:34:14,968 INFO L226 Difference]: Without dead ends: 206 [2022-11-23 15:34:14,969 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-11-23 15:34:14,972 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.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:34:14,973 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.1s Time] [2022-11-23 15:34:14,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-11-23 15:34:14,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 206. [2022-11-23 15:34:14,996 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-11-23 15:34:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 296 transitions. [2022-11-23 15:34:14,998 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 296 transitions. Word has length 49 [2022-11-23 15:34:15,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:34:15,004 INFO L495 AbstractCegarLoop]: Abstraction has 206 states and 296 transitions. [2022-11-23 15:34:15,004 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-11-23 15:34:15,005 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 296 transitions. [2022-11-23 15:34:15,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-23 15:34:15,008 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:34:15,009 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-11-23 15:34:15,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 15:34:15,009 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:34:15,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:34:15,010 INFO L85 PathProgramCache]: Analyzing trace with hash -619311992, now seen corresponding path program 1 times [2022-11-23 15:34:15,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:34:15,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50121644] [2022-11-23 15:34:15,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:34:15,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:34:15,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:34:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-11-23 15:34:15,252 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:34:15,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50121644] [2022-11-23 15:34:15,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50121644] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:34:15,252 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:34:15,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:34:15,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382193397] [2022-11-23 15:34:15,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:34:15,253 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:34:15,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:34:15,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:34:15,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:34:15,255 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-11-23 15:34:15,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:34:15,331 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2022-11-23 15:34:15,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:34:15,332 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-11-23 15:34:15,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:34:15,334 INFO L225 Difference]: With dead ends: 381 [2022-11-23 15:34:15,334 INFO L226 Difference]: Without dead ends: 212 [2022-11-23 15:34:15,335 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-11-23 15:34:15,336 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-11-23 15:34:15,336 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-11-23 15:34:15,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-11-23 15:34:15,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 212. [2022-11-23 15:34:15,356 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-11-23 15:34:15,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 301 transitions. [2022-11-23 15:34:15,358 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 301 transitions. Word has length 57 [2022-11-23 15:34:15,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:34:15,359 INFO L495 AbstractCegarLoop]: Abstraction has 212 states and 301 transitions. [2022-11-23 15:34:15,359 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-11-23 15:34:15,359 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 301 transitions. [2022-11-23 15:34:15,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-11-23 15:34:15,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:34:15,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] [2022-11-23 15:34:15,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 15:34:15,361 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:34:15,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:34:15,362 INFO L85 PathProgramCache]: Analyzing trace with hash -220305601, now seen corresponding path program 1 times [2022-11-23 15:34:15,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:34:15,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568589008] [2022-11-23 15:34:15,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:34:15,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:34:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:34:15,896 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 15:34:15,896 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:34:15,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568589008] [2022-11-23 15:34:15,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568589008] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:34:15,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550704157] [2022-11-23 15:34:15,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:34:15,897 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:34:15,897 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:34:15,901 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:34:15,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-23 15:34:16,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:34:16,092 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-23 15:34:16,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:34:16,407 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-23 15:34:16,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-23 15:34:16,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550704157] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:34:16,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-23 15:34:16,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 14 [2022-11-23 15:34:16,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568836060] [2022-11-23 15:34:16,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:34:16,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 15:34:16,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:34:16,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 15:34:16,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2022-11-23 15:34:16,411 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-11-23 15:34:16,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:34:16,709 INFO L93 Difference]: Finished difference Result 601 states and 839 transitions. [2022-11-23 15:34:16,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-23 15:34:16,710 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-11-23 15:34:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:34:16,713 INFO L225 Difference]: With dead ends: 601 [2022-11-23 15:34:16,713 INFO L226 Difference]: Without dead ends: 400 [2022-11-23 15:34:16,714 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-11-23 15:34:16,716 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 233 mSDsluCounter, 868 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:34:16,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1114 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:34:16,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-11-23 15:34:16,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 396. [2022-11-23 15:34:16,749 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-11-23 15:34:16,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 556 transitions. [2022-11-23 15:34:16,752 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 556 transitions. Word has length 60 [2022-11-23 15:34:16,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:34:16,752 INFO L495 AbstractCegarLoop]: Abstraction has 396 states and 556 transitions. [2022-11-23 15:34:16,752 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-11-23 15:34:16,752 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 556 transitions. [2022-11-23 15:34:16,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-23 15:34:16,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:34:16,754 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-11-23 15:34:16,770 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-23 15:34:16,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:34:16,960 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:34:16,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:34:16,961 INFO L85 PathProgramCache]: Analyzing trace with hash -807797062, now seen corresponding path program 1 times [2022-11-23 15:34:16,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:34:16,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892969825] [2022-11-23 15:34:16,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:34:16,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:34:17,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:34:17,440 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 15:34:17,441 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:34:17,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892969825] [2022-11-23 15:34:17,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892969825] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:34:17,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764070912] [2022-11-23 15:34:17,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:34:17,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:34:17,446 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:34:17,447 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:34:17,474 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-23 15:34:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:34:17,597 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 15:34:17,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:34:17,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:34:17,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:34:18,170 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 15:34:18,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764070912] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:34:18,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [961186872] [2022-11-23 15:34:18,198 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2022-11-23 15:34:18,198 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:34:18,202 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:34:18,208 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:34:18,208 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:34:22,774 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 123 for LOIs [2022-11-23 15:34:22,815 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-11-23 15:34:22,846 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 148 for LOIs [2022-11-23 15:34:22,927 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:34:40,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [961186872] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:34:40,784 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:34:40,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [9, 9, 9] total 36 [2022-11-23 15:34:40,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707856711] [2022-11-23 15:34:40,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:34:40,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 15:34:40,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:34:40,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 15:34:40,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=1133, Unknown=0, NotChecked=0, Total=1260 [2022-11-23 15:34:40,787 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-11-23 15:34:46,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:34:46,309 INFO L93 Difference]: Finished difference Result 821 states and 1160 transitions. [2022-11-23 15:34:46,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 15:34:46,311 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-11-23 15:34:46,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:34:46,315 INFO L225 Difference]: With dead ends: 821 [2022-11-23 15:34:46,315 INFO L226 Difference]: Without dead ends: 465 [2022-11-23 15:34:46,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 152 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 318 ImplicationChecksByTransitivity, 19.1s TimeCoverageRelationStatistics Valid=136, Invalid=1196, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 15:34:46,317 INFO L413 NwaCegarLoop]: 282 mSDtfsCounter, 138 mSDsluCounter, 2251 mSDsCounter, 0 mSdLazyCounter, 1510 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 2533 SdHoareTripleChecker+Invalid, 1538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:34:46,317 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 2533 Invalid, 1538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1510 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-23 15:34:46,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2022-11-23 15:34:46,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 442. [2022-11-23 15:34:46,388 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-11-23 15:34:46,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 619 transitions. [2022-11-23 15:34:46,392 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 619 transitions. Word has length 62 [2022-11-23 15:34:46,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:34:46,392 INFO L495 AbstractCegarLoop]: Abstraction has 442 states and 619 transitions. [2022-11-23 15:34:46,393 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-11-23 15:34:46,393 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 619 transitions. [2022-11-23 15:34:46,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-23 15:34:46,394 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:34:46,394 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-11-23 15:34:46,412 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-23 15:34:46,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-23 15:34:46,608 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:34:46,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:34:46,608 INFO L85 PathProgramCache]: Analyzing trace with hash 218496474, now seen corresponding path program 1 times [2022-11-23 15:34:46,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:34:46,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890430107] [2022-11-23 15:34:46,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:34:46,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:34:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:34:47,061 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 15:34:47,062 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:34:47,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890430107] [2022-11-23 15:34:47,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890430107] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:34:47,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [216080356] [2022-11-23 15:34:47,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:34:47,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:34:47,063 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:34:47,064 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:34:47,076 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-23 15:34:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:34:47,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 15:34:47,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:34:47,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:34:47,517 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:34:47,687 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 15:34:47,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [216080356] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:34:47,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [258558525] [2022-11-23 15:34:47,690 INFO L159 IcfgInterpreter]: Started Sifa with 57 locations of interest [2022-11-23 15:34:47,691 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:34:47,691 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:34:47,691 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:34:47,692 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:34:51,057 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 123 for LOIs [2022-11-23 15:34:51,095 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 146 for LOIs [2022-11-23 15:34:51,125 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 148 for LOIs [2022-11-23 15:34:51,188 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:35:08,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [258558525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:35:08,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:35:08,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [9, 9, 9] total 36 [2022-11-23 15:35:08,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325287633] [2022-11-23 15:35:08,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:35:08,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-11-23 15:35:08,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:35:08,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-11-23 15:35:08,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2022-11-23 15:35:08,823 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-11-23 15:35:16,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:35:16,362 INFO L93 Difference]: Finished difference Result 890 states and 1256 transitions. [2022-11-23 15:35:16,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-23 15:35:16,363 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-11-23 15:35:16,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:35:16,366 INFO L225 Difference]: With dead ends: 890 [2022-11-23 15:35:16,367 INFO L226 Difference]: Without dead ends: 523 [2022-11-23 15:35:16,368 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 152 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 18.9s TimeCoverageRelationStatistics Valid=178, Invalid=1154, Unknown=0, NotChecked=0, Total=1332 [2022-11-23 15:35:16,369 INFO L413 NwaCegarLoop]: 279 mSDtfsCounter, 94 mSDsluCounter, 3406 mSDsCounter, 0 mSdLazyCounter, 2408 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 3685 SdHoareTripleChecker+Invalid, 2421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:35:16,369 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 3685 Invalid, 2421 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [13 Valid, 2408 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-11-23 15:35:16,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-11-23 15:35:16,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 500. [2022-11-23 15:35:16,472 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-11-23 15:35:16,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 694 transitions. [2022-11-23 15:35:16,475 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 694 transitions. Word has length 62 [2022-11-23 15:35:16,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:35:16,476 INFO L495 AbstractCegarLoop]: Abstraction has 500 states and 694 transitions. [2022-11-23 15:35:16,476 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-11-23 15:35:16,476 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 694 transitions. [2022-11-23 15:35:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-11-23 15:35:16,478 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:35:16,478 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-11-23 15:35:16,484 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-23 15:35:16,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:35:16,684 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:35:16,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:35:16,685 INFO L85 PathProgramCache]: Analyzing trace with hash -25797995, now seen corresponding path program 1 times [2022-11-23 15:35:16,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:35:16,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910514832] [2022-11-23 15:35:16,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:35:16,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:35:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:35:17,111 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 15:35:17,112 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:35:17,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910514832] [2022-11-23 15:35:17,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910514832] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:35:17,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171025667] [2022-11-23 15:35:17,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:35:17,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:35:17,113 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:35:17,114 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:35:17,134 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-23 15:35:17,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:35:17,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 15:35:17,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:35:17,536 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:35:17,536 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:35:17,702 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-23 15:35:17,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171025667] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:35:17,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [874512319] [2022-11-23 15:35:17,705 INFO L159 IcfgInterpreter]: Started Sifa with 59 locations of interest [2022-11-23 15:35:17,705 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:35:17,706 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:35:17,706 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:35:17,706 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:35:20,679 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 125 for LOIs [2022-11-23 15:35:20,703 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-11-23 15:35:20,721 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 140 for LOIs [2022-11-23 15:35:20,766 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:35:40,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSifa [874512319] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:35:40,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:35:40,789 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [9, 9, 9] total 38 [2022-11-23 15:35:40,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071504685] [2022-11-23 15:35:40,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:35:40,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-23 15:35:40,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:35:40,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-23 15:35:40,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=176, Invalid=1230, Unknown=0, NotChecked=0, Total=1406 [2022-11-23 15:35:40,792 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-11-23 15:35:48,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:35:48,560 INFO L93 Difference]: Finished difference Result 925 states and 1301 transitions. [2022-11-23 15:35:48,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-11-23 15:35:48,561 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-11-23 15:35:48,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:35:48,564 INFO L225 Difference]: With dead ends: 925 [2022-11-23 15:35:48,565 INFO L226 Difference]: Without dead ends: 569 [2022-11-23 15:35:48,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 156 SyntacticMatches, 7 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 21.3s TimeCoverageRelationStatistics Valid=185, Invalid=1297, Unknown=0, NotChecked=0, Total=1482 [2022-11-23 15:35:48,567 INFO L413 NwaCegarLoop]: 321 mSDtfsCounter, 94 mSDsluCounter, 3647 mSDsCounter, 0 mSdLazyCounter, 2436 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 3968 SdHoareTripleChecker+Invalid, 2452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 2436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:35:48,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 3968 Invalid, 2452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 2436 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-11-23 15:35:48,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2022-11-23 15:35:48,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 529. [2022-11-23 15:35:48,701 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-11-23 15:35:48,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 733 transitions. [2022-11-23 15:35:48,704 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 733 transitions. Word has length 64 [2022-11-23 15:35:48,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:35:48,705 INFO L495 AbstractCegarLoop]: Abstraction has 529 states and 733 transitions. [2022-11-23 15:35:48,705 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-11-23 15:35:48,705 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 733 transitions. [2022-11-23 15:35:48,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-11-23 15:35:48,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:35:48,706 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-11-23 15:35:48,713 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-23 15:35:48,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:35:48,913 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:35:48,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:35:48,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1780419440, now seen corresponding path program 1 times [2022-11-23 15:35:48,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:35:48,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009160119] [2022-11-23 15:35:48,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:35:48,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:35:48,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:35:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-23 15:35:49,073 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:35:49,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009160119] [2022-11-23 15:35:49,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009160119] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:35:49,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:35:49,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:35:49,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517110242] [2022-11-23 15:35:49,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:35:49,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:35:49,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:35:49,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:35:49,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:35:49,075 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-11-23 15:35:49,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:35:49,265 INFO L93 Difference]: Finished difference Result 950 states and 1345 transitions. [2022-11-23 15:35:49,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:35:49,266 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-11-23 15:35:49,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:35:49,269 INFO L225 Difference]: With dead ends: 950 [2022-11-23 15:35:49,269 INFO L226 Difference]: Without dead ends: 537 [2022-11-23 15:35:49,271 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-11-23 15:35:49,272 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-11-23 15:35:49,272 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-11-23 15:35:49,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2022-11-23 15:35:49,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2022-11-23 15:35:49,415 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-11-23 15:35:49,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 739 transitions. [2022-11-23 15:35:49,418 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 739 transitions. Word has length 66 [2022-11-23 15:35:49,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:35:49,419 INFO L495 AbstractCegarLoop]: Abstraction has 537 states and 739 transitions. [2022-11-23 15:35:49,419 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-11-23 15:35:49,419 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 739 transitions. [2022-11-23 15:35:49,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-11-23 15:35:49,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:35:49,421 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-11-23 15:35:49,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 15:35:49,421 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:35:49,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:35:49,422 INFO L85 PathProgramCache]: Analyzing trace with hash -2079504502, now seen corresponding path program 1 times [2022-11-23 15:35:49,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:35:49,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628205298] [2022-11-23 15:35:49,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:35:49,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:35:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:35:49,853 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 15:35:49,853 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:35:49,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628205298] [2022-11-23 15:35:49,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628205298] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-23 15:35:49,853 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [613371942] [2022-11-23 15:35:49,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:35:49,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-23 15:35:49,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:35:49,855 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-23 15:35:49,863 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-23 15:35:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:35:49,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-23 15:35:49,993 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-23 15:35:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-23 15:35:50,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-23 15:35:50,396 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 15:35:50,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [613371942] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-23 15:35:50,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [316973746] [2022-11-23 15:35:50,399 INFO L159 IcfgInterpreter]: Started Sifa with 60 locations of interest [2022-11-23 15:35:50,399 INFO L166 IcfgInterpreter]: Building call graph [2022-11-23 15:35:50,400 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-23 15:35:50,400 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-23 15:35:50,400 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-23 15:35:54,111 INFO L197 IcfgInterpreter]: Interpreting procedure read_active_side_history with input of size 231 for LOIs [2022-11-23 15:35:54,341 INFO L197 IcfgInterpreter]: Interpreting procedure assume_abort_if_not with input of size 145 for LOIs [2022-11-23 15:35:54,363 INFO L197 IcfgInterpreter]: Interpreting procedure read_side1_failed_history with input of size 192 for LOIs [2022-11-23 15:35:54,491 INFO L197 IcfgInterpreter]: Interpreting procedure assert with input of size 154 for LOIs [2022-11-23 15:35:54,529 INFO L197 IcfgInterpreter]: Interpreting procedure read_side2_failed_history with input of size 151 for LOIs [2022-11-23 15:35:54,581 INFO L197 IcfgInterpreter]: Interpreting procedure read_manual_selection_history with input of size 148 for LOIs [2022-11-23 15:35:54,639 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-23 15:36:41,989 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-11-23 15:36:41,989 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-23 15:36:41,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-23 15:36:41,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2022-11-23 15:36:41,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21238744] [2022-11-23 15:36:41,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-23 15:36:41,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-23 15:36:41,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:36:41,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-23 15:36:41,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=2707, Unknown=0, NotChecked=0, Total=2970 [2022-11-23 15:36:41,992 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-11-23 15:36:42,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:36:42,776 INFO L93 Difference]: Finished difference Result 1294 states and 1812 transitions. [2022-11-23 15:36:42,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-23 15:36:42,777 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-11-23 15:36:42,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:36:42,781 INFO L225 Difference]: With dead ends: 1294 [2022-11-23 15:36:42,781 INFO L226 Difference]: Without dead ends: 885 [2022-11-23 15:36:42,783 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 153 SyntacticMatches, 12 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1091 ImplicationChecksByTransitivity, 47.6s TimeCoverageRelationStatistics Valid=287, Invalid=3253, Unknown=0, NotChecked=0, Total=3540 [2022-11-23 15:36:42,784 INFO L413 NwaCegarLoop]: 345 mSDtfsCounter, 310 mSDsluCounter, 2269 mSDsCounter, 0 mSdLazyCounter, 437 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 437 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 15:36:42,784 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 2614 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 437 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 15:36:42,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2022-11-23 15:36:42,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 559. [2022-11-23 15:36:42,939 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-11-23 15:36:42,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 740 transitions. [2022-11-23 15:36:42,943 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 740 transitions. Word has length 70 [2022-11-23 15:36:42,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:36:42,943 INFO L495 AbstractCegarLoop]: Abstraction has 559 states and 740 transitions. [2022-11-23 15:36:42,943 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-11-23 15:36:42,943 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 740 transitions. [2022-11-23 15:36:42,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-23 15:36:42,945 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:36:42,945 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-11-23 15:36:42,956 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-23 15:36:43,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-11-23 15:36:43,151 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:36:43,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:36:43,151 INFO L85 PathProgramCache]: Analyzing trace with hash -1419267580, now seen corresponding path program 1 times [2022-11-23 15:36:43,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:36:43,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090471567] [2022-11-23 15:36:43,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:36:43,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:36:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:36:43,509 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 15:36:43,510 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:36:43,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090471567] [2022-11-23 15:36:43,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090471567] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:36:43,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:36:43,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 15:36:43,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011872378] [2022-11-23 15:36:43,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:36:43,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 15:36:43,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:36:43,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 15:36:43,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:36:43,512 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-11-23 15:36:44,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:36:44,473 INFO L93 Difference]: Finished difference Result 1234 states and 1714 transitions. [2022-11-23 15:36:44,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 15:36:44,474 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-11-23 15:36:44,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:36:44,479 INFO L225 Difference]: With dead ends: 1234 [2022-11-23 15:36:44,479 INFO L226 Difference]: Without dead ends: 922 [2022-11-23 15:36:44,483 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-11-23 15:36:44,483 INFO L413 NwaCegarLoop]: 416 mSDtfsCounter, 582 mSDsluCounter, 1496 mSDsCounter, 0 mSdLazyCounter, 557 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 588 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 557 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-23 15:36:44,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [588 Valid, 1912 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 557 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-23 15:36:44,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states. [2022-11-23 15:36:44,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 693. [2022-11-23 15:36:44,700 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-11-23 15:36:44,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 916 transitions. [2022-11-23 15:36:44,704 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 916 transitions. Word has length 71 [2022-11-23 15:36:44,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:36:44,704 INFO L495 AbstractCegarLoop]: Abstraction has 693 states and 916 transitions. [2022-11-23 15:36:44,704 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-11-23 15:36:44,705 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 916 transitions. [2022-11-23 15:36:44,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-11-23 15:36:44,706 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:36:44,706 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-11-23 15:36:44,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 15:36:44,706 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:36:44,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:36:44,707 INFO L85 PathProgramCache]: Analyzing trace with hash -382212455, now seen corresponding path program 1 times [2022-11-23 15:36:44,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:36:44,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173647540] [2022-11-23 15:36:44,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:36:44,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:36:44,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:36:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-11-23 15:36:44,962 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:36:44,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173647540] [2022-11-23 15:36:44,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173647540] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:36:44,962 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:36:44,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 15:36:44,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825998282] [2022-11-23 15:36:44,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:36:44,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-23 15:36:44,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:36:44,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-23 15:36:44,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-11-23 15:36:44,964 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-11-23 15:36:46,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:36:46,000 INFO L93 Difference]: Finished difference Result 1587 states and 2196 transitions. [2022-11-23 15:36:46,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-23 15:36:46,001 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-11-23 15:36:46,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:36:46,007 INFO L225 Difference]: With dead ends: 1587 [2022-11-23 15:36:46,007 INFO L226 Difference]: Without dead ends: 1245 [2022-11-23 15:36:46,009 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-11-23 15:36:46,009 INFO L413 NwaCegarLoop]: 518 mSDtfsCounter, 729 mSDsluCounter, 1568 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 735 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-23 15:36:46,010 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [735 Valid, 2086 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-23 15:36:46,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1245 states. [2022-11-23 15:36:46,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1245 to 952. [2022-11-23 15:36:46,306 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-11-23 15:36:46,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1260 transitions. [2022-11-23 15:36:46,311 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1260 transitions. Word has length 73 [2022-11-23 15:36:46,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:36:46,312 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 1260 transitions. [2022-11-23 15:36:46,312 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-11-23 15:36:46,312 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1260 transitions. [2022-11-23 15:36:46,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-23 15:36:46,314 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:36:46,314 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-11-23 15:36:46,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 15:36:46,315 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-23 15:36:46,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:36:46,315 INFO L85 PathProgramCache]: Analyzing trace with hash 670684926, now seen corresponding path program 1 times [2022-11-23 15:36:46,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:36:46,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544581220] [2022-11-23 15:36:46,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:36:46,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:36:46,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:36:46,367 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 15:36:46,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:36:46,504 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 15:36:46,505 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 15:36:46,506 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-23 15:36:46,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-23 15:36:46,511 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:36:46,515 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 15:36:46,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:36:46 BoogieIcfgContainer [2022-11-23 15:36:46,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 15:36:46,660 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 15:36:46,660 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 15:36:46,661 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 15:36:46,661 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:34:11" (3/4) ... [2022-11-23 15:36:46,663 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 15:36:46,810 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 15:36:46,810 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 15:36:46,811 INFO L158 Benchmark]: Toolchain (without parser) took 157503.78ms. Allocated memory was 178.3MB in the beginning and 539.0MB in the end (delta: 360.7MB). Free memory was 142.7MB in the beginning and 188.7MB in the end (delta: -46.0MB). Peak memory consumption was 315.2MB. Max. memory is 16.1GB. [2022-11-23 15:36:46,811 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 178.3MB. Free memory was 147.8MB in the beginning and 147.7MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:36:46,811 INFO L158 Benchmark]: CACSL2BoogieTranslator took 420.77ms. Allocated memory is still 178.3MB. Free memory was 142.7MB in the beginning and 125.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-23 15:36:46,811 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.09ms. Allocated memory is still 178.3MB. Free memory was 125.4MB in the beginning and 121.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 15:36:46,812 INFO L158 Benchmark]: Boogie Preprocessor took 41.45ms. Allocated memory is still 178.3MB. Free memory was 121.7MB in the beginning and 119.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:36:46,812 INFO L158 Benchmark]: RCFGBuilder took 1203.34ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 119.1MB in the beginning and 166.1MB in the end (delta: -47.0MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. [2022-11-23 15:36:46,812 INFO L158 Benchmark]: TraceAbstraction took 155614.19ms. Allocated memory was 213.9MB in the beginning and 539.0MB in the end (delta: 325.1MB). Free memory was 165.1MB in the beginning and 204.4MB in the end (delta: -39.4MB). Peak memory consumption was 286.7MB. Max. memory is 16.1GB. [2022-11-23 15:36:46,813 INFO L158 Benchmark]: Witness Printer took 149.89ms. Allocated memory is still 539.0MB. Free memory was 204.4MB in the beginning and 188.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-23 15:36:46,814 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.30ms. Allocated memory is still 178.3MB. Free memory was 147.8MB in the beginning and 147.7MB in the end (delta: 153.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 420.77ms. Allocated memory is still 178.3MB. Free memory was 142.7MB in the beginning and 125.4MB in the end (delta: 17.3MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.09ms. Allocated memory is still 178.3MB. Free memory was 125.4MB in the beginning and 121.7MB in the end (delta: 3.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.45ms. Allocated memory is still 178.3MB. Free memory was 121.7MB in the beginning and 119.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1203.34ms. Allocated memory was 178.3MB in the beginning and 213.9MB in the end (delta: 35.7MB). Free memory was 119.1MB in the beginning and 166.1MB in the end (delta: -47.0MB). Peak memory consumption was 55.7MB. Max. memory is 16.1GB. * TraceAbstraction took 155614.19ms. Allocated memory was 213.9MB in the beginning and 539.0MB in the end (delta: 325.1MB). Free memory was 165.1MB in the beginning and 204.4MB in the end (delta: -39.4MB). Peak memory consumption was 286.7MB. Max. memory is 16.1GB. * Witness Printer took 149.89ms. Allocated memory is still 539.0MB. Free memory was 204.4MB in the beginning and 188.7MB in the end (delta: 15.7MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * 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 [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, unknown-#in~cond-unknown=1] [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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection=-1, manual_selection_History_0=-128, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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 [active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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, unknown-#in~index-unknown=0] [L148] COND TRUE (int )index == 0 [L149] return (active_side_History_0); VAL [\result=-2, active_side_History_0=-2, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, index=0, manual_selection_History_0=-128, 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, unknown-#in~index-unknown=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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=-128, cs1_old=-1, cs2=0, cs2_new=-128, cs2_old=-1, manual_selection_History_0=-128, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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 [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, unknown-#in~cond-unknown=1] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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 [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, unknown-#in~index-unknown=1] [L178] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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, unknown-#in~index-unknown=1] [L181] COND TRUE (int )index == 1 [L182] return (manual_selection_History_1); 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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, unknown-#in~index-unknown=1] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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 [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, unknown-#in~index-unknown=1] [L88] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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, unknown-#in~index-unknown=1] [L91] COND TRUE (int )index == 1 [L92] return (side1Failed_History_1); VAL [\result=-256, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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, unknown-#in~index-unknown=1] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side1_failed_history((unsigned char)1)=-256, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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 [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, unknown-#in~index-unknown=0] [L88] COND TRUE (int )index == 0 [L89] return (side1Failed_History_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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, 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, unknown-#in~index-unknown=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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 [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, unknown-#in~index-unknown=1] [L118] COND FALSE !((int )index == 0) VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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, unknown-#in~index-unknown=1] [L121] COND TRUE (int )index == 1 [L122] return (side2Failed_History_1); VAL [\result=-256, active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=1, manual_selection_History_0=-128, 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, unknown-#in~index-unknown=1] [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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, manual_selection_History_1=0, manual_selection_History_2=0, nomsg=-1, read_side2_failed_history((unsigned char)1)=-256, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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 [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, unknown-#in~index-unknown=0] [L118] COND TRUE (int )index == 0 [L119] return (side2Failed_History_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=-128, cs2=0, cs2_new=-1, cs2_old=-128, index=0, manual_selection_History_0=-128, 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, unknown-#in~index-unknown=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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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 [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, unknown-#in~arg-unknown=0] [L617] COND TRUE ! arg VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, unknown-#in~arg-unknown=0] [L619] reach_error() VAL [active_side_History_0=0, active_side_History_1=-2, active_side_History_2=-2, arg=0, cs1=0, cs1_new=-1, cs1_old=-128, cs2=0, cs2_new=-1, cs2_old=-128, manual_selection_History_0=-128, 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, unknown-#in~arg-unknown=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 8 procedures, 150 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 155.4s, OverallIterations: 17, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 25.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3471 SdHoareTripleChecker+Valid, 19.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3362 mSDsluCounter, 23604 SdHoareTripleChecker+Invalid, 17.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19253 mSDsCounter, 431 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8627 IncrementalHoareTripleChecker+Invalid, 9058 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 431 mSolverCounterUnsat, 4351 mSDtfsCounter, 8627 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 982 GetRequests, 713 SyntacticMatches, 33 SemanticMatches, 236 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2128 ImplicationChecksByTransitivity, 107.4s 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: 1.4s AutomataMinimizationTime, 16 MinimizatonAttempts, 1134 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.5s 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: 11.3s, ICFG_INTERPRETER_ENTERED_PROCEDURES: 12, DAG_INTERPRETER_EARLY_EXIT_QUERIES_NONTRIVIAL: 104, DAG_INTERPRETER_EARLY_EXITS: 3, TOOLS_POST_APPLICATIONS: 101, TOOLS_POST_TIME: 2.8s, TOOLS_POST_CALL_APPLICATIONS: 36, TOOLS_POST_CALL_TIME: 4.0s, TOOLS_POST_RETURN_APPLICATIONS: 24, TOOLS_POST_RETURN_TIME: 1.8s, TOOLS_QUANTIFIERELIM_APPLICATIONS: 161, TOOLS_QUANTIFIERELIM_TIME: 8.4s, TOOLS_QUANTIFIERELIM_MAX_TIME: 0.4s, FLUID_QUERY_TIME: 0.0s, FLUID_QUERIES: 265, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 33, DOMAIN_JOIN_TIME: 2.2s, 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.1s, DAG_COMPRESSION_PROCESSED_NODES: 3073, DAG_COMPRESSION_RETAINED_NODES: 352, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-23 15:36:46,838 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_50349da6-1d01-4fd6-9142-69d06621bce9/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE